/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/s3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:42:09,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:42:09,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:42:10,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:42:10,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:42:10,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:42:10,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:42:10,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:42:10,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:42:10,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:42:10,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:42:10,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:42:10,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:42:10,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:42:10,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:42:10,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:42:10,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:42:10,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:42:10,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:42:10,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:42:10,041 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:42:10,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:42:10,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:42:10,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:42:10,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:42:10,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:42:10,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:42:10,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:42:10,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:42:10,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:42:10,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:42:10,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:42:10,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:42:10,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:42:10,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:42:10,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:42:10,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:42:10,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:42:10,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:42:10,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:42:10,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:42:10,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:42:10,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:42:10,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:42:10,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:42:10,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:42:10,075 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:42:10,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:42:10,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:42:10,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:42:10,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:42:10,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:42:10,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:42:10,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:42:10,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:42:10,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:42:10,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:42:10,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:42:10,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:42:10,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:42:10,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:42:10,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:42:10,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:42:10,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:42:10,079 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:42:10,079 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:42:10,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:42:10,079 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:42:10,079 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:42:10,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:42:10,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:42:10,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:42:10,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:42:10,320 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:42:10,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2022-04-28 02:42:10,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeab8e4d3/f7d06ae086e84c7f847a7ae685eea6a7/FLAGc036087c5 [2022-04-28 02:42:10,802 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:42:10,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2022-04-28 02:42:10,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeab8e4d3/f7d06ae086e84c7f847a7ae685eea6a7/FLAGc036087c5 [2022-04-28 02:42:10,838 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeab8e4d3/f7d06ae086e84c7f847a7ae685eea6a7 [2022-04-28 02:42:10,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:42:10,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:42:10,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:10,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:42:10,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:42:10,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:10" (1/1) ... [2022-04-28 02:42:10,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156b4a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:10, skipping insertion in model container [2022-04-28 02:42:10,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:10" (1/1) ... [2022-04-28 02:42:10,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:42:10,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:42:11,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[64167,64180] [2022-04-28 02:42:11,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:11,257 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:42:11,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[64167,64180] [2022-04-28 02:42:11,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:11,385 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:42:11,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:11 WrapperNode [2022-04-28 02:42:11,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:11,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:42:11,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:42:11,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:42:11,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:11" (1/1) ... [2022-04-28 02:42:11,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:11" (1/1) ... [2022-04-28 02:42:11,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:11" (1/1) ... [2022-04-28 02:42:11,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:11" (1/1) ... [2022-04-28 02:42:11,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:11" (1/1) ... [2022-04-28 02:42:11,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:11" (1/1) ... [2022-04-28 02:42:11,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:11" (1/1) ... [2022-04-28 02:42:11,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:42:11,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:42:11,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:42:11,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:42:11,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:11" (1/1) ... [2022-04-28 02:42:11,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:42:11,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:11,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:42:11,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:42:11,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:42:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:42:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:42:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-28 02:42:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-28 02:42:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:42:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-28 02:42:11,620 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 02:42:11,620 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 02:42:11,620 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 02:42:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:42:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:42:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:42:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:42:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 02:42:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 02:42:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 02:42:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 02:42:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 02:42:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:42:11,818 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:42:11,819 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:42:13,728 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 02:42:14,138 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-28 02:42:14,139 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-28 02:42:14,152 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:42:14,159 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:42:14,159 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:42:14,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:14 BoogieIcfgContainer [2022-04-28 02:42:14,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:42:14,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:42:14,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:42:14,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:42:14,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:42:10" (1/3) ... [2022-04-28 02:42:14,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4164ff78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:14, skipping insertion in model container [2022-04-28 02:42:14,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:11" (2/3) ... [2022-04-28 02:42:14,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4164ff78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:14, skipping insertion in model container [2022-04-28 02:42:14,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:14" (3/3) ... [2022-04-28 02:42:14,167 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-04-28 02:42:14,178 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:42:14,179 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:42:14,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:42:14,220 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6529cc9b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@335d3cf2 [2022-04-28 02:42:14,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:42:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 02:42:14,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:14,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:14,236 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 1 times [2022-04-28 02:42:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:14,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2076006001] [2022-04-28 02:42:14,255 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:42:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 2 times [2022-04-28 02:42:14,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:14,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375535188] [2022-04-28 02:42:14,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:14,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:14,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:14,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-28 02:42:14,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-28 02:42:14,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-28 02:42:14,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {149#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:14,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-28 02:42:14,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-28 02:42:14,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-28 02:42:14,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-28 02:42:14,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {143#true} is VALID [2022-04-28 02:42:14,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {143#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {143#true} is VALID [2022-04-28 02:42:14,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(= 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)))); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !false; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem56;havoc #t~mem56; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 02:42:14,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-28 02:42:14,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-28 02:42:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:14,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:14,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375535188] [2022-04-28 02:42:14,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375535188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:14,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:14,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:42:14,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:14,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2076006001] [2022-04-28 02:42:14,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2076006001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:14,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:14,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:42:14,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423395052] [2022-04-28 02:42:14,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:14,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:42:14,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:14,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:14,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:14,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:42:14,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:14,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:42:14,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:42:14,827 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 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 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:17,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:42:19,945 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:42:21,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:42:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:23,057 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2022-04-28 02:42:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:42:23,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:42:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 637 transitions. [2022-04-28 02:42:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 637 transitions. [2022-04-28 02:42:23,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 637 transitions. [2022-04-28 02:42:23,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 637 edges. 637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:23,634 INFO L225 Difference]: With dead ends: 385 [2022-04-28 02:42:23,634 INFO L226 Difference]: Without dead ends: 223 [2022-04-28 02:42:23,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:42:23,645 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 179 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:23,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 419 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 238 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-04-28 02:42:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-04-28 02:42:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-04-28 02:42:23,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:23,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:23,706 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:23,706 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:23,719 INFO L93 Difference]: Finished difference Result 223 states and 327 transitions. [2022-04-28 02:42:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2022-04-28 02:42:23,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:23,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:23,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 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 223 states. [2022-04-28 02:42:23,729 INFO L87 Difference]: Start difference. First operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 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 223 states. [2022-04-28 02:42:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:23,740 INFO L93 Difference]: Finished difference Result 223 states and 327 transitions. [2022-04-28 02:42:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2022-04-28 02:42:23,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:23,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:23,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:23,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2022-04-28 02:42:23,753 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2022-04-28 02:42:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:23,753 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2022-04-28 02:42:23,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:23,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 223 states and 327 transitions. [2022-04-28 02:42:24,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2022-04-28 02:42:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 02:42:24,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:24,060 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:24,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:42:24,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:24,061 INFO L85 PathProgramCache]: Analyzing trace with hash 969835136, now seen corresponding path program 1 times [2022-04-28 02:42:24,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:24,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1933188815] [2022-04-28 02:42:24,062 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:24,062 INFO L85 PathProgramCache]: Analyzing trace with hash 969835136, now seen corresponding path program 2 times [2022-04-28 02:42:24,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:24,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610691040] [2022-04-28 02:42:24,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:24,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:24,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:24,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {1820#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {1814#true} is VALID [2022-04-28 02:42:24,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {1814#true} assume true; {1814#true} is VALID [2022-04-28 02:42:24,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1814#true} {1814#true} #591#return; {1814#true} is VALID [2022-04-28 02:42:24,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {1814#true} call ULTIMATE.init(); {1820#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:24,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {1820#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {1814#true} is VALID [2022-04-28 02:42:24,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {1814#true} assume true; {1814#true} is VALID [2022-04-28 02:42:24,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1814#true} {1814#true} #591#return; {1814#true} is VALID [2022-04-28 02:42:24,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {1814#true} call #t~ret159 := main(); {1814#true} is VALID [2022-04-28 02:42:24,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {1814#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {1814#true} is VALID [2022-04-28 02:42:24,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {1814#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {1814#true} is VALID [2022-04-28 02:42:24,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {1814#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 02:42:24,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {1814#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {1814#true} is VALID [2022-04-28 02:42:24,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {1814#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {1814#true} is VALID [2022-04-28 02:42:24,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {1814#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1814#true} is VALID [2022-04-28 02:42:24,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {1814#true} assume !false; {1814#true} is VALID [2022-04-28 02:42:24,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {1814#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 02:42:24,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {1814#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 02:42:24,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {1814#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 02:42:24,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {1814#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 02:42:24,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {1814#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 02:42:24,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {1814#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 02:42:24,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {1814#true} assume 4368 == #t~mem48;havoc #t~mem48; {1814#true} is VALID [2022-04-28 02:42:24,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {1814#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {1814#true} is VALID [2022-04-28 02:42:24,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {1814#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {1819#(= 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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !false; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume 4432 == #t~mem56;havoc #t~mem56; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 02:42:24,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume 5 == ~blastFlag~0; {1815#false} is VALID [2022-04-28 02:42:24,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {1815#false} assume !false; {1815#false} is VALID [2022-04-28 02:42:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:24,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:24,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610691040] [2022-04-28 02:42:24,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610691040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:24,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:24,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:42:24,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:24,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1933188815] [2022-04-28 02:42:24,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1933188815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:24,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:24,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:42:24,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974193616] [2022-04-28 02:42:24,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:24,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 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 45 [2022-04-28 02:42:24,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:24,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:24,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:24,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:42:24,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:24,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:42:24,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:42:24,347 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:26,372 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:42:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:27,557 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2022-04-28 02:42:27,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:42:27,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 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 45 [2022-04-28 02:42:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-28 02:42:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-28 02:42:27,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 492 transitions. [2022-04-28 02:42:27,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:27,995 INFO L225 Difference]: With dead ends: 432 [2022-04-28 02:42:27,995 INFO L226 Difference]: Without dead ends: 325 [2022-04-28 02:42:27,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:42:27,997 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:27,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 02:42:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-04-28 02:42:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-04-28 02:42:28,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:28,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,015 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,015 INFO L87 Difference]: Start difference. First operand 325 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:28,037 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2022-04-28 02:42:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-28 02:42:28,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:28,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:28,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 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 325 states. [2022-04-28 02:42:28,039 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 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 325 states. [2022-04-28 02:42:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:28,061 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2022-04-28 02:42:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-28 02:42:28,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:28,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:28,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:28,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2022-04-28 02:42:28,076 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2022-04-28 02:42:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:28,076 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2022-04-28 02:42:28,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 476 transitions. [2022-04-28 02:42:28,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-28 02:42:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 02:42:28,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:28,425 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:28,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:42:28,425 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2112862728, now seen corresponding path program 1 times [2022-04-28 02:42:28,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:28,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [64876814] [2022-04-28 02:42:28,426 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2112862728, now seen corresponding path program 2 times [2022-04-28 02:42:28,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:28,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650426752] [2022-04-28 02:42:28,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:28,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:28,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {3994#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {3987#true} is VALID [2022-04-28 02:42:28,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {3987#true} assume true; {3987#true} is VALID [2022-04-28 02:42:28,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3987#true} {3987#true} #591#return; {3987#true} is VALID [2022-04-28 02:42:28,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {3987#true} call ULTIMATE.init(); {3994#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:28,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {3994#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {3987#true} is VALID [2022-04-28 02:42:28,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {3987#true} assume true; {3987#true} is VALID [2022-04-28 02:42:28,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3987#true} {3987#true} #591#return; {3987#true} is VALID [2022-04-28 02:42:28,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {3987#true} call #t~ret159 := main(); {3987#true} is VALID [2022-04-28 02:42:28,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {3987#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {3987#true} is VALID [2022-04-28 02:42:28,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {3987#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {3987#true} is VALID [2022-04-28 02:42:28,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {3987#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {3987#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {3987#true} is VALID [2022-04-28 02:42:28,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {3987#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {3987#true} is VALID [2022-04-28 02:42:28,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {3987#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3987#true} is VALID [2022-04-28 02:42:28,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {3987#true} assume !false; {3987#true} is VALID [2022-04-28 02:42:28,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {3987#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {3987#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {3987#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {3987#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {3987#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {3987#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {3987#true} assume 4368 == #t~mem48;havoc #t~mem48; {3987#true} is VALID [2022-04-28 02:42:28,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {3987#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {3987#true} is VALID [2022-04-28 02:42:28,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {3987#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3987#true} is VALID [2022-04-28 02:42:28,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {3987#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {3987#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {3987#true} is VALID [2022-04-28 02:42:28,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {3987#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {3987#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {3987#true} is VALID [2022-04-28 02:42:28,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {3987#true} ~skip~0 := 0; {3987#true} is VALID [2022-04-28 02:42:28,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {3987#true} assume !false; {3987#true} is VALID [2022-04-28 02:42:28,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {3987#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {3987#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {3987#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {3987#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {3987#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {3987#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {3987#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {3987#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {3987#true} assume 4384 == #t~mem50;havoc #t~mem50; {3987#true} is VALID [2022-04-28 02:42:28,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {3987#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {3987#true} is VALID [2022-04-28 02:42:28,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {3987#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {3987#true} is VALID [2022-04-28 02:42:28,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {3987#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 02:42:28,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {3987#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,686 INFO L290 TraceCheckUtils]: 55: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:28,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {3992#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3993#(= |ssl3_connect_#t~mem56| 4560)} is VALID [2022-04-28 02:42:28,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {3993#(= |ssl3_connect_#t~mem56| 4560)} assume 4432 == #t~mem56;havoc #t~mem56; {3988#false} is VALID [2022-04-28 02:42:28,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {3988#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {3988#false} is VALID [2022-04-28 02:42:28,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {3988#false} assume 5 == ~blastFlag~0; {3988#false} is VALID [2022-04-28 02:42:28,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {3988#false} assume !false; {3988#false} is VALID [2022-04-28 02:42:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 02:42:28,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:28,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650426752] [2022-04-28 02:42:28,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650426752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:28,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:28,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:28,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:28,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [64876814] [2022-04-28 02:42:28,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [64876814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:28,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:28,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:28,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427139969] [2022-04-28 02:42:28,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:28,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 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 63 [2022-04-28 02:42:28,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:28,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:28,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:42:28,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:28,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:42:28,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:42:28,749 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:30,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:42:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:32,349 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2022-04-28 02:42:32,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:42:32,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 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 63 [2022-04-28 02:42:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2022-04-28 02:42:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2022-04-28 02:42:32,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 481 transitions. [2022-04-28 02:42:32,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 481 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:32,717 INFO L225 Difference]: With dead ends: 825 [2022-04-28 02:42:32,717 INFO L226 Difference]: Without dead ends: 513 [2022-04-28 02:42:32,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:42:32,719 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 98 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:32,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 582 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 552 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 02:42:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-04-28 02:42:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2022-04-28 02:42:32,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:32,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 513 states. Second operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:32,740 INFO L74 IsIncluded]: Start isIncluded. First operand 513 states. Second operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:32,741 INFO L87 Difference]: Start difference. First operand 513 states. Second operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:32,757 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2022-04-28 02:42:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 755 transitions. [2022-04-28 02:42:32,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:32,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:32,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 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 513 states. [2022-04-28 02:42:32,759 INFO L87 Difference]: Start difference. First operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 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 513 states. [2022-04-28 02:42:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:32,774 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2022-04-28 02:42:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 755 transitions. [2022-04-28 02:42:32,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:32,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:32,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:32,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2022-04-28 02:42:32,787 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2022-04-28 02:42:32,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:32,788 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2022-04-28 02:42:32,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:32,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 375 states and 562 transitions. [2022-04-28 02:42:33,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2022-04-28 02:42:33,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 02:42:33,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:33,185 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:33,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:42:33,186 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:33,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2048091062, now seen corresponding path program 1 times [2022-04-28 02:42:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:33,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [171301766] [2022-04-28 02:42:33,187 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:33,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2048091062, now seen corresponding path program 2 times [2022-04-28 02:42:33,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:33,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993113573] [2022-04-28 02:42:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:33,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:33,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:33,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {7432#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {7425#true} is VALID [2022-04-28 02:42:33,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {7425#true} assume true; {7425#true} is VALID [2022-04-28 02:42:33,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7425#true} {7425#true} #591#return; {7425#true} is VALID [2022-04-28 02:42:33,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {7425#true} call ULTIMATE.init(); {7432#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:33,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {7432#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {7425#true} is VALID [2022-04-28 02:42:33,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {7425#true} assume true; {7425#true} is VALID [2022-04-28 02:42:33,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7425#true} {7425#true} #591#return; {7425#true} is VALID [2022-04-28 02:42:33,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {7425#true} call #t~ret159 := main(); {7425#true} is VALID [2022-04-28 02:42:33,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {7425#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {7425#true} is VALID [2022-04-28 02:42:33,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {7425#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {7425#true} is VALID [2022-04-28 02:42:33,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {7425#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {7425#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {7425#true} is VALID [2022-04-28 02:42:33,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {7425#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {7425#true} is VALID [2022-04-28 02:42:33,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {7425#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7425#true} is VALID [2022-04-28 02:42:33,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {7425#true} assume !false; {7425#true} is VALID [2022-04-28 02:42:33,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {7425#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {7425#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {7425#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {7425#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {7425#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {7425#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {7425#true} assume 4368 == #t~mem48;havoc #t~mem48; {7425#true} is VALID [2022-04-28 02:42:33,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {7425#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {7425#true} is VALID [2022-04-28 02:42:33,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {7425#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7425#true} is VALID [2022-04-28 02:42:33,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {7425#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {7425#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {7425#true} is VALID [2022-04-28 02:42:33,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {7425#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {7425#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7425#true} is VALID [2022-04-28 02:42:33,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {7425#true} ~skip~0 := 0; {7425#true} is VALID [2022-04-28 02:42:33,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {7425#true} assume !false; {7425#true} is VALID [2022-04-28 02:42:33,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {7425#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {7425#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {7425#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {7425#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {7425#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {7425#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {7425#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {7425#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {7425#true} assume 4384 == #t~mem50;havoc #t~mem50; {7425#true} is VALID [2022-04-28 02:42:33,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {7425#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {7425#true} is VALID [2022-04-28 02:42:33,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {7425#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {7425#true} is VALID [2022-04-28 02:42:33,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {7425#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 02:42:33,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {7425#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {7430#(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); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,403 INFO L290 TraceCheckUtils]: 54: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,404 INFO L290 TraceCheckUtils]: 55: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,404 INFO L290 TraceCheckUtils]: 57: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:33,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {7430#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7431#(not (= |ssl3_connect_#t~mem56| 4432))} is VALID [2022-04-28 02:42:33,405 INFO L290 TraceCheckUtils]: 59: Hoare triple {7431#(not (= |ssl3_connect_#t~mem56| 4432))} assume 4432 == #t~mem56;havoc #t~mem56; {7426#false} is VALID [2022-04-28 02:42:33,405 INFO L290 TraceCheckUtils]: 60: Hoare triple {7426#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {7426#false} is VALID [2022-04-28 02:42:33,405 INFO L290 TraceCheckUtils]: 61: Hoare triple {7426#false} assume 5 == ~blastFlag~0; {7426#false} is VALID [2022-04-28 02:42:33,406 INFO L290 TraceCheckUtils]: 62: Hoare triple {7426#false} assume !false; {7426#false} is VALID [2022-04-28 02:42:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 02:42:33,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:33,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993113573] [2022-04-28 02:42:33,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993113573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:33,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:33,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:33,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:33,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [171301766] [2022-04-28 02:42:33,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [171301766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:33,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:33,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:33,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754148428] [2022-04-28 02:42:33,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:33,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 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 63 [2022-04-28 02:42:33,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:33,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:33,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:33,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:42:33,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:33,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:42:33,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:42:33,460 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:35,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:42:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:36,697 INFO L93 Difference]: Finished difference Result 1012 states and 1518 transitions. [2022-04-28 02:42:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:42:36,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 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 63 [2022-04-28 02:42:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 02:42:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 02:42:36,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-28 02:42:37,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:37,113 INFO L225 Difference]: With dead ends: 1012 [2022-04-28 02:42:37,113 INFO L226 Difference]: Without dead ends: 650 [2022-04-28 02:42:37,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:42:37,115 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 108 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:37,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 285 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 02:42:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-04-28 02:42:37,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 397. [2022-04-28 02:42:37,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:37,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:37,137 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:37,138 INFO L87 Difference]: Start difference. First operand 650 states. Second operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:37,159 INFO L93 Difference]: Finished difference Result 650 states and 970 transitions. [2022-04-28 02:42:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 970 transitions. [2022-04-28 02:42:37,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:37,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:37,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 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 650 states. [2022-04-28 02:42:37,163 INFO L87 Difference]: Start difference. First operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 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 650 states. [2022-04-28 02:42:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:37,184 INFO L93 Difference]: Finished difference Result 650 states and 970 transitions. [2022-04-28 02:42:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 970 transitions. [2022-04-28 02:42:37,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:37,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:37,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:37,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 602 transitions. [2022-04-28 02:42:37,199 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 602 transitions. Word has length 63 [2022-04-28 02:42:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:37,199 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 602 transitions. [2022-04-28 02:42:37,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:37,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 397 states and 602 transitions. [2022-04-28 02:42:37,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 602 transitions. [2022-04-28 02:42:37,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 02:42:37,804 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:37,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:37,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 02:42:37,805 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:37,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:37,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1078652993, now seen corresponding path program 1 times [2022-04-28 02:42:37,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:37,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957959983] [2022-04-28 02:42:37,806 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1078652993, now seen corresponding path program 2 times [2022-04-28 02:42:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:37,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429982903] [2022-04-28 02:42:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:38,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:38,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {11562#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {11555#true} is VALID [2022-04-28 02:42:38,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {11555#true} assume true; {11555#true} is VALID [2022-04-28 02:42:38,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11555#true} {11555#true} #591#return; {11555#true} is VALID [2022-04-28 02:42:38,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {11555#true} call ULTIMATE.init(); {11562#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:38,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {11562#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {11555#true} is VALID [2022-04-28 02:42:38,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {11555#true} assume true; {11555#true} is VALID [2022-04-28 02:42:38,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11555#true} {11555#true} #591#return; {11555#true} is VALID [2022-04-28 02:42:38,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {11555#true} call #t~ret159 := main(); {11555#true} is VALID [2022-04-28 02:42:38,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {11555#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {11555#true} is VALID [2022-04-28 02:42:38,018 INFO L272 TraceCheckUtils]: 6: Hoare triple {11555#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {11555#true} is VALID [2022-04-28 02:42:38,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {11555#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {11555#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {11555#true} is VALID [2022-04-28 02:42:38,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {11555#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {11555#true} is VALID [2022-04-28 02:42:38,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {11555#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11555#true} is VALID [2022-04-28 02:42:38,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {11555#true} assume !false; {11555#true} is VALID [2022-04-28 02:42:38,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {11555#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {11555#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {11555#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {11555#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {11555#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {11555#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {11555#true} assume 4368 == #t~mem48;havoc #t~mem48; {11555#true} is VALID [2022-04-28 02:42:38,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {11555#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {11555#true} is VALID [2022-04-28 02:42:38,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {11555#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11555#true} is VALID [2022-04-28 02:42:38,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {11555#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {11555#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {11555#true} is VALID [2022-04-28 02:42:38,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {11555#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {11555#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11555#true} is VALID [2022-04-28 02:42:38,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {11555#true} ~skip~0 := 0; {11555#true} is VALID [2022-04-28 02:42:38,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {11555#true} assume !false; {11555#true} is VALID [2022-04-28 02:42:38,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {11555#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {11555#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {11555#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {11555#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {11555#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {11555#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {11555#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {11555#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {11555#true} assume 4384 == #t~mem50;havoc #t~mem50; {11555#true} is VALID [2022-04-28 02:42:38,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {11555#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {11555#true} is VALID [2022-04-28 02:42:38,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {11555#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {11555#true} is VALID [2022-04-28 02:42:38,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {11555#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {11555#true} is VALID [2022-04-28 02:42:38,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {11555#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,039 INFO L290 TraceCheckUtils]: 47: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,042 INFO L290 TraceCheckUtils]: 51: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,043 INFO L290 TraceCheckUtils]: 54: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:38,046 INFO L290 TraceCheckUtils]: 59: Hoare triple {11560#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11561#(not (= |ssl3_connect_#t~mem57| 4433))} is VALID [2022-04-28 02:42:38,046 INFO L290 TraceCheckUtils]: 60: Hoare triple {11561#(not (= |ssl3_connect_#t~mem57| 4433))} assume 4433 == #t~mem57;havoc #t~mem57; {11556#false} is VALID [2022-04-28 02:42:38,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {11556#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {11556#false} is VALID [2022-04-28 02:42:38,047 INFO L290 TraceCheckUtils]: 62: Hoare triple {11556#false} assume 5 == ~blastFlag~0; {11556#false} is VALID [2022-04-28 02:42:38,047 INFO L290 TraceCheckUtils]: 63: Hoare triple {11556#false} assume !false; {11556#false} is VALID [2022-04-28 02:42:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 02:42:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:38,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429982903] [2022-04-28 02:42:38,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429982903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:38,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:38,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:38,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:38,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957959983] [2022-04-28 02:42:38,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957959983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:38,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:38,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:38,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145437751] [2022-04-28 02:42:38,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:38,058 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 64 [2022-04-28 02:42:38,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:38,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:38,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:38,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:42:38,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:38,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:42:38,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:42:38,107 INFO L87 Difference]: Start difference. First operand 397 states and 602 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:40,170 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:42:41,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:41,354 INFO L93 Difference]: Finished difference Result 1056 states and 1598 transitions. [2022-04-28 02:42:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:42:41,355 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 64 [2022-04-28 02:42:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 02:42:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 02:42:41,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-28 02:42:41,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:41,795 INFO L225 Difference]: With dead ends: 1056 [2022-04-28 02:42:41,795 INFO L226 Difference]: Without dead ends: 672 [2022-04-28 02:42:41,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:42:41,797 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 108 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:41,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 02:42:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-04-28 02:42:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 472. [2022-04-28 02:42:41,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:41,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 672 states. Second operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:41,824 INFO L74 IsIncluded]: Start isIncluded. First operand 672 states. Second operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:41,825 INFO L87 Difference]: Start difference. First operand 672 states. Second operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:41,847 INFO L93 Difference]: Finished difference Result 672 states and 1010 transitions. [2022-04-28 02:42:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1010 transitions. [2022-04-28 02:42:41,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:41,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:41,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 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 672 states. [2022-04-28 02:42:41,850 INFO L87 Difference]: Start difference. First operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 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 672 states. [2022-04-28 02:42:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:41,872 INFO L93 Difference]: Finished difference Result 672 states and 1010 transitions. [2022-04-28 02:42:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1010 transitions. [2022-04-28 02:42:41,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:41,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:41,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:41,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 734 transitions. [2022-04-28 02:42:41,890 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 734 transitions. Word has length 64 [2022-04-28 02:42:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:41,891 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 734 transitions. [2022-04-28 02:42:41,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:41,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 472 states and 734 transitions. [2022-04-28 02:42:42,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 734 edges. 734 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 734 transitions. [2022-04-28 02:42:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 02:42:42,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:42,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:42,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 02:42:42,578 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash 917238579, now seen corresponding path program 1 times [2022-04-28 02:42:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:42,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1111957765] [2022-04-28 02:42:42,579 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash 917238579, now seen corresponding path program 2 times [2022-04-28 02:42:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:42,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365363964] [2022-04-28 02:42:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:42,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:42,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {15974#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {15967#true} is VALID [2022-04-28 02:42:42,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {15967#true} assume true; {15967#true} is VALID [2022-04-28 02:42:42,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15967#true} {15967#true} #591#return; {15967#true} is VALID [2022-04-28 02:42:42,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {15967#true} call ULTIMATE.init(); {15974#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:42,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {15974#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {15967#true} is VALID [2022-04-28 02:42:42,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {15967#true} assume true; {15967#true} is VALID [2022-04-28 02:42:42,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15967#true} {15967#true} #591#return; {15967#true} is VALID [2022-04-28 02:42:42,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {15967#true} call #t~ret159 := main(); {15967#true} is VALID [2022-04-28 02:42:42,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {15967#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {15967#true} is VALID [2022-04-28 02:42:42,761 INFO L272 TraceCheckUtils]: 6: Hoare triple {15967#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {15967#true} is VALID [2022-04-28 02:42:42,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {15967#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {15967#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {15967#true} is VALID [2022-04-28 02:42:42,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {15967#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {15967#true} is VALID [2022-04-28 02:42:42,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {15967#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15967#true} is VALID [2022-04-28 02:42:42,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {15967#true} assume !false; {15967#true} is VALID [2022-04-28 02:42:42,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {15967#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {15967#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {15967#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {15967#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {15967#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {15967#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {15967#true} assume 4368 == #t~mem48;havoc #t~mem48; {15967#true} is VALID [2022-04-28 02:42:42,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {15967#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {15967#true} is VALID [2022-04-28 02:42:42,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {15967#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15967#true} is VALID [2022-04-28 02:42:42,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {15967#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {15967#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {15967#true} is VALID [2022-04-28 02:42:42,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {15967#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {15967#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15967#true} is VALID [2022-04-28 02:42:42,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {15967#true} ~skip~0 := 0; {15967#true} is VALID [2022-04-28 02:42:42,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {15967#true} assume !false; {15967#true} is VALID [2022-04-28 02:42:42,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {15967#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {15967#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {15967#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {15967#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {15967#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {15967#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {15967#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {15967#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {15967#true} assume 4384 == #t~mem50;havoc #t~mem50; {15967#true} is VALID [2022-04-28 02:42:42,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {15967#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {15967#true} is VALID [2022-04-28 02:42:42,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {15967#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15967#true} is VALID [2022-04-28 02:42:42,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {15967#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {15967#true} is VALID [2022-04-28 02:42:42,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {15967#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,767 INFO L290 TraceCheckUtils]: 42: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,771 INFO L290 TraceCheckUtils]: 51: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,778 INFO L290 TraceCheckUtils]: 54: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:42,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {15972#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15973#(= |ssl3_connect_#t~mem58| 4560)} is VALID [2022-04-28 02:42:42,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {15973#(= |ssl3_connect_#t~mem58| 4560)} assume 4448 == #t~mem58;havoc #t~mem58; {15968#false} is VALID [2022-04-28 02:42:42,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {15968#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {15968#false} is VALID [2022-04-28 02:42:42,781 INFO L290 TraceCheckUtils]: 63: Hoare triple {15968#false} assume 4 == ~blastFlag~0; {15968#false} is VALID [2022-04-28 02:42:42,781 INFO L290 TraceCheckUtils]: 64: Hoare triple {15968#false} assume !false; {15968#false} is VALID [2022-04-28 02:42:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 02:42:42,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:42,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365363964] [2022-04-28 02:42:42,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365363964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:42,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:42,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:42,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:42,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1111957765] [2022-04-28 02:42:42,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1111957765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:42,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:42,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:42,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878039004] [2022-04-28 02:42:42,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:42,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 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 65 [2022-04-28 02:42:42,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:42,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:42,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:42,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:42:42,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:42,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:42:42,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:42:42,834 INFO L87 Difference]: Start difference. First operand 472 states and 734 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:44,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:42:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:46,437 INFO L93 Difference]: Finished difference Result 1113 states and 1721 transitions. [2022-04-28 02:42:46,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:42:46,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 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 65 [2022-04-28 02:42:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 02:42:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 02:42:46,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 02:42:46,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:46,862 INFO L225 Difference]: With dead ends: 1113 [2022-04-28 02:42:46,862 INFO L226 Difference]: Without dead ends: 654 [2022-04-28 02:42:46,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:42:46,864 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 91 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:46,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 574 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 544 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 02:42:46,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-04-28 02:42:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 526. [2022-04-28 02:42:46,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:46,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 654 states. Second operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 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-28 02:42:46,894 INFO L74 IsIncluded]: Start isIncluded. First operand 654 states. Second operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 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-28 02:42:46,895 INFO L87 Difference]: Start difference. First operand 654 states. Second operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 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-28 02:42:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:46,917 INFO L93 Difference]: Finished difference Result 654 states and 1002 transitions. [2022-04-28 02:42:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1002 transitions. [2022-04-28 02:42:46,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:46,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:46,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 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 654 states. [2022-04-28 02:42:46,921 INFO L87 Difference]: Start difference. First operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 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 654 states. [2022-04-28 02:42:46,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:46,941 INFO L93 Difference]: Finished difference Result 654 states and 1002 transitions. [2022-04-28 02:42:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1002 transitions. [2022-04-28 02:42:46,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:46,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:46,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:46,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 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-28 02:42:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 824 transitions. [2022-04-28 02:42:46,987 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 824 transitions. Word has length 65 [2022-04-28 02:42:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:46,987 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 824 transitions. [2022-04-28 02:42:46,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:46,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 526 states and 824 transitions. [2022-04-28 02:42:47,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 824 edges. 824 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 824 transitions. [2022-04-28 02:42:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 02:42:47,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:47,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:47,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 02:42:47,636 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:47,636 INFO L85 PathProgramCache]: Analyzing trace with hash 979278193, now seen corresponding path program 1 times [2022-04-28 02:42:47,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:47,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1570728768] [2022-04-28 02:42:47,637 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:47,637 INFO L85 PathProgramCache]: Analyzing trace with hash 979278193, now seen corresponding path program 2 times [2022-04-28 02:42:47,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:47,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459440219] [2022-04-28 02:42:47,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:47,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:47,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:47,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {20572#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {20565#true} is VALID [2022-04-28 02:42:47,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {20565#true} assume true; {20565#true} is VALID [2022-04-28 02:42:47,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20565#true} {20565#true} #591#return; {20565#true} is VALID [2022-04-28 02:42:47,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {20565#true} call ULTIMATE.init(); {20572#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:47,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {20572#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {20565#true} is VALID [2022-04-28 02:42:47,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {20565#true} assume true; {20565#true} is VALID [2022-04-28 02:42:47,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20565#true} {20565#true} #591#return; {20565#true} is VALID [2022-04-28 02:42:47,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {20565#true} call #t~ret159 := main(); {20565#true} is VALID [2022-04-28 02:42:47,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {20565#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {20565#true} is VALID [2022-04-28 02:42:47,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {20565#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {20565#true} is VALID [2022-04-28 02:42:47,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {20565#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {20565#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {20565#true} is VALID [2022-04-28 02:42:47,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {20565#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {20565#true} is VALID [2022-04-28 02:42:47,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {20565#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20565#true} is VALID [2022-04-28 02:42:47,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {20565#true} assume !false; {20565#true} is VALID [2022-04-28 02:42:47,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {20565#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {20565#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {20565#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {20565#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {20565#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {20565#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {20565#true} assume 4368 == #t~mem48;havoc #t~mem48; {20565#true} is VALID [2022-04-28 02:42:47,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {20565#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {20565#true} is VALID [2022-04-28 02:42:47,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {20565#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20565#true} is VALID [2022-04-28 02:42:47,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {20565#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {20565#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {20565#true} is VALID [2022-04-28 02:42:47,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {20565#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {20565#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20565#true} is VALID [2022-04-28 02:42:47,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {20565#true} ~skip~0 := 0; {20565#true} is VALID [2022-04-28 02:42:47,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {20565#true} assume !false; {20565#true} is VALID [2022-04-28 02:42:47,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {20565#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {20565#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {20565#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {20565#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {20565#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {20565#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {20565#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {20565#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {20565#true} assume 4384 == #t~mem50;havoc #t~mem50; {20565#true} is VALID [2022-04-28 02:42:47,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {20565#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {20565#true} is VALID [2022-04-28 02:42:47,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {20565#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {20565#true} is VALID [2022-04-28 02:42:47,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {20565#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {20565#true} is VALID [2022-04-28 02:42:47,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {20565#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,806 INFO L290 TraceCheckUtils]: 50: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,807 INFO L290 TraceCheckUtils]: 51: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,807 INFO L290 TraceCheckUtils]: 52: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,807 INFO L290 TraceCheckUtils]: 53: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,809 INFO L290 TraceCheckUtils]: 57: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,809 INFO L290 TraceCheckUtils]: 58: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,810 INFO L290 TraceCheckUtils]: 59: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:47,810 INFO L290 TraceCheckUtils]: 60: Hoare triple {20570#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20571#(not (= |ssl3_connect_#t~mem58| 4448))} is VALID [2022-04-28 02:42:47,810 INFO L290 TraceCheckUtils]: 61: Hoare triple {20571#(not (= |ssl3_connect_#t~mem58| 4448))} assume 4448 == #t~mem58;havoc #t~mem58; {20566#false} is VALID [2022-04-28 02:42:47,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {20566#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {20566#false} is VALID [2022-04-28 02:42:47,811 INFO L290 TraceCheckUtils]: 63: Hoare triple {20566#false} assume 4 == ~blastFlag~0; {20566#false} is VALID [2022-04-28 02:42:47,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {20566#false} assume !false; {20566#false} is VALID [2022-04-28 02:42:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 02:42:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:47,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459440219] [2022-04-28 02:42:47,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459440219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:47,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:47,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:47,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:47,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1570728768] [2022-04-28 02:42:47,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1570728768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:47,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:47,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:47,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019778915] [2022-04-28 02:42:47,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:47,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 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 65 [2022-04-28 02:42:47,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:47,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:47,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:47,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:42:47,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:47,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:42:47,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:42:47,871 INFO L87 Difference]: Start difference. First operand 526 states and 824 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:49,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:42:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:50,974 INFO L93 Difference]: Finished difference Result 1314 states and 2036 transitions. [2022-04-28 02:42:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:42:50,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 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 65 [2022-04-28 02:42:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 02:42:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 02:42:50,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-28 02:42:51,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:51,347 INFO L225 Difference]: With dead ends: 1314 [2022-04-28 02:42:51,347 INFO L226 Difference]: Without dead ends: 801 [2022-04-28 02:42:51,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:42:51,348 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 106 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:51,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 284 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 02:42:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-04-28 02:42:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 550. [2022-04-28 02:42:51,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:51,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 801 states. Second operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:51,381 INFO L74 IsIncluded]: Start isIncluded. First operand 801 states. Second operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:51,382 INFO L87 Difference]: Start difference. First operand 801 states. Second operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:51,411 INFO L93 Difference]: Finished difference Result 801 states and 1226 transitions. [2022-04-28 02:42:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1226 transitions. [2022-04-28 02:42:51,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:51,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:51,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 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 801 states. [2022-04-28 02:42:51,415 INFO L87 Difference]: Start difference. First operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 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 801 states. [2022-04-28 02:42:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:51,444 INFO L93 Difference]: Finished difference Result 801 states and 1226 transitions. [2022-04-28 02:42:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1226 transitions. [2022-04-28 02:42:51,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:51,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:51,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:51,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 866 transitions. [2022-04-28 02:42:51,464 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 866 transitions. Word has length 65 [2022-04-28 02:42:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:51,464 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 866 transitions. [2022-04-28 02:42:51,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:51,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 550 states and 866 transitions. [2022-04-28 02:42:52,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 866 edges. 866 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 866 transitions. [2022-04-28 02:42:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 02:42:52,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:52,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:52,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 02:42:52,170 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1634852198, now seen corresponding path program 1 times [2022-04-28 02:42:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:52,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [674792396] [2022-04-28 02:42:52,171 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1634852198, now seen corresponding path program 2 times [2022-04-28 02:42:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:52,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108017061] [2022-04-28 02:42:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:52,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {25914#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {25907#true} is VALID [2022-04-28 02:42:52,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {25907#true} assume true; {25907#true} is VALID [2022-04-28 02:42:52,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25907#true} {25907#true} #591#return; {25907#true} is VALID [2022-04-28 02:42:52,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {25907#true} call ULTIMATE.init(); {25914#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:52,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {25914#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {25907#true} is VALID [2022-04-28 02:42:52,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {25907#true} assume true; {25907#true} is VALID [2022-04-28 02:42:52,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25907#true} {25907#true} #591#return; {25907#true} is VALID [2022-04-28 02:42:52,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {25907#true} call #t~ret159 := main(); {25907#true} is VALID [2022-04-28 02:42:52,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {25907#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {25907#true} is VALID [2022-04-28 02:42:52,344 INFO L272 TraceCheckUtils]: 6: Hoare triple {25907#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {25907#true} is VALID [2022-04-28 02:42:52,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {25907#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {25907#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {25907#true} is VALID [2022-04-28 02:42:52,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {25907#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {25907#true} is VALID [2022-04-28 02:42:52,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {25907#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25907#true} is VALID [2022-04-28 02:42:52,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {25907#true} assume !false; {25907#true} is VALID [2022-04-28 02:42:52,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {25907#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {25907#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {25907#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {25907#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {25907#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {25907#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {25907#true} assume 4368 == #t~mem48;havoc #t~mem48; {25907#true} is VALID [2022-04-28 02:42:52,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {25907#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {25907#true} is VALID [2022-04-28 02:42:52,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {25907#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25907#true} is VALID [2022-04-28 02:42:52,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {25907#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {25907#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {25907#true} is VALID [2022-04-28 02:42:52,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {25907#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {25907#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25907#true} is VALID [2022-04-28 02:42:52,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {25907#true} ~skip~0 := 0; {25907#true} is VALID [2022-04-28 02:42:52,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {25907#true} assume !false; {25907#true} is VALID [2022-04-28 02:42:52,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {25907#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {25907#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {25907#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {25907#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {25907#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {25907#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {25907#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {25907#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {25907#true} assume 4384 == #t~mem50;havoc #t~mem50; {25907#true} is VALID [2022-04-28 02:42:52,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {25907#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {25907#true} is VALID [2022-04-28 02:42:52,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {25907#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25907#true} is VALID [2022-04-28 02:42:52,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {25907#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {25907#true} is VALID [2022-04-28 02:42:52,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {25907#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,352 INFO L290 TraceCheckUtils]: 49: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,353 INFO L290 TraceCheckUtils]: 51: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,353 INFO L290 TraceCheckUtils]: 52: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,354 INFO L290 TraceCheckUtils]: 55: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,356 INFO L290 TraceCheckUtils]: 58: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,356 INFO L290 TraceCheckUtils]: 59: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:42:52,357 INFO L290 TraceCheckUtils]: 61: Hoare triple {25912#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25913#(= |ssl3_connect_#t~mem59| 4560)} is VALID [2022-04-28 02:42:52,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {25913#(= |ssl3_connect_#t~mem59| 4560)} assume 4449 == #t~mem59;havoc #t~mem59; {25908#false} is VALID [2022-04-28 02:42:52,357 INFO L290 TraceCheckUtils]: 63: Hoare triple {25908#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {25908#false} is VALID [2022-04-28 02:42:52,358 INFO L290 TraceCheckUtils]: 64: Hoare triple {25908#false} assume 4 == ~blastFlag~0; {25908#false} is VALID [2022-04-28 02:42:52,358 INFO L290 TraceCheckUtils]: 65: Hoare triple {25908#false} assume !false; {25908#false} is VALID [2022-04-28 02:42:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 02:42:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:52,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108017061] [2022-04-28 02:42:52,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108017061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:52,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:52,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:52,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:52,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [674792396] [2022-04-28 02:42:52,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [674792396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:52,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:52,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891055876] [2022-04-28 02:42:52,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:52,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 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 66 [2022-04-28 02:42:52,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:52,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:52,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:52,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:42:52,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:52,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:42:52,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:42:52,414 INFO L87 Difference]: Start difference. First operand 550 states and 866 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:54,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:42:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:55,863 INFO L93 Difference]: Finished difference Result 1259 states and 1971 transitions. [2022-04-28 02:42:55,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:42:55,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 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 66 [2022-04-28 02:42:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-28 02:42:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-28 02:42:55,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 467 transitions. [2022-04-28 02:42:56,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:56,200 INFO L225 Difference]: With dead ends: 1259 [2022-04-28 02:42:56,200 INFO L226 Difference]: Without dead ends: 722 [2022-04-28 02:42:56,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:42:56,202 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 84 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:56,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 564 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 02:42:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-04-28 02:42:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 606. [2022-04-28 02:42:56,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:56,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 722 states. Second operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:56,238 INFO L74 IsIncluded]: Start isIncluded. First operand 722 states. Second operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:56,239 INFO L87 Difference]: Start difference. First operand 722 states. Second operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:56,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:56,262 INFO L93 Difference]: Finished difference Result 722 states and 1120 transitions. [2022-04-28 02:42:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1120 transitions. [2022-04-28 02:42:56,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:56,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:56,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 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 722 states. [2022-04-28 02:42:56,266 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 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 722 states. [2022-04-28 02:42:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:56,290 INFO L93 Difference]: Finished difference Result 722 states and 1120 transitions. [2022-04-28 02:42:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1120 transitions. [2022-04-28 02:42:56,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:56,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:56,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:56,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 958 transitions. [2022-04-28 02:42:56,312 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 958 transitions. Word has length 66 [2022-04-28 02:42:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:56,312 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 958 transitions. [2022-04-28 02:42:56,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:56,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 958 transitions. [2022-04-28 02:42:57,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 958 edges. 958 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 958 transitions. [2022-04-28 02:42:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 02:42:57,103 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:57,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:57,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 02:42:57,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash 288375836, now seen corresponding path program 1 times [2022-04-28 02:42:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:57,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [512768725] [2022-04-28 02:42:57,105 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash 288375836, now seen corresponding path program 2 times [2022-04-28 02:42:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:57,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661700227] [2022-04-28 02:42:57,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:57,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:57,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {31100#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {31093#true} is VALID [2022-04-28 02:42:57,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {31093#true} assume true; {31093#true} is VALID [2022-04-28 02:42:57,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31093#true} {31093#true} #591#return; {31093#true} is VALID [2022-04-28 02:42:57,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {31093#true} call ULTIMATE.init(); {31100#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:57,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {31100#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {31093#true} is VALID [2022-04-28 02:42:57,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {31093#true} assume true; {31093#true} is VALID [2022-04-28 02:42:57,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31093#true} {31093#true} #591#return; {31093#true} is VALID [2022-04-28 02:42:57,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {31093#true} call #t~ret159 := main(); {31093#true} is VALID [2022-04-28 02:42:57,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {31093#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {31093#true} is VALID [2022-04-28 02:42:57,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {31093#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {31093#true} is VALID [2022-04-28 02:42:57,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {31093#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {31093#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {31093#true} is VALID [2022-04-28 02:42:57,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {31093#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {31093#true} is VALID [2022-04-28 02:42:57,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {31093#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {31093#true} is VALID [2022-04-28 02:42:57,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {31093#true} assume !false; {31093#true} is VALID [2022-04-28 02:42:57,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {31093#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {31093#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {31093#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {31093#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {31093#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {31093#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {31093#true} assume 4368 == #t~mem48;havoc #t~mem48; {31093#true} is VALID [2022-04-28 02:42:57,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {31093#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {31093#true} is VALID [2022-04-28 02:42:57,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {31093#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {31093#true} is VALID [2022-04-28 02:42:57,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {31093#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {31093#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {31093#true} is VALID [2022-04-28 02:42:57,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {31093#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {31093#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {31093#true} is VALID [2022-04-28 02:42:57,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {31093#true} ~skip~0 := 0; {31093#true} is VALID [2022-04-28 02:42:57,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {31093#true} assume !false; {31093#true} is VALID [2022-04-28 02:42:57,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {31093#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {31093#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {31093#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {31093#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {31093#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {31093#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {31093#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {31093#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {31093#true} assume 4384 == #t~mem50;havoc #t~mem50; {31093#true} is VALID [2022-04-28 02:42:57,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {31093#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {31093#true} is VALID [2022-04-28 02:42:57,255 INFO L290 TraceCheckUtils]: 37: Hoare triple {31093#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {31093#true} is VALID [2022-04-28 02:42:57,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {31093#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {31093#true} is VALID [2022-04-28 02:42:57,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {31093#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,258 INFO L290 TraceCheckUtils]: 43: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,258 INFO L290 TraceCheckUtils]: 44: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,258 INFO L290 TraceCheckUtils]: 45: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,259 INFO L290 TraceCheckUtils]: 47: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,259 INFO L290 TraceCheckUtils]: 48: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,261 INFO L290 TraceCheckUtils]: 53: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,261 INFO L290 TraceCheckUtils]: 54: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,261 INFO L290 TraceCheckUtils]: 55: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,262 INFO L290 TraceCheckUtils]: 58: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,263 INFO L290 TraceCheckUtils]: 59: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,263 INFO L290 TraceCheckUtils]: 60: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:42:57,263 INFO L290 TraceCheckUtils]: 61: Hoare triple {31098#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31099#(not (= 4449 |ssl3_connect_#t~mem59|))} is VALID [2022-04-28 02:42:57,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {31099#(not (= 4449 |ssl3_connect_#t~mem59|))} assume 4449 == #t~mem59;havoc #t~mem59; {31094#false} is VALID [2022-04-28 02:42:57,264 INFO L290 TraceCheckUtils]: 63: Hoare triple {31094#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {31094#false} is VALID [2022-04-28 02:42:57,264 INFO L290 TraceCheckUtils]: 64: Hoare triple {31094#false} assume 4 == ~blastFlag~0; {31094#false} is VALID [2022-04-28 02:42:57,264 INFO L290 TraceCheckUtils]: 65: Hoare triple {31094#false} assume !false; {31094#false} is VALID [2022-04-28 02:42:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 02:42:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:57,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661700227] [2022-04-28 02:42:57,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661700227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:57,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:57,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:57,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:57,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [512768725] [2022-04-28 02:42:57,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [512768725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:57,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:57,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:42:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354282164] [2022-04-28 02:42:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:57,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 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 66 [2022-04-28 02:42:57,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:57,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:57,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:57,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:42:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:57,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:42:57,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:42:57,321 INFO L87 Difference]: Start difference. First operand 606 states and 958 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:59,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:00,390 INFO L93 Difference]: Finished difference Result 1399 states and 2175 transitions. [2022-04-28 02:43:00,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:00,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 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 66 [2022-04-28 02:43:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 02:43:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 02:43:00,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-28 02:43:00,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:00,754 INFO L225 Difference]: With dead ends: 1399 [2022-04-28 02:43:00,754 INFO L226 Difference]: Without dead ends: 806 [2022-04-28 02:43:00,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:43:00,756 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 105 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:00,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 298 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 02:43:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-04-28 02:43:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 556. [2022-04-28 02:43:00,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:00,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 806 states. Second operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:00,794 INFO L74 IsIncluded]: Start isIncluded. First operand 806 states. Second operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:00,795 INFO L87 Difference]: Start difference. First operand 806 states. Second operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:00,824 INFO L93 Difference]: Finished difference Result 806 states and 1231 transitions. [2022-04-28 02:43:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1231 transitions. [2022-04-28 02:43:00,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:00,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:00,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 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 806 states. [2022-04-28 02:43:00,827 INFO L87 Difference]: Start difference. First operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 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 806 states. [2022-04-28 02:43:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:00,855 INFO L93 Difference]: Finished difference Result 806 states and 1231 transitions. [2022-04-28 02:43:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1231 transitions. [2022-04-28 02:43:00,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:00,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:00,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:00,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 875 transitions. [2022-04-28 02:43:00,872 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 875 transitions. Word has length 66 [2022-04-28 02:43:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:00,872 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 875 transitions. [2022-04-28 02:43:00,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:00,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 556 states and 875 transitions. [2022-04-28 02:43:01,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 875 edges. 875 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 875 transitions. [2022-04-28 02:43:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 02:43:01,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:01,616 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-04-28 02:43:01,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 02:43:01,617 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:01,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1163380997, now seen corresponding path program 1 times [2022-04-28 02:43:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:01,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1903462512] [2022-04-28 02:43:01,618 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:43:01,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1163380997, now seen corresponding path program 2 times [2022-04-28 02:43:01,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:01,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31768795] [2022-04-28 02:43:01,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:01,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:01,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {36634#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {36627#true} is VALID [2022-04-28 02:43:01,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {36627#true} assume true; {36627#true} is VALID [2022-04-28 02:43:01,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36627#true} {36627#true} #591#return; {36627#true} is VALID [2022-04-28 02:43:01,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {36627#true} call ULTIMATE.init(); {36634#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:01,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {36634#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {36627#true} is VALID [2022-04-28 02:43:01,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {36627#true} assume true; {36627#true} is VALID [2022-04-28 02:43:01,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36627#true} {36627#true} #591#return; {36627#true} is VALID [2022-04-28 02:43:01,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {36627#true} call #t~ret159 := main(); {36627#true} is VALID [2022-04-28 02:43:01,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {36627#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {36627#true} is VALID [2022-04-28 02:43:01,764 INFO L272 TraceCheckUtils]: 6: Hoare triple {36627#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {36627#true} is VALID [2022-04-28 02:43:01,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {36627#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {36627#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {36627#true} is VALID [2022-04-28 02:43:01,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {36627#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {36627#true} is VALID [2022-04-28 02:43:01,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {36627#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36627#true} is VALID [2022-04-28 02:43:01,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {36627#true} assume !false; {36627#true} is VALID [2022-04-28 02:43:01,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {36627#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {36627#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {36627#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {36627#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {36627#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {36627#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {36627#true} assume 4368 == #t~mem48;havoc #t~mem48; {36627#true} is VALID [2022-04-28 02:43:01,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {36627#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {36627#true} is VALID [2022-04-28 02:43:01,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {36627#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36627#true} is VALID [2022-04-28 02:43:01,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {36627#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {36627#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {36627#true} is VALID [2022-04-28 02:43:01,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {36627#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {36627#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {36627#true} is VALID [2022-04-28 02:43:01,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {36627#true} ~skip~0 := 0; {36627#true} is VALID [2022-04-28 02:43:01,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {36627#true} assume !false; {36627#true} is VALID [2022-04-28 02:43:01,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {36627#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {36627#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {36627#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {36627#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {36627#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {36627#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {36627#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {36627#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {36627#true} assume 4384 == #t~mem50;havoc #t~mem50; {36627#true} is VALID [2022-04-28 02:43:01,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {36627#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {36627#true} is VALID [2022-04-28 02:43:01,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {36627#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {36627#true} is VALID [2022-04-28 02:43:01,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {36627#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {36627#true} is VALID [2022-04-28 02:43:01,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {36627#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,775 INFO L290 TraceCheckUtils]: 55: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:01,776 INFO L290 TraceCheckUtils]: 56: Hoare triple {36632#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36633#(= |ssl3_connect_#t~mem54| 4560)} is VALID [2022-04-28 02:43:01,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {36633#(= |ssl3_connect_#t~mem54| 4560)} assume 4416 == #t~mem54;havoc #t~mem54; {36628#false} is VALID [2022-04-28 02:43:01,776 INFO L290 TraceCheckUtils]: 58: Hoare triple {36628#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {36628#false} is VALID [2022-04-28 02:43:01,776 INFO L290 TraceCheckUtils]: 59: Hoare triple {36628#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {36628#false} is VALID [2022-04-28 02:43:01,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {36628#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {36628#false} is VALID [2022-04-28 02:43:01,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {36628#false} assume !(0 == ~tmp___6~0); {36628#false} is VALID [2022-04-28 02:43:01,777 INFO L290 TraceCheckUtils]: 62: Hoare triple {36628#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,777 INFO L290 TraceCheckUtils]: 63: Hoare triple {36628#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {36628#false} is VALID [2022-04-28 02:43:01,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {36628#false} ~skip~0 := 0; {36628#false} is VALID [2022-04-28 02:43:01,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {36628#false} assume !false; {36628#false} is VALID [2022-04-28 02:43:01,777 INFO L290 TraceCheckUtils]: 66: Hoare triple {36628#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,777 INFO L290 TraceCheckUtils]: 67: Hoare triple {36628#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,777 INFO L290 TraceCheckUtils]: 68: Hoare triple {36628#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,778 INFO L290 TraceCheckUtils]: 69: Hoare triple {36628#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,778 INFO L290 TraceCheckUtils]: 70: Hoare triple {36628#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,778 INFO L290 TraceCheckUtils]: 71: Hoare triple {36628#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,778 INFO L290 TraceCheckUtils]: 72: Hoare triple {36628#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,778 INFO L290 TraceCheckUtils]: 73: Hoare triple {36628#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,778 INFO L290 TraceCheckUtils]: 74: Hoare triple {36628#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,778 INFO L290 TraceCheckUtils]: 75: Hoare triple {36628#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,778 INFO L290 TraceCheckUtils]: 76: Hoare triple {36628#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,778 INFO L290 TraceCheckUtils]: 77: Hoare triple {36628#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,778 INFO L290 TraceCheckUtils]: 78: Hoare triple {36628#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,779 INFO L290 TraceCheckUtils]: 79: Hoare triple {36628#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36628#false} is VALID [2022-04-28 02:43:01,779 INFO L290 TraceCheckUtils]: 80: Hoare triple {36628#false} assume 4432 == #t~mem56;havoc #t~mem56; {36628#false} is VALID [2022-04-28 02:43:01,779 INFO L290 TraceCheckUtils]: 81: Hoare triple {36628#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {36628#false} is VALID [2022-04-28 02:43:01,779 INFO L290 TraceCheckUtils]: 82: Hoare triple {36628#false} assume 5 == ~blastFlag~0; {36628#false} is VALID [2022-04-28 02:43:01,779 INFO L290 TraceCheckUtils]: 83: Hoare triple {36628#false} assume !false; {36628#false} is VALID [2022-04-28 02:43:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 02:43:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:01,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31768795] [2022-04-28 02:43:01,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31768795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:01,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:01,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:01,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:01,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1903462512] [2022-04-28 02:43:01,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1903462512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:01,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:01,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810007293] [2022-04-28 02:43:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:01,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 84 [2022-04-28 02:43:01,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:01,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:01,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:01,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:43:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:01,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:43:01,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:43:01,852 INFO L87 Difference]: Start difference. First operand 556 states and 875 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:03,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:05,188 INFO L93 Difference]: Finished difference Result 1271 states and 1987 transitions. [2022-04-28 02:43:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:05,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 84 [2022-04-28 02:43:05,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 02:43:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 02:43:05,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-28 02:43:05,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:05,523 INFO L225 Difference]: With dead ends: 1271 [2022-04-28 02:43:05,523 INFO L226 Difference]: Without dead ends: 728 [2022-04-28 02:43:05,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:43:05,524 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 88 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:05,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 564 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 02:43:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-04-28 02:43:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 602. [2022-04-28 02:43:05,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:05,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 728 states. Second operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:05,576 INFO L74 IsIncluded]: Start isIncluded. First operand 728 states. Second operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:05,577 INFO L87 Difference]: Start difference. First operand 728 states. Second operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:05,594 INFO L93 Difference]: Finished difference Result 728 states and 1127 transitions. [2022-04-28 02:43:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1127 transitions. [2022-04-28 02:43:05,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:05,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:05,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 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 728 states. [2022-04-28 02:43:05,596 INFO L87 Difference]: Start difference. First operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 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 728 states. [2022-04-28 02:43:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:05,619 INFO L93 Difference]: Finished difference Result 728 states and 1127 transitions. [2022-04-28 02:43:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1127 transitions. [2022-04-28 02:43:05,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:05,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:05,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:05,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 953 transitions. [2022-04-28 02:43:05,643 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 953 transitions. Word has length 84 [2022-04-28 02:43:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:05,643 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 953 transitions. [2022-04-28 02:43:05,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:05,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 602 states and 953 transitions. [2022-04-28 02:43:06,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 953 edges. 953 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 953 transitions. [2022-04-28 02:43:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 02:43:06,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:06,489 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-04-28 02:43:06,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 02:43:06,489 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:06,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2056867335, now seen corresponding path program 1 times [2022-04-28 02:43:06,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:06,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2071791886] [2022-04-28 02:43:06,490 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:43:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2056867335, now seen corresponding path program 2 times [2022-04-28 02:43:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:06,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515676469] [2022-04-28 02:43:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:06,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:06,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {41848#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {41841#true} is VALID [2022-04-28 02:43:06,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {41841#true} assume true; {41841#true} is VALID [2022-04-28 02:43:06,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41841#true} {41841#true} #591#return; {41841#true} is VALID [2022-04-28 02:43:06,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {41841#true} call ULTIMATE.init(); {41848#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:06,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {41848#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {41841#true} is VALID [2022-04-28 02:43:06,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {41841#true} assume true; {41841#true} is VALID [2022-04-28 02:43:06,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41841#true} {41841#true} #591#return; {41841#true} is VALID [2022-04-28 02:43:06,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {41841#true} call #t~ret159 := main(); {41841#true} is VALID [2022-04-28 02:43:06,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {41841#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {41841#true} is VALID [2022-04-28 02:43:06,665 INFO L272 TraceCheckUtils]: 6: Hoare triple {41841#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {41841#true} is VALID [2022-04-28 02:43:06,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {41841#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {41841#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {41841#true} is VALID [2022-04-28 02:43:06,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {41841#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {41841#true} is VALID [2022-04-28 02:43:06,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {41841#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41841#true} is VALID [2022-04-28 02:43:06,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {41841#true} assume !false; {41841#true} is VALID [2022-04-28 02:43:06,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {41841#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {41841#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {41841#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {41841#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {41841#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {41841#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {41841#true} assume 4368 == #t~mem48;havoc #t~mem48; {41841#true} is VALID [2022-04-28 02:43:06,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {41841#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {41841#true} is VALID [2022-04-28 02:43:06,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {41841#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41841#true} is VALID [2022-04-28 02:43:06,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {41841#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {41841#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {41841#true} is VALID [2022-04-28 02:43:06,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {41841#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {41841#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {41841#true} is VALID [2022-04-28 02:43:06,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {41841#true} ~skip~0 := 0; {41841#true} is VALID [2022-04-28 02:43:06,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {41841#true} assume !false; {41841#true} is VALID [2022-04-28 02:43:06,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {41841#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {41841#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {41841#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {41841#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {41841#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {41841#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {41841#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {41841#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {41841#true} assume 4384 == #t~mem50;havoc #t~mem50; {41841#true} is VALID [2022-04-28 02:43:06,668 INFO L290 TraceCheckUtils]: 36: Hoare triple {41841#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {41841#true} is VALID [2022-04-28 02:43:06,668 INFO L290 TraceCheckUtils]: 37: Hoare triple {41841#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {41841#true} is VALID [2022-04-28 02:43:06,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {41841#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {41841#true} is VALID [2022-04-28 02:43:06,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {41841#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,671 INFO L290 TraceCheckUtils]: 46: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,671 INFO L290 TraceCheckUtils]: 47: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,673 INFO L290 TraceCheckUtils]: 51: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,673 INFO L290 TraceCheckUtils]: 53: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:06,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {41846#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41847#(= |ssl3_connect_#t~mem52| 4400)} is VALID [2022-04-28 02:43:06,674 INFO L290 TraceCheckUtils]: 55: Hoare triple {41847#(= |ssl3_connect_#t~mem52| 4400)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {41842#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,674 INFO L290 TraceCheckUtils]: 57: Hoare triple {41842#false} assume 4416 == #t~mem54;havoc #t~mem54; {41842#false} is VALID [2022-04-28 02:43:06,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {41842#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {41842#false} is VALID [2022-04-28 02:43:06,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {41842#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {41842#false} is VALID [2022-04-28 02:43:06,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {41842#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {41842#false} is VALID [2022-04-28 02:43:06,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {41842#false} assume !(0 == ~tmp___6~0); {41842#false} is VALID [2022-04-28 02:43:06,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {41842#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,688 INFO L290 TraceCheckUtils]: 63: Hoare triple {41842#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {41842#false} is VALID [2022-04-28 02:43:06,688 INFO L290 TraceCheckUtils]: 64: Hoare triple {41842#false} ~skip~0 := 0; {41842#false} is VALID [2022-04-28 02:43:06,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {41842#false} assume !false; {41842#false} is VALID [2022-04-28 02:43:06,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {41842#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,688 INFO L290 TraceCheckUtils]: 67: Hoare triple {41842#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {41842#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {41842#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {41842#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,688 INFO L290 TraceCheckUtils]: 71: Hoare triple {41842#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,688 INFO L290 TraceCheckUtils]: 72: Hoare triple {41842#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,689 INFO L290 TraceCheckUtils]: 73: Hoare triple {41842#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,689 INFO L290 TraceCheckUtils]: 74: Hoare triple {41842#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,689 INFO L290 TraceCheckUtils]: 75: Hoare triple {41842#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,689 INFO L290 TraceCheckUtils]: 76: Hoare triple {41842#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,689 INFO L290 TraceCheckUtils]: 77: Hoare triple {41842#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,689 INFO L290 TraceCheckUtils]: 78: Hoare triple {41842#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,689 INFO L290 TraceCheckUtils]: 79: Hoare triple {41842#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {41842#false} is VALID [2022-04-28 02:43:06,689 INFO L290 TraceCheckUtils]: 80: Hoare triple {41842#false} assume 4432 == #t~mem56;havoc #t~mem56; {41842#false} is VALID [2022-04-28 02:43:06,689 INFO L290 TraceCheckUtils]: 81: Hoare triple {41842#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {41842#false} is VALID [2022-04-28 02:43:06,689 INFO L290 TraceCheckUtils]: 82: Hoare triple {41842#false} assume 5 == ~blastFlag~0; {41842#false} is VALID [2022-04-28 02:43:06,689 INFO L290 TraceCheckUtils]: 83: Hoare triple {41842#false} assume !false; {41842#false} is VALID [2022-04-28 02:43:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:43:06,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:06,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515676469] [2022-04-28 02:43:06,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515676469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:06,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:06,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:06,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:06,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2071791886] [2022-04-28 02:43:06,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2071791886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:06,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:06,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928125218] [2022-04-28 02:43:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:06,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 84 [2022-04-28 02:43:06,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:06,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:06,759 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-28 02:43:06,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:43:06,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:06,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:43:06,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:43:06,760 INFO L87 Difference]: Start difference. First operand 602 states and 953 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:08,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:09,849 INFO L93 Difference]: Finished difference Result 1275 states and 2014 transitions. [2022-04-28 02:43:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:09,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 84 [2022-04-28 02:43:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2022-04-28 02:43:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2022-04-28 02:43:09,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 402 transitions. [2022-04-28 02:43:10,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:10,127 INFO L225 Difference]: With dead ends: 1275 [2022-04-28 02:43:10,127 INFO L226 Difference]: Without dead ends: 686 [2022-04-28 02:43:10,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:43:10,128 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 38 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:10,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 510 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 02:43:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-04-28 02:43:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 642. [2022-04-28 02:43:10,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:10,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 686 states. Second operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:10,172 INFO L74 IsIncluded]: Start isIncluded. First operand 686 states. Second operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:10,172 INFO L87 Difference]: Start difference. First operand 686 states. Second operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:10,193 INFO L93 Difference]: Finished difference Result 686 states and 1076 transitions. [2022-04-28 02:43:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1076 transitions. [2022-04-28 02:43:10,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:10,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:10,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 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 686 states. [2022-04-28 02:43:10,196 INFO L87 Difference]: Start difference. First operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 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 686 states. [2022-04-28 02:43:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:10,214 INFO L93 Difference]: Finished difference Result 686 states and 1076 transitions. [2022-04-28 02:43:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1076 transitions. [2022-04-28 02:43:10,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:10,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:10,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:10,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1021 transitions. [2022-04-28 02:43:10,241 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1021 transitions. Word has length 84 [2022-04-28 02:43:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:10,242 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 1021 transitions. [2022-04-28 02:43:10,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:10,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 642 states and 1021 transitions. [2022-04-28 02:43:11,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1021 edges. 1021 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1021 transitions. [2022-04-28 02:43:11,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 02:43:11,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:11,137 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:11,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 02:43:11,137 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1451323138, now seen corresponding path program 1 times [2022-04-28 02:43:11,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:11,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [364632497] [2022-04-28 02:43:11,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:43:11,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1451323138, now seen corresponding path program 2 times [2022-04-28 02:43:11,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:11,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051905697] [2022-04-28 02:43:11,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:11,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:11,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {47066#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {47059#true} is VALID [2022-04-28 02:43:11,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-28 02:43:11,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47059#true} {47059#true} #591#return; {47059#true} is VALID [2022-04-28 02:43:11,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {47059#true} call ULTIMATE.init(); {47066#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:11,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {47066#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {47059#true} is VALID [2022-04-28 02:43:11,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-28 02:43:11,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47059#true} {47059#true} #591#return; {47059#true} is VALID [2022-04-28 02:43:11,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {47059#true} call #t~ret159 := main(); {47059#true} is VALID [2022-04-28 02:43:11,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {47059#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {47059#true} is VALID [2022-04-28 02:43:11,275 INFO L272 TraceCheckUtils]: 6: Hoare triple {47059#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {47059#true} is VALID [2022-04-28 02:43:11,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {47059#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {47059#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {47059#true} is VALID [2022-04-28 02:43:11,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {47059#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {47059#true} is VALID [2022-04-28 02:43:11,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {47059#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47059#true} is VALID [2022-04-28 02:43:11,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {47059#true} assume !false; {47059#true} is VALID [2022-04-28 02:43:11,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {47059#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {47059#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {47059#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {47059#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {47059#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {47059#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {47059#true} assume 4368 == #t~mem48;havoc #t~mem48; {47059#true} is VALID [2022-04-28 02:43:11,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {47059#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {47059#true} is VALID [2022-04-28 02:43:11,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {47059#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47059#true} is VALID [2022-04-28 02:43:11,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {47059#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {47059#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {47059#true} is VALID [2022-04-28 02:43:11,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {47059#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {47059#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47059#true} is VALID [2022-04-28 02:43:11,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {47059#true} ~skip~0 := 0; {47059#true} is VALID [2022-04-28 02:43:11,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {47059#true} assume !false; {47059#true} is VALID [2022-04-28 02:43:11,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {47059#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {47059#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {47059#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {47059#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {47059#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {47059#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {47059#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {47059#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {47059#true} assume 4384 == #t~mem50;havoc #t~mem50; {47059#true} is VALID [2022-04-28 02:43:11,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {47059#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {47059#true} is VALID [2022-04-28 02:43:11,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {47059#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {47059#true} is VALID [2022-04-28 02:43:11,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {47059#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {47059#true} is VALID [2022-04-28 02:43:11,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {47059#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,283 INFO L290 TraceCheckUtils]: 51: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,285 INFO L290 TraceCheckUtils]: 56: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:11,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {47064#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47065#(= |ssl3_connect_#t~mem55| 4560)} is VALID [2022-04-28 02:43:11,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {47065#(= |ssl3_connect_#t~mem55| 4560)} assume 4417 == #t~mem55;havoc #t~mem55; {47060#false} is VALID [2022-04-28 02:43:11,286 INFO L290 TraceCheckUtils]: 59: Hoare triple {47060#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {47060#false} is VALID [2022-04-28 02:43:11,286 INFO L290 TraceCheckUtils]: 60: Hoare triple {47060#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {47060#false} is VALID [2022-04-28 02:43:11,286 INFO L290 TraceCheckUtils]: 61: Hoare triple {47060#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {47060#false} is VALID [2022-04-28 02:43:11,286 INFO L290 TraceCheckUtils]: 62: Hoare triple {47060#false} assume !(0 == ~tmp___6~0); {47060#false} is VALID [2022-04-28 02:43:11,287 INFO L290 TraceCheckUtils]: 63: Hoare triple {47060#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {47060#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47060#false} is VALID [2022-04-28 02:43:11,287 INFO L290 TraceCheckUtils]: 65: Hoare triple {47060#false} ~skip~0 := 0; {47060#false} is VALID [2022-04-28 02:43:11,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {47060#false} assume !false; {47060#false} is VALID [2022-04-28 02:43:11,287 INFO L290 TraceCheckUtils]: 67: Hoare triple {47060#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {47060#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,287 INFO L290 TraceCheckUtils]: 69: Hoare triple {47060#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,287 INFO L290 TraceCheckUtils]: 70: Hoare triple {47060#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,287 INFO L290 TraceCheckUtils]: 71: Hoare triple {47060#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,287 INFO L290 TraceCheckUtils]: 72: Hoare triple {47060#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,287 INFO L290 TraceCheckUtils]: 73: Hoare triple {47060#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,288 INFO L290 TraceCheckUtils]: 74: Hoare triple {47060#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,288 INFO L290 TraceCheckUtils]: 75: Hoare triple {47060#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,288 INFO L290 TraceCheckUtils]: 76: Hoare triple {47060#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,288 INFO L290 TraceCheckUtils]: 77: Hoare triple {47060#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,288 INFO L290 TraceCheckUtils]: 78: Hoare triple {47060#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,288 INFO L290 TraceCheckUtils]: 79: Hoare triple {47060#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,288 INFO L290 TraceCheckUtils]: 80: Hoare triple {47060#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47060#false} is VALID [2022-04-28 02:43:11,288 INFO L290 TraceCheckUtils]: 81: Hoare triple {47060#false} assume 4432 == #t~mem56;havoc #t~mem56; {47060#false} is VALID [2022-04-28 02:43:11,295 INFO L290 TraceCheckUtils]: 82: Hoare triple {47060#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {47060#false} is VALID [2022-04-28 02:43:11,295 INFO L290 TraceCheckUtils]: 83: Hoare triple {47060#false} assume 5 == ~blastFlag~0; {47060#false} is VALID [2022-04-28 02:43:11,295 INFO L290 TraceCheckUtils]: 84: Hoare triple {47060#false} assume !false; {47060#false} is VALID [2022-04-28 02:43:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 02:43:11,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:11,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051905697] [2022-04-28 02:43:11,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051905697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:11,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:11,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:11,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:11,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [364632497] [2022-04-28 02:43:11,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [364632497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:11,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:11,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:11,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497069233] [2022-04-28 02:43:11,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:11,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 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 85 [2022-04-28 02:43:11,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:11,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:11,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:11,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:43:11,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:11,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:43:11,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:43:11,361 INFO L87 Difference]: Start difference. First operand 642 states and 1021 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:13,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:14,703 INFO L93 Difference]: Finished difference Result 1391 states and 2192 transitions. [2022-04-28 02:43:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:14,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 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 85 [2022-04-28 02:43:14,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-28 02:43:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-28 02:43:14,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-28 02:43:15,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:15,030 INFO L225 Difference]: With dead ends: 1391 [2022-04-28 02:43:15,030 INFO L226 Difference]: Without dead ends: 762 [2022-04-28 02:43:15,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:43:15,032 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 83 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:15,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 556 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 520 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 02:43:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-04-28 02:43:15,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 644. [2022-04-28 02:43:15,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:15,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 762 states. Second operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:15,077 INFO L74 IsIncluded]: Start isIncluded. First operand 762 states. Second operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:15,078 INFO L87 Difference]: Start difference. First operand 762 states. Second operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:15,098 INFO L93 Difference]: Finished difference Result 762 states and 1186 transitions. [2022-04-28 02:43:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1186 transitions. [2022-04-28 02:43:15,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:15,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:15,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 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 762 states. [2022-04-28 02:43:15,100 INFO L87 Difference]: Start difference. First operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 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 762 states. [2022-04-28 02:43:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:15,126 INFO L93 Difference]: Finished difference Result 762 states and 1186 transitions. [2022-04-28 02:43:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1186 transitions. [2022-04-28 02:43:15,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:15,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:15,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:15,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1023 transitions. [2022-04-28 02:43:15,153 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1023 transitions. Word has length 85 [2022-04-28 02:43:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:15,153 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 1023 transitions. [2022-04-28 02:43:15,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:15,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 644 states and 1023 transitions. [2022-04-28 02:43:16,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1023 edges. 1023 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1023 transitions. [2022-04-28 02:43:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 02:43:16,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:16,164 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:16,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 02:43:16,164 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1229992776, now seen corresponding path program 1 times [2022-04-28 02:43:16,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:16,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552282041] [2022-04-28 02:43:16,169 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:43:16,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1229992776, now seen corresponding path program 2 times [2022-04-28 02:43:16,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:16,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197443670] [2022-04-28 02:43:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:16,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:16,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {52672#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {52665#true} is VALID [2022-04-28 02:43:16,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {52665#true} assume true; {52665#true} is VALID [2022-04-28 02:43:16,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52665#true} {52665#true} #591#return; {52665#true} is VALID [2022-04-28 02:43:16,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {52665#true} call ULTIMATE.init(); {52672#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:16,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {52672#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {52665#true} is VALID [2022-04-28 02:43:16,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {52665#true} assume true; {52665#true} is VALID [2022-04-28 02:43:16,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52665#true} {52665#true} #591#return; {52665#true} is VALID [2022-04-28 02:43:16,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {52665#true} call #t~ret159 := main(); {52665#true} is VALID [2022-04-28 02:43:16,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {52665#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {52665#true} is VALID [2022-04-28 02:43:16,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {52665#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {52665#true} is VALID [2022-04-28 02:43:16,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {52665#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {52665#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {52665#true} is VALID [2022-04-28 02:43:16,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {52665#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {52665#true} is VALID [2022-04-28 02:43:16,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {52665#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52665#true} is VALID [2022-04-28 02:43:16,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {52665#true} assume !false; {52665#true} is VALID [2022-04-28 02:43:16,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {52665#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {52665#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {52665#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {52665#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {52665#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {52665#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {52665#true} assume 4368 == #t~mem48;havoc #t~mem48; {52665#true} is VALID [2022-04-28 02:43:16,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {52665#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {52665#true} is VALID [2022-04-28 02:43:16,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {52665#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52665#true} is VALID [2022-04-28 02:43:16,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {52665#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {52665#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {52665#true} is VALID [2022-04-28 02:43:16,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {52665#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {52665#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {52665#true} is VALID [2022-04-28 02:43:16,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {52665#true} ~skip~0 := 0; {52665#true} is VALID [2022-04-28 02:43:16,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {52665#true} assume !false; {52665#true} is VALID [2022-04-28 02:43:16,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {52665#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {52665#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {52665#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {52665#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {52665#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {52665#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {52665#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {52665#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {52665#true} assume 4384 == #t~mem50;havoc #t~mem50; {52665#true} is VALID [2022-04-28 02:43:16,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {52665#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {52665#true} is VALID [2022-04-28 02:43:16,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {52665#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52665#true} is VALID [2022-04-28 02:43:16,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {52665#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {52665#true} is VALID [2022-04-28 02:43:16,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {52665#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:16,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:16,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:16,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:16,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:16,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:16,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {52670#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {52671#(= |ssl3_connect_#t~mem43| 4560)} is VALID [2022-04-28 02:43:16,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {52671#(= |ssl3_connect_#t~mem43| 4560)} assume 12292 == #t~mem43;havoc #t~mem43; {52666#false} is VALID [2022-04-28 02:43:16,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {52666#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {52666#false} is VALID [2022-04-28 02:43:16,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {52666#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {52666#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52666#false} is VALID [2022-04-28 02:43:16,322 INFO L290 TraceCheckUtils]: 50: Hoare triple {52666#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {52666#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {52666#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {52666#false} is VALID [2022-04-28 02:43:16,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {52666#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {52666#false} is VALID [2022-04-28 02:43:16,322 INFO L290 TraceCheckUtils]: 54: Hoare triple {52666#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {52666#false} is VALID [2022-04-28 02:43:16,322 INFO L290 TraceCheckUtils]: 55: Hoare triple {52666#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {52666#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,323 INFO L290 TraceCheckUtils]: 57: Hoare triple {52666#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {52666#false} is VALID [2022-04-28 02:43:16,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {52666#false} ~skip~0 := 0; {52666#false} is VALID [2022-04-28 02:43:16,323 INFO L290 TraceCheckUtils]: 59: Hoare triple {52666#false} assume !false; {52666#false} is VALID [2022-04-28 02:43:16,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {52666#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {52666#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {52666#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {52666#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {52666#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,323 INFO L290 TraceCheckUtils]: 65: Hoare triple {52666#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {52666#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,324 INFO L290 TraceCheckUtils]: 67: Hoare triple {52666#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,324 INFO L290 TraceCheckUtils]: 68: Hoare triple {52666#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,324 INFO L290 TraceCheckUtils]: 69: Hoare triple {52666#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,324 INFO L290 TraceCheckUtils]: 70: Hoare triple {52666#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,324 INFO L290 TraceCheckUtils]: 71: Hoare triple {52666#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,324 INFO L290 TraceCheckUtils]: 72: Hoare triple {52666#false} assume 4416 == #t~mem54;havoc #t~mem54; {52666#false} is VALID [2022-04-28 02:43:16,324 INFO L290 TraceCheckUtils]: 73: Hoare triple {52666#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {52666#false} is VALID [2022-04-28 02:43:16,324 INFO L290 TraceCheckUtils]: 74: Hoare triple {52666#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52666#false} is VALID [2022-04-28 02:43:16,324 INFO L290 TraceCheckUtils]: 75: Hoare triple {52666#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {52666#false} is VALID [2022-04-28 02:43:16,325 INFO L290 TraceCheckUtils]: 76: Hoare triple {52666#false} assume !(0 == ~tmp___6~0); {52666#false} is VALID [2022-04-28 02:43:16,325 INFO L290 TraceCheckUtils]: 77: Hoare triple {52666#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,325 INFO L290 TraceCheckUtils]: 78: Hoare triple {52666#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {52666#false} is VALID [2022-04-28 02:43:16,325 INFO L290 TraceCheckUtils]: 79: Hoare triple {52666#false} ~skip~0 := 0; {52666#false} is VALID [2022-04-28 02:43:16,325 INFO L290 TraceCheckUtils]: 80: Hoare triple {52666#false} assume !false; {52666#false} is VALID [2022-04-28 02:43:16,325 INFO L290 TraceCheckUtils]: 81: Hoare triple {52666#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,325 INFO L290 TraceCheckUtils]: 82: Hoare triple {52666#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,325 INFO L290 TraceCheckUtils]: 83: Hoare triple {52666#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,325 INFO L290 TraceCheckUtils]: 84: Hoare triple {52666#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,325 INFO L290 TraceCheckUtils]: 85: Hoare triple {52666#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,326 INFO L290 TraceCheckUtils]: 86: Hoare triple {52666#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,326 INFO L290 TraceCheckUtils]: 87: Hoare triple {52666#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,326 INFO L290 TraceCheckUtils]: 88: Hoare triple {52666#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,326 INFO L290 TraceCheckUtils]: 89: Hoare triple {52666#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,326 INFO L290 TraceCheckUtils]: 90: Hoare triple {52666#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,326 INFO L290 TraceCheckUtils]: 91: Hoare triple {52666#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,326 INFO L290 TraceCheckUtils]: 92: Hoare triple {52666#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,326 INFO L290 TraceCheckUtils]: 93: Hoare triple {52666#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,326 INFO L290 TraceCheckUtils]: 94: Hoare triple {52666#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52666#false} is VALID [2022-04-28 02:43:16,326 INFO L290 TraceCheckUtils]: 95: Hoare triple {52666#false} assume 4432 == #t~mem56;havoc #t~mem56; {52666#false} is VALID [2022-04-28 02:43:16,327 INFO L290 TraceCheckUtils]: 96: Hoare triple {52666#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {52666#false} is VALID [2022-04-28 02:43:16,327 INFO L290 TraceCheckUtils]: 97: Hoare triple {52666#false} assume 5 == ~blastFlag~0; {52666#false} is VALID [2022-04-28 02:43:16,327 INFO L290 TraceCheckUtils]: 98: Hoare triple {52666#false} assume !false; {52666#false} is VALID [2022-04-28 02:43:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 02:43:16,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:16,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197443670] [2022-04-28 02:43:16,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197443670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:16,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:16,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:16,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:16,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552282041] [2022-04-28 02:43:16,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552282041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:16,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:16,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:16,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138304096] [2022-04-28 02:43:16,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:16,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 99 [2022-04-28 02:43:16,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:16,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:16,396 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-28 02:43:16,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:43:16,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:16,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:43:16,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:43:16,397 INFO L87 Difference]: Start difference. First operand 644 states and 1023 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:18,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:19,720 INFO L93 Difference]: Finished difference Result 1391 states and 2190 transitions. [2022-04-28 02:43:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:19,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 99 [2022-04-28 02:43:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-28 02:43:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-28 02:43:19,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 459 transitions. [2022-04-28 02:43:20,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:20,063 INFO L225 Difference]: With dead ends: 1391 [2022-04-28 02:43:20,063 INFO L226 Difference]: Without dead ends: 760 [2022-04-28 02:43:20,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:43:20,064 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 94 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:20,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 554 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 515 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 02:43:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-04-28 02:43:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 644. [2022-04-28 02:43:20,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:20,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 760 states. Second operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:20,110 INFO L74 IsIncluded]: Start isIncluded. First operand 760 states. Second operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:20,111 INFO L87 Difference]: Start difference. First operand 760 states. Second operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:20,130 INFO L93 Difference]: Finished difference Result 760 states and 1182 transitions. [2022-04-28 02:43:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1182 transitions. [2022-04-28 02:43:20,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:20,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:20,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 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 760 states. [2022-04-28 02:43:20,133 INFO L87 Difference]: Start difference. First operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 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 760 states. [2022-04-28 02:43:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:20,158 INFO L93 Difference]: Finished difference Result 760 states and 1182 transitions. [2022-04-28 02:43:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1182 transitions. [2022-04-28 02:43:20,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:20,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:20,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:20,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1021 transitions. [2022-04-28 02:43:20,184 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1021 transitions. Word has length 99 [2022-04-28 02:43:20,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:20,184 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 1021 transitions. [2022-04-28 02:43:20,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:20,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 644 states and 1021 transitions. [2022-04-28 02:43:21,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1021 edges. 1021 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:21,188 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1021 transitions. [2022-04-28 02:43:21,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 02:43:21,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:21,189 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-04-28 02:43:21,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 02:43:21,190 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash 311489703, now seen corresponding path program 1 times [2022-04-28 02:43:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:21,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1737625919] [2022-04-28 02:43:23,635 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:43:23,635 INFO L85 PathProgramCache]: Analyzing trace with hash 311489703, now seen corresponding path program 2 times [2022-04-28 02:43:23,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:23,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583345123] [2022-04-28 02:43:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:23,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:23,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {58274#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {58267#true} is VALID [2022-04-28 02:43:23,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {58267#true} assume true; {58267#true} is VALID [2022-04-28 02:43:23,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58267#true} {58267#true} #591#return; {58267#true} is VALID [2022-04-28 02:43:23,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {58267#true} call ULTIMATE.init(); {58274#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:23,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {58274#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {58267#true} is VALID [2022-04-28 02:43:23,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {58267#true} assume true; {58267#true} is VALID [2022-04-28 02:43:23,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58267#true} {58267#true} #591#return; {58267#true} is VALID [2022-04-28 02:43:23,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {58267#true} call #t~ret159 := main(); {58267#true} is VALID [2022-04-28 02:43:23,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {58267#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {58267#true} is VALID [2022-04-28 02:43:23,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {58267#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {58267#true} is VALID [2022-04-28 02:43:23,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {58267#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {58267#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {58267#true} is VALID [2022-04-28 02:43:23,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {58267#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {58267#true} is VALID [2022-04-28 02:43:23,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {58267#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {58267#true} is VALID [2022-04-28 02:43:23,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {58267#true} assume !false; {58267#true} is VALID [2022-04-28 02:43:23,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {58267#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {58267#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {58267#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {58267#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {58267#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {58267#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {58267#true} assume 4368 == #t~mem48;havoc #t~mem48; {58267#true} is VALID [2022-04-28 02:43:23,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {58267#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {58267#true} is VALID [2022-04-28 02:43:23,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {58267#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {58267#true} is VALID [2022-04-28 02:43:23,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {58267#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {58267#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {58267#true} is VALID [2022-04-28 02:43:23,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {58267#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {58267#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {58267#true} is VALID [2022-04-28 02:43:23,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {58267#true} ~skip~0 := 0; {58267#true} is VALID [2022-04-28 02:43:23,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {58267#true} assume !false; {58267#true} is VALID [2022-04-28 02:43:23,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {58267#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {58267#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {58267#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {58267#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {58267#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {58267#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {58267#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {58267#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {58267#true} assume 4384 == #t~mem50;havoc #t~mem50; {58267#true} is VALID [2022-04-28 02:43:23,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {58267#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {58267#true} is VALID [2022-04-28 02:43:23,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {58267#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {58267#true} is VALID [2022-04-28 02:43:23,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {58267#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {58267#true} is VALID [2022-04-28 02:43:23,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {58267#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:23,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:23,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:23,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:23,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:23,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:23,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:23,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:23,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:23,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:23,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:23,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {58272#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {58273#(not (= |ssl3_connect_#t~mem48| 4368))} is VALID [2022-04-28 02:43:23,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {58273#(not (= |ssl3_connect_#t~mem48| 4368))} assume 4368 == #t~mem48;havoc #t~mem48; {58268#false} is VALID [2022-04-28 02:43:23,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {58268#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {58268#false} is VALID [2022-04-28 02:43:23,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {58268#false} assume !(0 == ~blastFlag~0); {58268#false} is VALID [2022-04-28 02:43:23,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {58268#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,779 INFO L290 TraceCheckUtils]: 55: Hoare triple {58268#false} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {58268#false} is VALID [2022-04-28 02:43:23,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {58268#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {58268#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {58268#false} is VALID [2022-04-28 02:43:23,779 INFO L290 TraceCheckUtils]: 58: Hoare triple {58268#false} ~skip~0 := 0; {58268#false} is VALID [2022-04-28 02:43:23,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {58268#false} assume !false; {58268#false} is VALID [2022-04-28 02:43:23,779 INFO L290 TraceCheckUtils]: 60: Hoare triple {58268#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {58268#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,779 INFO L290 TraceCheckUtils]: 62: Hoare triple {58268#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,780 INFO L290 TraceCheckUtils]: 63: Hoare triple {58268#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,780 INFO L290 TraceCheckUtils]: 64: Hoare triple {58268#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,780 INFO L290 TraceCheckUtils]: 65: Hoare triple {58268#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,780 INFO L290 TraceCheckUtils]: 66: Hoare triple {58268#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,780 INFO L290 TraceCheckUtils]: 67: Hoare triple {58268#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,780 INFO L290 TraceCheckUtils]: 68: Hoare triple {58268#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,780 INFO L290 TraceCheckUtils]: 69: Hoare triple {58268#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,780 INFO L290 TraceCheckUtils]: 70: Hoare triple {58268#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,780 INFO L290 TraceCheckUtils]: 71: Hoare triple {58268#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,780 INFO L290 TraceCheckUtils]: 72: Hoare triple {58268#false} assume 4416 == #t~mem54;havoc #t~mem54; {58268#false} is VALID [2022-04-28 02:43:23,781 INFO L290 TraceCheckUtils]: 73: Hoare triple {58268#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {58268#false} is VALID [2022-04-28 02:43:23,781 INFO L290 TraceCheckUtils]: 74: Hoare triple {58268#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {58268#false} is VALID [2022-04-28 02:43:23,781 INFO L290 TraceCheckUtils]: 75: Hoare triple {58268#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {58268#false} is VALID [2022-04-28 02:43:23,781 INFO L290 TraceCheckUtils]: 76: Hoare triple {58268#false} assume !(0 == ~tmp___6~0); {58268#false} is VALID [2022-04-28 02:43:23,781 INFO L290 TraceCheckUtils]: 77: Hoare triple {58268#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,781 INFO L290 TraceCheckUtils]: 78: Hoare triple {58268#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {58268#false} is VALID [2022-04-28 02:43:23,781 INFO L290 TraceCheckUtils]: 79: Hoare triple {58268#false} ~skip~0 := 0; {58268#false} is VALID [2022-04-28 02:43:23,781 INFO L290 TraceCheckUtils]: 80: Hoare triple {58268#false} assume !false; {58268#false} is VALID [2022-04-28 02:43:23,781 INFO L290 TraceCheckUtils]: 81: Hoare triple {58268#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,781 INFO L290 TraceCheckUtils]: 82: Hoare triple {58268#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,782 INFO L290 TraceCheckUtils]: 83: Hoare triple {58268#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,782 INFO L290 TraceCheckUtils]: 84: Hoare triple {58268#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,782 INFO L290 TraceCheckUtils]: 85: Hoare triple {58268#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,782 INFO L290 TraceCheckUtils]: 86: Hoare triple {58268#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,782 INFO L290 TraceCheckUtils]: 87: Hoare triple {58268#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,782 INFO L290 TraceCheckUtils]: 88: Hoare triple {58268#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,782 INFO L290 TraceCheckUtils]: 89: Hoare triple {58268#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,782 INFO L290 TraceCheckUtils]: 90: Hoare triple {58268#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,782 INFO L290 TraceCheckUtils]: 91: Hoare triple {58268#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,783 INFO L290 TraceCheckUtils]: 92: Hoare triple {58268#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,783 INFO L290 TraceCheckUtils]: 93: Hoare triple {58268#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,783 INFO L290 TraceCheckUtils]: 94: Hoare triple {58268#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {58268#false} is VALID [2022-04-28 02:43:23,783 INFO L290 TraceCheckUtils]: 95: Hoare triple {58268#false} assume 4432 == #t~mem56;havoc #t~mem56; {58268#false} is VALID [2022-04-28 02:43:23,783 INFO L290 TraceCheckUtils]: 96: Hoare triple {58268#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {58268#false} is VALID [2022-04-28 02:43:23,783 INFO L290 TraceCheckUtils]: 97: Hoare triple {58268#false} assume 5 == ~blastFlag~0; {58268#false} is VALID [2022-04-28 02:43:23,783 INFO L290 TraceCheckUtils]: 98: Hoare triple {58268#false} assume !false; {58268#false} is VALID [2022-04-28 02:43:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 02:43:23,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:23,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583345123] [2022-04-28 02:43:23,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583345123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:23,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:23,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:23,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:23,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1737625919] [2022-04-28 02:43:23,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1737625919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:23,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:23,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:23,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857854672] [2022-04-28 02:43:23,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:23,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 99 [2022-04-28 02:43:23,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:23,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:23,850 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-28 02:43:23,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:43:23,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:43:23,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:43:23,852 INFO L87 Difference]: Start difference. First operand 644 states and 1021 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:25,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:27,148 INFO L93 Difference]: Finished difference Result 1328 states and 2070 transitions. [2022-04-28 02:43:27,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:27,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 99 [2022-04-28 02:43:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 02:43:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 02:43:27,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-28 02:43:27,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:27,507 INFO L225 Difference]: With dead ends: 1328 [2022-04-28 02:43:27,507 INFO L226 Difference]: Without dead ends: 919 [2022-04-28 02:43:27,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:43:27,508 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 115 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:27,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 326 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 406 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 02:43:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-04-28 02:43:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 692. [2022-04-28 02:43:27,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:27,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 919 states. Second operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:27,570 INFO L74 IsIncluded]: Start isIncluded. First operand 919 states. Second operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:27,571 INFO L87 Difference]: Start difference. First operand 919 states. Second operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:27,607 INFO L93 Difference]: Finished difference Result 919 states and 1407 transitions. [2022-04-28 02:43:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1407 transitions. [2022-04-28 02:43:27,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:27,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:27,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 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 919 states. [2022-04-28 02:43:27,610 INFO L87 Difference]: Start difference. First operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 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 919 states. [2022-04-28 02:43:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:27,647 INFO L93 Difference]: Finished difference Result 919 states and 1407 transitions. [2022-04-28 02:43:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1407 transitions. [2022-04-28 02:43:27,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:27,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:27,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:27,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 687 states have (on average 1.579330422125182) internal successors, (1085), 687 states have internal predecessors, (1085), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1089 transitions. [2022-04-28 02:43:27,677 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1089 transitions. Word has length 99 [2022-04-28 02:43:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:27,677 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1089 transitions. [2022-04-28 02:43:27,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:27,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 692 states and 1089 transitions. [2022-04-28 02:43:28,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1089 edges. 1089 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1089 transitions. [2022-04-28 02:43:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 02:43:28,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:28,757 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:28,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 02:43:28,757 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2137730133, now seen corresponding path program 1 times [2022-04-28 02:43:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:28,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691623270] [2022-04-28 02:43:28,758 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:43:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2137730133, now seen corresponding path program 2 times [2022-04-28 02:43:28,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:28,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318807018] [2022-04-28 02:43:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:28,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {64164#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {64157#true} is VALID [2022-04-28 02:43:28,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {64157#true} assume true; {64157#true} is VALID [2022-04-28 02:43:28,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64157#true} {64157#true} #591#return; {64157#true} is VALID [2022-04-28 02:43:28,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {64157#true} call ULTIMATE.init(); {64164#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:28,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {64164#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {64157#true} is VALID [2022-04-28 02:43:28,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {64157#true} assume true; {64157#true} is VALID [2022-04-28 02:43:28,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64157#true} {64157#true} #591#return; {64157#true} is VALID [2022-04-28 02:43:28,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {64157#true} call #t~ret159 := main(); {64157#true} is VALID [2022-04-28 02:43:28,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {64157#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {64157#true} is VALID [2022-04-28 02:43:28,900 INFO L272 TraceCheckUtils]: 6: Hoare triple {64157#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {64157#true} is VALID [2022-04-28 02:43:28,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {64157#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {64157#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {64157#true} is VALID [2022-04-28 02:43:28,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {64157#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {64157#true} is VALID [2022-04-28 02:43:28,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {64157#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {64157#true} is VALID [2022-04-28 02:43:28,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {64157#true} assume !false; {64157#true} is VALID [2022-04-28 02:43:28,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {64157#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {64157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {64157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {64157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {64157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {64157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {64157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {64157#true} assume 4369 == #t~mem49;havoc #t~mem49; {64157#true} is VALID [2022-04-28 02:43:28,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {64157#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {64157#true} is VALID [2022-04-28 02:43:28,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {64157#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {64157#true} is VALID [2022-04-28 02:43:28,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {64157#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {64157#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {64157#true} is VALID [2022-04-28 02:43:28,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {64157#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {64157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {64157#true} is VALID [2022-04-28 02:43:28,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {64157#true} ~skip~0 := 0; {64157#true} is VALID [2022-04-28 02:43:28,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {64157#true} assume !false; {64157#true} is VALID [2022-04-28 02:43:28,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {64157#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {64157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {64157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {64157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {64157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {64157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {64157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {64157#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {64157#true} assume 4384 == #t~mem50;havoc #t~mem50; {64157#true} is VALID [2022-04-28 02:43:28,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {64157#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {64157#true} is VALID [2022-04-28 02:43:28,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {64157#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {64157#true} is VALID [2022-04-28 02:43:28,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {64157#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {64157#true} is VALID [2022-04-28 02:43:28,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {64157#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:28,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:28,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:28,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:28,906 INFO L290 TraceCheckUtils]: 44: Hoare triple {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:28,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:28,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:28,907 INFO L290 TraceCheckUtils]: 47: Hoare triple {64162#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {64163#(not (= |ssl3_connect_#t~mem44| 16384))} is VALID [2022-04-28 02:43:28,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {64163#(not (= |ssl3_connect_#t~mem44| 16384))} assume 16384 == #t~mem44;havoc #t~mem44; {64158#false} is VALID [2022-04-28 02:43:28,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {64158#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {64158#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {64158#false} is VALID [2022-04-28 02:43:28,908 INFO L290 TraceCheckUtils]: 51: Hoare triple {64158#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {64158#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {64158#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {64158#false} is VALID [2022-04-28 02:43:28,908 INFO L290 TraceCheckUtils]: 54: Hoare triple {64158#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {64158#false} is VALID [2022-04-28 02:43:28,908 INFO L290 TraceCheckUtils]: 55: Hoare triple {64158#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {64158#false} is VALID [2022-04-28 02:43:28,908 INFO L290 TraceCheckUtils]: 56: Hoare triple {64158#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {64158#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {64158#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {64158#false} is VALID [2022-04-28 02:43:28,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {64158#false} ~skip~0 := 0; {64158#false} is VALID [2022-04-28 02:43:28,909 INFO L290 TraceCheckUtils]: 60: Hoare triple {64158#false} assume !false; {64158#false} is VALID [2022-04-28 02:43:28,909 INFO L290 TraceCheckUtils]: 61: Hoare triple {64158#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,909 INFO L290 TraceCheckUtils]: 62: Hoare triple {64158#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,909 INFO L290 TraceCheckUtils]: 63: Hoare triple {64158#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,909 INFO L290 TraceCheckUtils]: 64: Hoare triple {64158#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {64158#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {64158#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,909 INFO L290 TraceCheckUtils]: 67: Hoare triple {64158#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {64158#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,909 INFO L290 TraceCheckUtils]: 69: Hoare triple {64158#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,910 INFO L290 TraceCheckUtils]: 70: Hoare triple {64158#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,910 INFO L290 TraceCheckUtils]: 71: Hoare triple {64158#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,910 INFO L290 TraceCheckUtils]: 72: Hoare triple {64158#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,910 INFO L290 TraceCheckUtils]: 73: Hoare triple {64158#false} assume 4416 == #t~mem54;havoc #t~mem54; {64158#false} is VALID [2022-04-28 02:43:28,910 INFO L290 TraceCheckUtils]: 74: Hoare triple {64158#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {64158#false} is VALID [2022-04-28 02:43:28,910 INFO L290 TraceCheckUtils]: 75: Hoare triple {64158#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {64158#false} is VALID [2022-04-28 02:43:28,910 INFO L290 TraceCheckUtils]: 76: Hoare triple {64158#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {64158#false} is VALID [2022-04-28 02:43:28,910 INFO L290 TraceCheckUtils]: 77: Hoare triple {64158#false} assume !(0 == ~tmp___6~0); {64158#false} is VALID [2022-04-28 02:43:28,910 INFO L290 TraceCheckUtils]: 78: Hoare triple {64158#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,910 INFO L290 TraceCheckUtils]: 79: Hoare triple {64158#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {64158#false} is VALID [2022-04-28 02:43:28,911 INFO L290 TraceCheckUtils]: 80: Hoare triple {64158#false} ~skip~0 := 0; {64158#false} is VALID [2022-04-28 02:43:28,911 INFO L290 TraceCheckUtils]: 81: Hoare triple {64158#false} assume !false; {64158#false} is VALID [2022-04-28 02:43:28,911 INFO L290 TraceCheckUtils]: 82: Hoare triple {64158#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,911 INFO L290 TraceCheckUtils]: 83: Hoare triple {64158#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,911 INFO L290 TraceCheckUtils]: 84: Hoare triple {64158#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,911 INFO L290 TraceCheckUtils]: 85: Hoare triple {64158#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,911 INFO L290 TraceCheckUtils]: 86: Hoare triple {64158#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,911 INFO L290 TraceCheckUtils]: 87: Hoare triple {64158#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,911 INFO L290 TraceCheckUtils]: 88: Hoare triple {64158#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,911 INFO L290 TraceCheckUtils]: 89: Hoare triple {64158#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,911 INFO L290 TraceCheckUtils]: 90: Hoare triple {64158#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,912 INFO L290 TraceCheckUtils]: 91: Hoare triple {64158#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,912 INFO L290 TraceCheckUtils]: 92: Hoare triple {64158#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,912 INFO L290 TraceCheckUtils]: 93: Hoare triple {64158#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,912 INFO L290 TraceCheckUtils]: 94: Hoare triple {64158#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,912 INFO L290 TraceCheckUtils]: 95: Hoare triple {64158#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64158#false} is VALID [2022-04-28 02:43:28,912 INFO L290 TraceCheckUtils]: 96: Hoare triple {64158#false} assume 4432 == #t~mem56;havoc #t~mem56; {64158#false} is VALID [2022-04-28 02:43:28,912 INFO L290 TraceCheckUtils]: 97: Hoare triple {64158#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {64158#false} is VALID [2022-04-28 02:43:28,912 INFO L290 TraceCheckUtils]: 98: Hoare triple {64158#false} assume 5 == ~blastFlag~0; {64158#false} is VALID [2022-04-28 02:43:28,912 INFO L290 TraceCheckUtils]: 99: Hoare triple {64158#false} assume !false; {64158#false} is VALID [2022-04-28 02:43:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 02:43:28,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:28,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318807018] [2022-04-28 02:43:28,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318807018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:28,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:28,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:28,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:28,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691623270] [2022-04-28 02:43:28,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691623270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:28,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:28,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:28,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256639280] [2022-04-28 02:43:28,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:28,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 100 [2022-04-28 02:43:28,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:28,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:28,975 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-28 02:43:28,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:43:28,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:28,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:43:28,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:43:28,976 INFO L87 Difference]: Start difference. First operand 692 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:31,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:32,054 INFO L93 Difference]: Finished difference Result 1565 states and 2425 transitions. [2022-04-28 02:43:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:32,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 100 [2022-04-28 02:43:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 02:43:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 02:43:32,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-28 02:43:32,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:32,419 INFO L225 Difference]: With dead ends: 1565 [2022-04-28 02:43:32,419 INFO L226 Difference]: Without dead ends: 886 [2022-04-28 02:43:32,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:43:32,420 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 119 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:32,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 298 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 02:43:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-04-28 02:43:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 692. [2022-04-28 02:43:32,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:32,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 886 states. Second operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:32,481 INFO L74 IsIncluded]: Start isIncluded. First operand 886 states. Second operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:32,482 INFO L87 Difference]: Start difference. First operand 886 states. Second operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:32,515 INFO L93 Difference]: Finished difference Result 886 states and 1337 transitions. [2022-04-28 02:43:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1337 transitions. [2022-04-28 02:43:32,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:32,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:32,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 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 886 states. [2022-04-28 02:43:32,518 INFO L87 Difference]: Start difference. First operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 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 886 states. [2022-04-28 02:43:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:32,552 INFO L93 Difference]: Finished difference Result 886 states and 1337 transitions. [2022-04-28 02:43:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1337 transitions. [2022-04-28 02:43:32,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:32,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:32,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:32,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1073 transitions. [2022-04-28 02:43:32,584 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1073 transitions. Word has length 100 [2022-04-28 02:43:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:32,584 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1073 transitions. [2022-04-28 02:43:32,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:32,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 692 states and 1073 transitions. [2022-04-28 02:43:33,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1073 edges. 1073 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1073 transitions. [2022-04-28 02:43:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 02:43:33,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:33,630 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:33,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 02:43:33,630 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:33,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:33,630 INFO L85 PathProgramCache]: Analyzing trace with hash 428311239, now seen corresponding path program 1 times [2022-04-28 02:43:33,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:33,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1205461213] [2022-04-28 02:43:33,631 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:43:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash 428311239, now seen corresponding path program 2 times [2022-04-28 02:43:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:33,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27410709] [2022-04-28 02:43:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:33,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:33,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {70462#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {70455#true} is VALID [2022-04-28 02:43:33,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {70455#true} assume true; {70455#true} is VALID [2022-04-28 02:43:33,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70455#true} {70455#true} #591#return; {70455#true} is VALID [2022-04-28 02:43:33,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {70455#true} call ULTIMATE.init(); {70462#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:33,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {70462#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {70455#true} is VALID [2022-04-28 02:43:33,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {70455#true} assume true; {70455#true} is VALID [2022-04-28 02:43:33,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70455#true} {70455#true} #591#return; {70455#true} is VALID [2022-04-28 02:43:33,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {70455#true} call #t~ret159 := main(); {70455#true} is VALID [2022-04-28 02:43:33,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {70455#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {70455#true} is VALID [2022-04-28 02:43:33,794 INFO L272 TraceCheckUtils]: 6: Hoare triple {70455#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {70455#true} is VALID [2022-04-28 02:43:33,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {70455#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {70455#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {70455#true} is VALID [2022-04-28 02:43:33,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {70455#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {70455#true} is VALID [2022-04-28 02:43:33,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {70455#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70455#true} is VALID [2022-04-28 02:43:33,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {70455#true} assume !false; {70455#true} is VALID [2022-04-28 02:43:33,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {70455#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {70455#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {70455#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {70455#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {70455#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {70455#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {70455#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {70455#true} assume 4369 == #t~mem49;havoc #t~mem49; {70455#true} is VALID [2022-04-28 02:43:33,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {70455#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {70455#true} is VALID [2022-04-28 02:43:33,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {70455#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70455#true} is VALID [2022-04-28 02:43:33,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {70455#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {70455#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {70455#true} is VALID [2022-04-28 02:43:33,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {70455#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {70455#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70455#true} is VALID [2022-04-28 02:43:33,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {70455#true} ~skip~0 := 0; {70455#true} is VALID [2022-04-28 02:43:33,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {70455#true} assume !false; {70455#true} is VALID [2022-04-28 02:43:33,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {70455#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {70455#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {70455#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {70455#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {70455#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {70455#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {70455#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {70455#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {70455#true} assume 4384 == #t~mem50;havoc #t~mem50; {70455#true} is VALID [2022-04-28 02:43:33,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {70455#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {70455#true} is VALID [2022-04-28 02:43:33,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {70455#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70455#true} is VALID [2022-04-28 02:43:33,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {70455#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {70455#true} is VALID [2022-04-28 02:43:33,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {70455#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:33,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:33,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:33,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:33,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:33,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:33,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {70460#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70461#(not (= 12292 |ssl3_connect_#t~mem43|))} is VALID [2022-04-28 02:43:33,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {70461#(not (= 12292 |ssl3_connect_#t~mem43|))} assume 12292 == #t~mem43;havoc #t~mem43; {70456#false} is VALID [2022-04-28 02:43:33,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {70456#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {70456#false} is VALID [2022-04-28 02:43:33,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {70456#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,802 INFO L290 TraceCheckUtils]: 50: Hoare triple {70456#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {70456#false} is VALID [2022-04-28 02:43:33,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {70456#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {70456#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {70456#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {70456#false} is VALID [2022-04-28 02:43:33,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {70456#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {70456#false} is VALID [2022-04-28 02:43:33,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {70456#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {70456#false} is VALID [2022-04-28 02:43:33,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {70456#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {70456#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {70456#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70456#false} is VALID [2022-04-28 02:43:33,803 INFO L290 TraceCheckUtils]: 59: Hoare triple {70456#false} ~skip~0 := 0; {70456#false} is VALID [2022-04-28 02:43:33,803 INFO L290 TraceCheckUtils]: 60: Hoare triple {70456#false} assume !false; {70456#false} is VALID [2022-04-28 02:43:33,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {70456#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {70456#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {70456#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,804 INFO L290 TraceCheckUtils]: 64: Hoare triple {70456#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {70456#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {70456#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,804 INFO L290 TraceCheckUtils]: 67: Hoare triple {70456#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,804 INFO L290 TraceCheckUtils]: 68: Hoare triple {70456#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,804 INFO L290 TraceCheckUtils]: 69: Hoare triple {70456#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,804 INFO L290 TraceCheckUtils]: 70: Hoare triple {70456#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,804 INFO L290 TraceCheckUtils]: 71: Hoare triple {70456#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,804 INFO L290 TraceCheckUtils]: 72: Hoare triple {70456#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,804 INFO L290 TraceCheckUtils]: 73: Hoare triple {70456#false} assume 4416 == #t~mem54;havoc #t~mem54; {70456#false} is VALID [2022-04-28 02:43:33,805 INFO L290 TraceCheckUtils]: 74: Hoare triple {70456#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {70456#false} is VALID [2022-04-28 02:43:33,805 INFO L290 TraceCheckUtils]: 75: Hoare triple {70456#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70456#false} is VALID [2022-04-28 02:43:33,805 INFO L290 TraceCheckUtils]: 76: Hoare triple {70456#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {70456#false} is VALID [2022-04-28 02:43:33,805 INFO L290 TraceCheckUtils]: 77: Hoare triple {70456#false} assume !(0 == ~tmp___6~0); {70456#false} is VALID [2022-04-28 02:43:33,805 INFO L290 TraceCheckUtils]: 78: Hoare triple {70456#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,805 INFO L290 TraceCheckUtils]: 79: Hoare triple {70456#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70456#false} is VALID [2022-04-28 02:43:33,805 INFO L290 TraceCheckUtils]: 80: Hoare triple {70456#false} ~skip~0 := 0; {70456#false} is VALID [2022-04-28 02:43:33,805 INFO L290 TraceCheckUtils]: 81: Hoare triple {70456#false} assume !false; {70456#false} is VALID [2022-04-28 02:43:33,805 INFO L290 TraceCheckUtils]: 82: Hoare triple {70456#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,805 INFO L290 TraceCheckUtils]: 83: Hoare triple {70456#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,806 INFO L290 TraceCheckUtils]: 84: Hoare triple {70456#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,806 INFO L290 TraceCheckUtils]: 85: Hoare triple {70456#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,806 INFO L290 TraceCheckUtils]: 86: Hoare triple {70456#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,806 INFO L290 TraceCheckUtils]: 87: Hoare triple {70456#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,806 INFO L290 TraceCheckUtils]: 88: Hoare triple {70456#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,806 INFO L290 TraceCheckUtils]: 89: Hoare triple {70456#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,806 INFO L290 TraceCheckUtils]: 90: Hoare triple {70456#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,806 INFO L290 TraceCheckUtils]: 91: Hoare triple {70456#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,806 INFO L290 TraceCheckUtils]: 92: Hoare triple {70456#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,806 INFO L290 TraceCheckUtils]: 93: Hoare triple {70456#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,807 INFO L290 TraceCheckUtils]: 94: Hoare triple {70456#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,807 INFO L290 TraceCheckUtils]: 95: Hoare triple {70456#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70456#false} is VALID [2022-04-28 02:43:33,807 INFO L290 TraceCheckUtils]: 96: Hoare triple {70456#false} assume 4432 == #t~mem56;havoc #t~mem56; {70456#false} is VALID [2022-04-28 02:43:33,807 INFO L290 TraceCheckUtils]: 97: Hoare triple {70456#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {70456#false} is VALID [2022-04-28 02:43:33,807 INFO L290 TraceCheckUtils]: 98: Hoare triple {70456#false} assume 5 == ~blastFlag~0; {70456#false} is VALID [2022-04-28 02:43:33,807 INFO L290 TraceCheckUtils]: 99: Hoare triple {70456#false} assume !false; {70456#false} is VALID [2022-04-28 02:43:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 02:43:33,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:33,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27410709] [2022-04-28 02:43:33,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27410709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:33,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:33,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:33,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:33,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1205461213] [2022-04-28 02:43:33,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1205461213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:33,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:33,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:33,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44692474] [2022-04-28 02:43:33,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:33,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 100 [2022-04-28 02:43:33,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:33,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:33,876 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-28 02:43:33,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:43:33,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:33,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:43:33,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:43:33,877 INFO L87 Difference]: Start difference. First operand 692 states and 1073 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:35,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:37,249 INFO L93 Difference]: Finished difference Result 1581 states and 2420 transitions. [2022-04-28 02:43:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 100 [2022-04-28 02:43:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 02:43:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 02:43:37,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-28 02:43:37,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:37,601 INFO L225 Difference]: With dead ends: 1581 [2022-04-28 02:43:37,601 INFO L226 Difference]: Without dead ends: 902 [2022-04-28 02:43:37,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:43:37,602 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 111 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:37,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 503 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 486 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 02:43:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2022-04-28 02:43:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 695. [2022-04-28 02:43:37,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:37,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 902 states. Second operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:37,666 INFO L74 IsIncluded]: Start isIncluded. First operand 902 states. Second operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:37,667 INFO L87 Difference]: Start difference. First operand 902 states. Second operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:37,691 INFO L93 Difference]: Finished difference Result 902 states and 1350 transitions. [2022-04-28 02:43:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1350 transitions. [2022-04-28 02:43:37,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:37,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:37,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 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 902 states. [2022-04-28 02:43:37,693 INFO L87 Difference]: Start difference. First operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 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 902 states. [2022-04-28 02:43:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:37,715 INFO L93 Difference]: Finished difference Result 902 states and 1350 transitions. [2022-04-28 02:43:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1350 transitions. [2022-04-28 02:43:37,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:37,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:37,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:37,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 states have internal predecessors, (1059), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1063 transitions. [2022-04-28 02:43:37,745 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1063 transitions. Word has length 100 [2022-04-28 02:43:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:37,745 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 1063 transitions. [2022-04-28 02:43:37,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-28 02:43:37,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 695 states and 1063 transitions. [2022-04-28 02:43:38,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1063 edges. 1063 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1063 transitions. [2022-04-28 02:43:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 02:43:38,789 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:38,789 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:38,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 02:43:38,789 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:38,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:38,789 INFO L85 PathProgramCache]: Analyzing trace with hash -852029360, now seen corresponding path program 1 times [2022-04-28 02:43:38,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:38,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [869470057] [2022-04-28 02:43:38,790 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:43:38,790 INFO L85 PathProgramCache]: Analyzing trace with hash -852029360, now seen corresponding path program 2 times [2022-04-28 02:43:38,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:38,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855543559] [2022-04-28 02:43:38,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:38,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:38,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {76830#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {76823#true} is VALID [2022-04-28 02:43:38,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {76823#true} assume true; {76823#true} is VALID [2022-04-28 02:43:38,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76823#true} {76823#true} #591#return; {76823#true} is VALID [2022-04-28 02:43:38,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {76823#true} call ULTIMATE.init(); {76830#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:38,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {76830#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {76823#true} is VALID [2022-04-28 02:43:38,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {76823#true} assume true; {76823#true} is VALID [2022-04-28 02:43:38,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76823#true} {76823#true} #591#return; {76823#true} is VALID [2022-04-28 02:43:38,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {76823#true} call #t~ret159 := main(); {76823#true} is VALID [2022-04-28 02:43:38,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {76823#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {76823#true} is VALID [2022-04-28 02:43:38,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {76823#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {76823#true} is VALID [2022-04-28 02:43:38,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {76823#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {76823#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {76823#true} is VALID [2022-04-28 02:43:38,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {76823#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {76823#true} is VALID [2022-04-28 02:43:38,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {76823#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {76823#true} is VALID [2022-04-28 02:43:38,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {76823#true} assume !false; {76823#true} is VALID [2022-04-28 02:43:38,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {76823#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {76823#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {76823#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {76823#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {76823#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {76823#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {76823#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {76823#true} assume 4369 == #t~mem49;havoc #t~mem49; {76823#true} is VALID [2022-04-28 02:43:38,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {76823#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {76823#true} is VALID [2022-04-28 02:43:38,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {76823#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {76823#true} is VALID [2022-04-28 02:43:38,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {76823#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {76823#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {76823#true} is VALID [2022-04-28 02:43:38,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {76823#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {76823#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {76823#true} is VALID [2022-04-28 02:43:38,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {76823#true} ~skip~0 := 0; {76823#true} is VALID [2022-04-28 02:43:38,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {76823#true} assume !false; {76823#true} is VALID [2022-04-28 02:43:38,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {76823#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {76823#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {76823#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {76823#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {76823#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {76823#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {76823#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {76823#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {76823#true} assume 4384 == #t~mem50;havoc #t~mem50; {76823#true} is VALID [2022-04-28 02:43:38,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {76823#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {76823#true} is VALID [2022-04-28 02:43:38,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {76823#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {76823#true} is VALID [2022-04-28 02:43:38,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {76823#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {76823#true} is VALID [2022-04-28 02:43:38,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {76823#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:38,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:38,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:38,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:38,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:38,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:38,937 INFO L290 TraceCheckUtils]: 46: Hoare triple {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:38,937 INFO L290 TraceCheckUtils]: 47: Hoare triple {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:38,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {76828#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {76829#(not (= |ssl3_connect_#t~mem45| 4096))} is VALID [2022-04-28 02:43:38,943 INFO L290 TraceCheckUtils]: 49: Hoare triple {76829#(not (= |ssl3_connect_#t~mem45| 4096))} assume 4096 == #t~mem45;havoc #t~mem45; {76824#false} is VALID [2022-04-28 02:43:38,943 INFO L290 TraceCheckUtils]: 50: Hoare triple {76824#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,943 INFO L290 TraceCheckUtils]: 51: Hoare triple {76824#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {76824#false} is VALID [2022-04-28 02:43:38,944 INFO L290 TraceCheckUtils]: 52: Hoare triple {76824#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,944 INFO L290 TraceCheckUtils]: 53: Hoare triple {76824#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,944 INFO L290 TraceCheckUtils]: 54: Hoare triple {76824#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {76824#false} is VALID [2022-04-28 02:43:38,944 INFO L290 TraceCheckUtils]: 55: Hoare triple {76824#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {76824#false} is VALID [2022-04-28 02:43:38,944 INFO L290 TraceCheckUtils]: 56: Hoare triple {76824#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {76824#false} is VALID [2022-04-28 02:43:38,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {76824#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {76824#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {76824#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {76824#false} is VALID [2022-04-28 02:43:38,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {76824#false} ~skip~0 := 0; {76824#false} is VALID [2022-04-28 02:43:38,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {76824#false} assume !false; {76824#false} is VALID [2022-04-28 02:43:38,945 INFO L290 TraceCheckUtils]: 62: Hoare triple {76824#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,945 INFO L290 TraceCheckUtils]: 63: Hoare triple {76824#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,945 INFO L290 TraceCheckUtils]: 64: Hoare triple {76824#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,945 INFO L290 TraceCheckUtils]: 65: Hoare triple {76824#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,945 INFO L290 TraceCheckUtils]: 66: Hoare triple {76824#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,945 INFO L290 TraceCheckUtils]: 67: Hoare triple {76824#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,945 INFO L290 TraceCheckUtils]: 68: Hoare triple {76824#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,945 INFO L290 TraceCheckUtils]: 69: Hoare triple {76824#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,945 INFO L290 TraceCheckUtils]: 70: Hoare triple {76824#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,945 INFO L290 TraceCheckUtils]: 71: Hoare triple {76824#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,946 INFO L290 TraceCheckUtils]: 72: Hoare triple {76824#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,946 INFO L290 TraceCheckUtils]: 73: Hoare triple {76824#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,946 INFO L290 TraceCheckUtils]: 74: Hoare triple {76824#false} assume 4416 == #t~mem54;havoc #t~mem54; {76824#false} is VALID [2022-04-28 02:43:38,946 INFO L290 TraceCheckUtils]: 75: Hoare triple {76824#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {76824#false} is VALID [2022-04-28 02:43:38,946 INFO L290 TraceCheckUtils]: 76: Hoare triple {76824#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {76824#false} is VALID [2022-04-28 02:43:38,946 INFO L290 TraceCheckUtils]: 77: Hoare triple {76824#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {76824#false} is VALID [2022-04-28 02:43:38,946 INFO L290 TraceCheckUtils]: 78: Hoare triple {76824#false} assume !(0 == ~tmp___6~0); {76824#false} is VALID [2022-04-28 02:43:38,946 INFO L290 TraceCheckUtils]: 79: Hoare triple {76824#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,946 INFO L290 TraceCheckUtils]: 80: Hoare triple {76824#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {76824#false} is VALID [2022-04-28 02:43:38,946 INFO L290 TraceCheckUtils]: 81: Hoare triple {76824#false} ~skip~0 := 0; {76824#false} is VALID [2022-04-28 02:43:38,947 INFO L290 TraceCheckUtils]: 82: Hoare triple {76824#false} assume !false; {76824#false} is VALID [2022-04-28 02:43:38,947 INFO L290 TraceCheckUtils]: 83: Hoare triple {76824#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,947 INFO L290 TraceCheckUtils]: 84: Hoare triple {76824#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,947 INFO L290 TraceCheckUtils]: 85: Hoare triple {76824#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,947 INFO L290 TraceCheckUtils]: 86: Hoare triple {76824#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,947 INFO L290 TraceCheckUtils]: 87: Hoare triple {76824#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,947 INFO L290 TraceCheckUtils]: 88: Hoare triple {76824#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,947 INFO L290 TraceCheckUtils]: 89: Hoare triple {76824#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,947 INFO L290 TraceCheckUtils]: 90: Hoare triple {76824#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,947 INFO L290 TraceCheckUtils]: 91: Hoare triple {76824#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,948 INFO L290 TraceCheckUtils]: 92: Hoare triple {76824#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,948 INFO L290 TraceCheckUtils]: 93: Hoare triple {76824#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,948 INFO L290 TraceCheckUtils]: 94: Hoare triple {76824#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,948 INFO L290 TraceCheckUtils]: 95: Hoare triple {76824#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,948 INFO L290 TraceCheckUtils]: 96: Hoare triple {76824#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76824#false} is VALID [2022-04-28 02:43:38,948 INFO L290 TraceCheckUtils]: 97: Hoare triple {76824#false} assume 4432 == #t~mem56;havoc #t~mem56; {76824#false} is VALID [2022-04-28 02:43:38,948 INFO L290 TraceCheckUtils]: 98: Hoare triple {76824#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {76824#false} is VALID [2022-04-28 02:43:38,948 INFO L290 TraceCheckUtils]: 99: Hoare triple {76824#false} assume 5 == ~blastFlag~0; {76824#false} is VALID [2022-04-28 02:43:38,948 INFO L290 TraceCheckUtils]: 100: Hoare triple {76824#false} assume !false; {76824#false} is VALID [2022-04-28 02:43:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 02:43:38,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:38,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855543559] [2022-04-28 02:43:38,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855543559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:38,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:38,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:38,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:38,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [869470057] [2022-04-28 02:43:38,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [869470057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:38,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:38,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695060760] [2022-04-28 02:43:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:38,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-28 02:43:38,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:38,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:39,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:39,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:43:39,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:39,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:43:39,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:43:39,008 INFO L87 Difference]: Start difference. First operand 695 states and 1063 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:41,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:42,176 INFO L93 Difference]: Finished difference Result 1566 states and 2367 transitions. [2022-04-28 02:43:42,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:42,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-28 02:43:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 02:43:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 02:43:42,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-28 02:43:42,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:42,542 INFO L225 Difference]: With dead ends: 1566 [2022-04-28 02:43:42,542 INFO L226 Difference]: Without dead ends: 887 [2022-04-28 02:43:42,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:43:42,543 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:42,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 320 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 02:43:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-04-28 02:43:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 695. [2022-04-28 02:43:42,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:42,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 887 states. Second operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:42,613 INFO L74 IsIncluded]: Start isIncluded. First operand 887 states. Second operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:42,614 INFO L87 Difference]: Start difference. First operand 887 states. Second operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:42,647 INFO L93 Difference]: Finished difference Result 887 states and 1309 transitions. [2022-04-28 02:43:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1309 transitions. [2022-04-28 02:43:42,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:42,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:42,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 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 887 states. [2022-04-28 02:43:42,650 INFO L87 Difference]: Start difference. First operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 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 887 states. [2022-04-28 02:43:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:42,683 INFO L93 Difference]: Finished difference Result 887 states and 1309 transitions. [2022-04-28 02:43:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1309 transitions. [2022-04-28 02:43:42,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:42,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:42,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:42,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1047 transitions. [2022-04-28 02:43:42,714 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1047 transitions. Word has length 101 [2022-04-28 02:43:42,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:42,715 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 1047 transitions. [2022-04-28 02:43:42,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:42,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 695 states and 1047 transitions. [2022-04-28 02:43:43,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1047 edges. 1047 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1047 transitions. [2022-04-28 02:43:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 02:43:43,773 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:43,773 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:43,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 02:43:43,773 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:43,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1276111053, now seen corresponding path program 1 times [2022-04-28 02:43:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:43,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1700907149] [2022-04-28 02:43:46,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:43:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1276111053, now seen corresponding path program 2 times [2022-04-28 02:43:46,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:46,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909841915] [2022-04-28 02:43:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:46,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:46,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:46,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {83138#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {83131#true} is VALID [2022-04-28 02:43:46,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {83131#true} assume true; {83131#true} is VALID [2022-04-28 02:43:46,238 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83131#true} {83131#true} #591#return; {83131#true} is VALID [2022-04-28 02:43:46,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {83131#true} call ULTIMATE.init(); {83138#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:46,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {83138#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {83131#true} is VALID [2022-04-28 02:43:46,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {83131#true} assume true; {83131#true} is VALID [2022-04-28 02:43:46,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83131#true} {83131#true} #591#return; {83131#true} is VALID [2022-04-28 02:43:46,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {83131#true} call #t~ret159 := main(); {83131#true} is VALID [2022-04-28 02:43:46,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {83131#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {83131#true} is VALID [2022-04-28 02:43:46,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {83131#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {83131#true} is VALID [2022-04-28 02:43:46,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {83131#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {83131#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {83131#true} is VALID [2022-04-28 02:43:46,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {83131#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {83131#true} is VALID [2022-04-28 02:43:46,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {83131#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {83131#true} is VALID [2022-04-28 02:43:46,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {83131#true} assume !false; {83131#true} is VALID [2022-04-28 02:43:46,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {83131#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {83131#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {83131#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {83131#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {83131#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {83131#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {83131#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {83131#true} assume 4369 == #t~mem49;havoc #t~mem49; {83131#true} is VALID [2022-04-28 02:43:46,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {83131#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {83131#true} is VALID [2022-04-28 02:43:46,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {83131#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {83131#true} is VALID [2022-04-28 02:43:46,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {83131#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {83131#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {83131#true} is VALID [2022-04-28 02:43:46,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {83131#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {83131#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {83131#true} is VALID [2022-04-28 02:43:46,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {83131#true} ~skip~0 := 0; {83131#true} is VALID [2022-04-28 02:43:46,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {83131#true} assume !false; {83131#true} is VALID [2022-04-28 02:43:46,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {83131#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {83131#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {83131#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {83131#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {83131#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {83131#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {83131#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {83131#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {83131#true} assume 4384 == #t~mem50;havoc #t~mem50; {83131#true} is VALID [2022-04-28 02:43:46,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {83131#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {83131#true} is VALID [2022-04-28 02:43:46,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {83131#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {83131#true} is VALID [2022-04-28 02:43:46,243 INFO L290 TraceCheckUtils]: 39: Hoare triple {83131#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {83131#true} is VALID [2022-04-28 02:43:46,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {83131#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:46,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {83136#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83137#(= |ssl3_connect_#t~mem49| 4560)} is VALID [2022-04-28 02:43:46,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {83137#(= |ssl3_connect_#t~mem49| 4560)} assume 4369 == #t~mem49;havoc #t~mem49; {83132#false} is VALID [2022-04-28 02:43:46,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {83132#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {83132#false} is VALID [2022-04-28 02:43:46,250 INFO L290 TraceCheckUtils]: 55: Hoare triple {83132#false} assume !(0 == ~blastFlag~0); {83132#false} is VALID [2022-04-28 02:43:46,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {83132#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,250 INFO L290 TraceCheckUtils]: 57: Hoare triple {83132#false} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {83132#false} is VALID [2022-04-28 02:43:46,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {83132#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,250 INFO L290 TraceCheckUtils]: 59: Hoare triple {83132#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {83132#false} is VALID [2022-04-28 02:43:46,250 INFO L290 TraceCheckUtils]: 60: Hoare triple {83132#false} ~skip~0 := 0; {83132#false} is VALID [2022-04-28 02:43:46,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {83132#false} assume !false; {83132#false} is VALID [2022-04-28 02:43:46,250 INFO L290 TraceCheckUtils]: 62: Hoare triple {83132#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {83132#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,251 INFO L290 TraceCheckUtils]: 64: Hoare triple {83132#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,251 INFO L290 TraceCheckUtils]: 65: Hoare triple {83132#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,251 INFO L290 TraceCheckUtils]: 66: Hoare triple {83132#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {83132#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,251 INFO L290 TraceCheckUtils]: 68: Hoare triple {83132#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {83132#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,251 INFO L290 TraceCheckUtils]: 70: Hoare triple {83132#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,251 INFO L290 TraceCheckUtils]: 71: Hoare triple {83132#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,251 INFO L290 TraceCheckUtils]: 72: Hoare triple {83132#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,251 INFO L290 TraceCheckUtils]: 73: Hoare triple {83132#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,252 INFO L290 TraceCheckUtils]: 74: Hoare triple {83132#false} assume 4416 == #t~mem54;havoc #t~mem54; {83132#false} is VALID [2022-04-28 02:43:46,252 INFO L290 TraceCheckUtils]: 75: Hoare triple {83132#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {83132#false} is VALID [2022-04-28 02:43:46,252 INFO L290 TraceCheckUtils]: 76: Hoare triple {83132#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {83132#false} is VALID [2022-04-28 02:43:46,252 INFO L290 TraceCheckUtils]: 77: Hoare triple {83132#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {83132#false} is VALID [2022-04-28 02:43:46,252 INFO L290 TraceCheckUtils]: 78: Hoare triple {83132#false} assume !(0 == ~tmp___6~0); {83132#false} is VALID [2022-04-28 02:43:46,252 INFO L290 TraceCheckUtils]: 79: Hoare triple {83132#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,252 INFO L290 TraceCheckUtils]: 80: Hoare triple {83132#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {83132#false} is VALID [2022-04-28 02:43:46,252 INFO L290 TraceCheckUtils]: 81: Hoare triple {83132#false} ~skip~0 := 0; {83132#false} is VALID [2022-04-28 02:43:46,253 INFO L290 TraceCheckUtils]: 82: Hoare triple {83132#false} assume !false; {83132#false} is VALID [2022-04-28 02:43:46,253 INFO L290 TraceCheckUtils]: 83: Hoare triple {83132#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,253 INFO L290 TraceCheckUtils]: 84: Hoare triple {83132#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,253 INFO L290 TraceCheckUtils]: 85: Hoare triple {83132#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,253 INFO L290 TraceCheckUtils]: 86: Hoare triple {83132#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,253 INFO L290 TraceCheckUtils]: 87: Hoare triple {83132#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,253 INFO L290 TraceCheckUtils]: 88: Hoare triple {83132#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,253 INFO L290 TraceCheckUtils]: 89: Hoare triple {83132#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,253 INFO L290 TraceCheckUtils]: 90: Hoare triple {83132#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,254 INFO L290 TraceCheckUtils]: 91: Hoare triple {83132#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,254 INFO L290 TraceCheckUtils]: 92: Hoare triple {83132#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,254 INFO L290 TraceCheckUtils]: 93: Hoare triple {83132#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,254 INFO L290 TraceCheckUtils]: 94: Hoare triple {83132#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,254 INFO L290 TraceCheckUtils]: 95: Hoare triple {83132#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,254 INFO L290 TraceCheckUtils]: 96: Hoare triple {83132#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {83132#false} is VALID [2022-04-28 02:43:46,254 INFO L290 TraceCheckUtils]: 97: Hoare triple {83132#false} assume 4432 == #t~mem56;havoc #t~mem56; {83132#false} is VALID [2022-04-28 02:43:46,254 INFO L290 TraceCheckUtils]: 98: Hoare triple {83132#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {83132#false} is VALID [2022-04-28 02:43:46,254 INFO L290 TraceCheckUtils]: 99: Hoare triple {83132#false} assume 5 == ~blastFlag~0; {83132#false} is VALID [2022-04-28 02:43:46,255 INFO L290 TraceCheckUtils]: 100: Hoare triple {83132#false} assume !false; {83132#false} is VALID [2022-04-28 02:43:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 02:43:46,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:46,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909841915] [2022-04-28 02:43:46,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909841915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:46,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:46,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:46,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1700907149] [2022-04-28 02:43:46,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1700907149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:46,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:46,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:46,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237878106] [2022-04-28 02:43:46,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:46,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-28 02:43:46,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:46,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:46,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:46,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:43:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:46,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:43:46,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:43:46,327 INFO L87 Difference]: Start difference. First operand 695 states and 1047 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:48,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:49,672 INFO L93 Difference]: Finished difference Result 1246 states and 1868 transitions. [2022-04-28 02:43:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:49,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-28 02:43:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 02:43:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 02:43:49,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-28 02:43:49,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:50,005 INFO L225 Difference]: With dead ends: 1246 [2022-04-28 02:43:50,005 INFO L226 Difference]: Without dead ends: 805 [2022-04-28 02:43:50,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:43:50,006 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 82 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:50,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 542 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 502 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 02:43:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-04-28 02:43:50,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 695. [2022-04-28 02:43:50,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:50,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 805 states. Second operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:50,075 INFO L74 IsIncluded]: Start isIncluded. First operand 805 states. Second operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:50,076 INFO L87 Difference]: Start difference. First operand 805 states. Second operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:50,109 INFO L93 Difference]: Finished difference Result 805 states and 1199 transitions. [2022-04-28 02:43:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1199 transitions. [2022-04-28 02:43:50,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:50,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:50,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 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 805 states. [2022-04-28 02:43:50,111 INFO L87 Difference]: Start difference. First operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 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 805 states. [2022-04-28 02:43:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:50,130 INFO L93 Difference]: Finished difference Result 805 states and 1199 transitions. [2022-04-28 02:43:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1199 transitions. [2022-04-28 02:43:50,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:50,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:50,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:50,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1045 transitions. [2022-04-28 02:43:50,149 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1045 transitions. Word has length 101 [2022-04-28 02:43:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:50,149 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 1045 transitions. [2022-04-28 02:43:50,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:50,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 695 states and 1045 transitions. [2022-04-28 02:43:51,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1045 edges. 1045 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1045 transitions. [2022-04-28 02:43:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 02:43:51,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:51,211 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:51,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 02:43:51,212 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:51,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash 725640173, now seen corresponding path program 1 times [2022-04-28 02:43:51,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:51,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1001144778] [2022-04-28 02:43:51,212 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:43:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash 725640173, now seen corresponding path program 2 times [2022-04-28 02:43:51,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:51,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934627073] [2022-04-28 02:43:51,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:51,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:51,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:51,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {88642#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {88635#true} is VALID [2022-04-28 02:43:51,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {88635#true} assume true; {88635#true} is VALID [2022-04-28 02:43:51,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88635#true} {88635#true} #591#return; {88635#true} is VALID [2022-04-28 02:43:51,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {88635#true} call ULTIMATE.init(); {88642#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:51,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {88642#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {88635#true} is VALID [2022-04-28 02:43:51,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {88635#true} assume true; {88635#true} is VALID [2022-04-28 02:43:51,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88635#true} {88635#true} #591#return; {88635#true} is VALID [2022-04-28 02:43:51,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {88635#true} call #t~ret159 := main(); {88635#true} is VALID [2022-04-28 02:43:51,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {88635#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {88635#true} is VALID [2022-04-28 02:43:51,358 INFO L272 TraceCheckUtils]: 6: Hoare triple {88635#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {88635#true} is VALID [2022-04-28 02:43:51,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {88635#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {88635#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {88635#true} is VALID [2022-04-28 02:43:51,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {88635#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {88635#true} is VALID [2022-04-28 02:43:51,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {88635#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {88635#true} is VALID [2022-04-28 02:43:51,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {88635#true} assume !false; {88635#true} is VALID [2022-04-28 02:43:51,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {88635#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {88635#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {88635#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {88635#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {88635#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {88635#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {88635#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {88635#true} assume 4369 == #t~mem49;havoc #t~mem49; {88635#true} is VALID [2022-04-28 02:43:51,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {88635#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {88635#true} is VALID [2022-04-28 02:43:51,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {88635#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {88635#true} is VALID [2022-04-28 02:43:51,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {88635#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {88635#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {88635#true} is VALID [2022-04-28 02:43:51,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {88635#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {88635#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {88635#true} is VALID [2022-04-28 02:43:51,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {88635#true} ~skip~0 := 0; {88635#true} is VALID [2022-04-28 02:43:51,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {88635#true} assume !false; {88635#true} is VALID [2022-04-28 02:43:51,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {88635#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {88635#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {88635#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {88635#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {88635#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {88635#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {88635#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {88635#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {88635#true} assume 4384 == #t~mem50;havoc #t~mem50; {88635#true} is VALID [2022-04-28 02:43:51,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {88635#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {88635#true} is VALID [2022-04-28 02:43:51,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {88635#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {88635#true} is VALID [2022-04-28 02:43:51,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {88635#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {88635#true} is VALID [2022-04-28 02:43:51,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {88635#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,364 INFO L290 TraceCheckUtils]: 45: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,365 INFO L290 TraceCheckUtils]: 46: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,365 INFO L290 TraceCheckUtils]: 47: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,366 INFO L290 TraceCheckUtils]: 50: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,367 INFO L290 TraceCheckUtils]: 52: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,370 INFO L290 TraceCheckUtils]: 59: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,371 INFO L290 TraceCheckUtils]: 61: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,371 INFO L290 TraceCheckUtils]: 62: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,372 INFO L290 TraceCheckUtils]: 63: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,373 INFO L290 TraceCheckUtils]: 65: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,373 INFO L290 TraceCheckUtils]: 66: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,373 INFO L290 TraceCheckUtils]: 67: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,374 INFO L290 TraceCheckUtils]: 68: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,374 INFO L290 TraceCheckUtils]: 69: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 02:43:51,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {88640#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {88641#(= |ssl3_connect_#t~mem68| 4560)} is VALID [2022-04-28 02:43:51,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {88641#(= |ssl3_connect_#t~mem68| 4560)} assume 4512 == #t~mem68;havoc #t~mem68; {88636#false} is VALID [2022-04-28 02:43:51,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {88636#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {88636#false} is VALID [2022-04-28 02:43:51,376 INFO L290 TraceCheckUtils]: 74: Hoare triple {88636#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 836 + #t~mem112.offset, 4);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 172 + #t~mem111.offset, 4);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 891 + #t~mem114.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,376 INFO L290 TraceCheckUtils]: 75: Hoare triple {88636#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 4294967296;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call write~int(0, #t~mem116.base, 168 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {88636#false} is VALID [2022-04-28 02:43:51,376 INFO L290 TraceCheckUtils]: 76: Hoare triple {88636#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {88636#false} is VALID [2022-04-28 02:43:51,377 INFO L290 TraceCheckUtils]: 77: Hoare triple {88636#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {88636#false} is VALID [2022-04-28 02:43:51,377 INFO L290 TraceCheckUtils]: 78: Hoare triple {88636#false} assume !(0 == ~tmp___8~0); {88636#false} is VALID [2022-04-28 02:43:51,377 INFO L290 TraceCheckUtils]: 79: Hoare triple {88636#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,377 INFO L290 TraceCheckUtils]: 80: Hoare triple {88636#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {88636#false} is VALID [2022-04-28 02:43:51,377 INFO L290 TraceCheckUtils]: 81: Hoare triple {88636#false} ~skip~0 := 0; {88636#false} is VALID [2022-04-28 02:43:51,377 INFO L290 TraceCheckUtils]: 82: Hoare triple {88636#false} assume !false; {88636#false} is VALID [2022-04-28 02:43:51,377 INFO L290 TraceCheckUtils]: 83: Hoare triple {88636#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,377 INFO L290 TraceCheckUtils]: 84: Hoare triple {88636#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,377 INFO L290 TraceCheckUtils]: 85: Hoare triple {88636#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,377 INFO L290 TraceCheckUtils]: 86: Hoare triple {88636#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,378 INFO L290 TraceCheckUtils]: 87: Hoare triple {88636#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,378 INFO L290 TraceCheckUtils]: 88: Hoare triple {88636#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,378 INFO L290 TraceCheckUtils]: 89: Hoare triple {88636#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,378 INFO L290 TraceCheckUtils]: 90: Hoare triple {88636#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,378 INFO L290 TraceCheckUtils]: 91: Hoare triple {88636#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,378 INFO L290 TraceCheckUtils]: 92: Hoare triple {88636#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,378 INFO L290 TraceCheckUtils]: 93: Hoare triple {88636#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,378 INFO L290 TraceCheckUtils]: 94: Hoare triple {88636#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,378 INFO L290 TraceCheckUtils]: 95: Hoare triple {88636#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,378 INFO L290 TraceCheckUtils]: 96: Hoare triple {88636#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88636#false} is VALID [2022-04-28 02:43:51,379 INFO L290 TraceCheckUtils]: 97: Hoare triple {88636#false} assume 4432 == #t~mem56;havoc #t~mem56; {88636#false} is VALID [2022-04-28 02:43:51,379 INFO L290 TraceCheckUtils]: 98: Hoare triple {88636#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {88636#false} is VALID [2022-04-28 02:43:51,379 INFO L290 TraceCheckUtils]: 99: Hoare triple {88636#false} assume 5 == ~blastFlag~0; {88636#false} is VALID [2022-04-28 02:43:51,379 INFO L290 TraceCheckUtils]: 100: Hoare triple {88636#false} assume !false; {88636#false} is VALID [2022-04-28 02:43:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 02:43:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:51,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934627073] [2022-04-28 02:43:51,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934627073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:51,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:51,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:51,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:51,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1001144778] [2022-04-28 02:43:51,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1001144778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:51,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:51,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270729385] [2022-04-28 02:43:51,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:51,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-28 02:43:51,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:51,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:51,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:51,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:43:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:51,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:43:51,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:43:51,466 INFO L87 Difference]: Start difference. First operand 695 states and 1045 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:53,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:54,765 INFO L93 Difference]: Finished difference Result 1484 states and 2223 transitions. [2022-04-28 02:43:54,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:54,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-28 02:43:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-28 02:43:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-28 02:43:54,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 450 transitions. [2022-04-28 02:43:55,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:55,091 INFO L225 Difference]: With dead ends: 1484 [2022-04-28 02:43:55,091 INFO L226 Difference]: Without dead ends: 805 [2022-04-28 02:43:55,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:43:55,092 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 62 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:55,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 540 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 501 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 02:43:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-04-28 02:43:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 721. [2022-04-28 02:43:55,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:55,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 805 states. Second operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:55,168 INFO L74 IsIncluded]: Start isIncluded. First operand 805 states. Second operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:55,169 INFO L87 Difference]: Start difference. First operand 805 states. Second operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:55,209 INFO L93 Difference]: Finished difference Result 805 states and 1197 transitions. [2022-04-28 02:43:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1197 transitions. [2022-04-28 02:43:55,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:55,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:55,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 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 805 states. [2022-04-28 02:43:55,212 INFO L87 Difference]: Start difference. First operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 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 805 states. [2022-04-28 02:43:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:55,241 INFO L93 Difference]: Finished difference Result 805 states and 1197 transitions. [2022-04-28 02:43:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1197 transitions. [2022-04-28 02:43:55,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:55,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:55,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:55,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1087 transitions. [2022-04-28 02:43:55,268 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1087 transitions. Word has length 101 [2022-04-28 02:43:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:55,268 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 1087 transitions. [2022-04-28 02:43:55,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:55,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 721 states and 1087 transitions. [2022-04-28 02:43:56,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1087 edges. 1087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1087 transitions. [2022-04-28 02:43:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 02:43:56,374 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:56,374 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:56,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 02:43:56,375 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1316661163, now seen corresponding path program 1 times [2022-04-28 02:43:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:56,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1814929255] [2022-04-28 02:43:56,375 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:43:56,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1316661163, now seen corresponding path program 2 times [2022-04-28 02:43:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:56,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982648192] [2022-04-28 02:43:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:56,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:56,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {94674#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {94667#true} is VALID [2022-04-28 02:43:56,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {94667#true} assume true; {94667#true} is VALID [2022-04-28 02:43:56,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94667#true} {94667#true} #591#return; {94667#true} is VALID [2022-04-28 02:43:56,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {94667#true} call ULTIMATE.init(); {94674#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:56,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {94674#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {94667#true} is VALID [2022-04-28 02:43:56,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {94667#true} assume true; {94667#true} is VALID [2022-04-28 02:43:56,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94667#true} {94667#true} #591#return; {94667#true} is VALID [2022-04-28 02:43:56,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {94667#true} call #t~ret159 := main(); {94667#true} is VALID [2022-04-28 02:43:56,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {94667#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {94667#true} is VALID [2022-04-28 02:43:56,518 INFO L272 TraceCheckUtils]: 6: Hoare triple {94667#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {94667#true} is VALID [2022-04-28 02:43:56,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {94667#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {94667#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {94667#true} is VALID [2022-04-28 02:43:56,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {94667#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {94667#true} is VALID [2022-04-28 02:43:56,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {94667#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {94667#true} is VALID [2022-04-28 02:43:56,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {94667#true} assume !false; {94667#true} is VALID [2022-04-28 02:43:56,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {94667#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {94667#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {94667#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {94667#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {94667#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {94667#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {94667#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {94667#true} assume 4369 == #t~mem49;havoc #t~mem49; {94667#true} is VALID [2022-04-28 02:43:56,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {94667#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {94667#true} is VALID [2022-04-28 02:43:56,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {94667#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {94667#true} is VALID [2022-04-28 02:43:56,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {94667#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {94667#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {94667#true} is VALID [2022-04-28 02:43:56,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {94667#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {94667#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {94667#true} is VALID [2022-04-28 02:43:56,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {94667#true} ~skip~0 := 0; {94667#true} is VALID [2022-04-28 02:43:56,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {94667#true} assume !false; {94667#true} is VALID [2022-04-28 02:43:56,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {94667#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {94667#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {94667#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {94667#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {94667#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {94667#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {94667#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {94667#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {94667#true} assume 4384 == #t~mem50;havoc #t~mem50; {94667#true} is VALID [2022-04-28 02:43:56,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {94667#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {94667#true} is VALID [2022-04-28 02:43:56,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {94667#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {94667#true} is VALID [2022-04-28 02:43:56,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {94667#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {94667#true} is VALID [2022-04-28 02:43:56,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {94667#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,527 INFO L290 TraceCheckUtils]: 50: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,527 INFO L290 TraceCheckUtils]: 51: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,529 INFO L290 TraceCheckUtils]: 54: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,529 INFO L290 TraceCheckUtils]: 55: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,529 INFO L290 TraceCheckUtils]: 56: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,530 INFO L290 TraceCheckUtils]: 57: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,530 INFO L290 TraceCheckUtils]: 58: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,530 INFO L290 TraceCheckUtils]: 59: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,531 INFO L290 TraceCheckUtils]: 60: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,531 INFO L290 TraceCheckUtils]: 61: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,532 INFO L290 TraceCheckUtils]: 62: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,532 INFO L290 TraceCheckUtils]: 63: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,532 INFO L290 TraceCheckUtils]: 64: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,533 INFO L290 TraceCheckUtils]: 65: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,534 INFO L290 TraceCheckUtils]: 67: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,535 INFO L290 TraceCheckUtils]: 70: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,535 INFO L290 TraceCheckUtils]: 71: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,536 INFO L290 TraceCheckUtils]: 72: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4512 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:43:56,536 INFO L290 TraceCheckUtils]: 73: Hoare triple {94672#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4513 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {94673#(not (= |ssl3_connect_#t~mem70| 4528))} is VALID [2022-04-28 02:43:56,536 INFO L290 TraceCheckUtils]: 74: Hoare triple {94673#(not (= |ssl3_connect_#t~mem70| 4528))} assume 4528 == #t~mem70;havoc #t~mem70; {94668#false} is VALID [2022-04-28 02:43:56,541 INFO L290 TraceCheckUtils]: 75: Hoare triple {94668#false} assume -2147483648 <= #t~nondet123 && #t~nondet123 <= 2147483647;~ret~0 := #t~nondet123;havoc #t~nondet123; {94668#false} is VALID [2022-04-28 02:43:56,542 INFO L290 TraceCheckUtils]: 76: Hoare triple {94668#false} assume !(~ret~0 <= 0);call write~int(4352, ~s.base, 52 + ~s.offset, 4);call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem125 := read~int(#t~mem124.base, #t~mem124.offset, 4);call write~int((if 0 == #t~mem125 then 0 else (if 1 == #t~mem125 then ~bitwiseAnd(#t~mem125, -5) else ~bitwiseAnd(#t~mem125, -5))), #t~mem124.base, #t~mem124.offset, 4);havoc #t~mem124.base, #t~mem124.offset;havoc #t~mem125;call #t~mem126 := read~int(~s.base, 92 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,542 INFO L290 TraceCheckUtils]: 77: Hoare triple {94668#false} assume !(0 != #t~mem126);havoc #t~mem126;call #t~mem133.base, #t~mem133.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(4560, #t~mem133.base, 844 + #t~mem133.offset, 4);havoc #t~mem133.base, #t~mem133.offset; {94668#false} is VALID [2022-04-28 02:43:56,542 INFO L290 TraceCheckUtils]: 78: Hoare triple {94668#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,542 INFO L290 TraceCheckUtils]: 79: Hoare triple {94668#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,542 INFO L290 TraceCheckUtils]: 80: Hoare triple {94668#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {94668#false} is VALID [2022-04-28 02:43:56,542 INFO L290 TraceCheckUtils]: 81: Hoare triple {94668#false} ~skip~0 := 0; {94668#false} is VALID [2022-04-28 02:43:56,542 INFO L290 TraceCheckUtils]: 82: Hoare triple {94668#false} assume !false; {94668#false} is VALID [2022-04-28 02:43:56,542 INFO L290 TraceCheckUtils]: 83: Hoare triple {94668#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,542 INFO L290 TraceCheckUtils]: 84: Hoare triple {94668#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,542 INFO L290 TraceCheckUtils]: 85: Hoare triple {94668#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,543 INFO L290 TraceCheckUtils]: 86: Hoare triple {94668#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,543 INFO L290 TraceCheckUtils]: 87: Hoare triple {94668#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,543 INFO L290 TraceCheckUtils]: 88: Hoare triple {94668#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,543 INFO L290 TraceCheckUtils]: 89: Hoare triple {94668#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,543 INFO L290 TraceCheckUtils]: 90: Hoare triple {94668#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,543 INFO L290 TraceCheckUtils]: 91: Hoare triple {94668#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,543 INFO L290 TraceCheckUtils]: 92: Hoare triple {94668#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,543 INFO L290 TraceCheckUtils]: 93: Hoare triple {94668#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,543 INFO L290 TraceCheckUtils]: 94: Hoare triple {94668#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,543 INFO L290 TraceCheckUtils]: 95: Hoare triple {94668#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,543 INFO L290 TraceCheckUtils]: 96: Hoare triple {94668#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {94668#false} is VALID [2022-04-28 02:43:56,544 INFO L290 TraceCheckUtils]: 97: Hoare triple {94668#false} assume 4432 == #t~mem56;havoc #t~mem56; {94668#false} is VALID [2022-04-28 02:43:56,544 INFO L290 TraceCheckUtils]: 98: Hoare triple {94668#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {94668#false} is VALID [2022-04-28 02:43:56,544 INFO L290 TraceCheckUtils]: 99: Hoare triple {94668#false} assume 5 == ~blastFlag~0; {94668#false} is VALID [2022-04-28 02:43:56,544 INFO L290 TraceCheckUtils]: 100: Hoare triple {94668#false} assume !false; {94668#false} is VALID [2022-04-28 02:43:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 02:43:56,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:56,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982648192] [2022-04-28 02:43:56,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982648192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:56,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:56,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:56,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:56,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1814929255] [2022-04-28 02:43:56,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1814929255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:56,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:56,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:43:56,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107977762] [2022-04-28 02:43:56,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:56,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-28 02:43:56,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:56,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:56,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:56,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:43:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:56,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:43:56,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:43:56,623 INFO L87 Difference]: Start difference. First operand 721 states and 1087 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:58,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:43:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:59,722 INFO L93 Difference]: Finished difference Result 1618 states and 2415 transitions. [2022-04-28 02:43:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:43:59,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-28 02:43:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 02:43:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 02:43:59,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-28 02:44:00,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:00,076 INFO L225 Difference]: With dead ends: 1618 [2022-04-28 02:44:00,076 INFO L226 Difference]: Without dead ends: 913 [2022-04-28 02:44:00,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:44:00,077 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 91 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:44:00,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 298 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 02:44:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2022-04-28 02:44:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 754. [2022-04-28 02:44:00,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:44:00,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 913 states. Second operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:00,159 INFO L74 IsIncluded]: Start isIncluded. First operand 913 states. Second operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:00,160 INFO L87 Difference]: Start difference. First operand 913 states. Second operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:00,194 INFO L93 Difference]: Finished difference Result 913 states and 1346 transitions. [2022-04-28 02:44:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1346 transitions. [2022-04-28 02:44:00,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:00,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:00,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 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 913 states. [2022-04-28 02:44:00,197 INFO L87 Difference]: Start difference. First operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 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 913 states. [2022-04-28 02:44:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:00,226 INFO L93 Difference]: Finished difference Result 913 states and 1346 transitions. [2022-04-28 02:44:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1346 transitions. [2022-04-28 02:44:00,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:00,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:00,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:44:00,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:44:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1150 transitions. [2022-04-28 02:44:00,252 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1150 transitions. Word has length 101 [2022-04-28 02:44:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:44:00,252 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 1150 transitions. [2022-04-28 02:44:00,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:00,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 754 states and 1150 transitions. [2022-04-28 02:44:01,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1150 edges. 1150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1150 transitions. [2022-04-28 02:44:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 02:44:01,479 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:44:01,479 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:44:01,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 02:44:01,479 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:44:01,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:44:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1057281585, now seen corresponding path program 1 times [2022-04-28 02:44:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:01,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266970131] [2022-04-28 02:44:03,878 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:44:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1057281585, now seen corresponding path program 2 times [2022-04-28 02:44:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:44:03,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690370078] [2022-04-28 02:44:03,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:44:03,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:44:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:04,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:44:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:04,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {101256#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {101249#true} is VALID [2022-04-28 02:44:04,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {101249#true} assume true; {101249#true} is VALID [2022-04-28 02:44:04,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101249#true} {101249#true} #591#return; {101249#true} is VALID [2022-04-28 02:44:04,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {101249#true} call ULTIMATE.init(); {101256#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:44:04,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {101256#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {101249#true} is VALID [2022-04-28 02:44:04,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {101249#true} assume true; {101249#true} is VALID [2022-04-28 02:44:04,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101249#true} {101249#true} #591#return; {101249#true} is VALID [2022-04-28 02:44:04,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {101249#true} call #t~ret159 := main(); {101249#true} is VALID [2022-04-28 02:44:04,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {101249#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {101249#true} is VALID [2022-04-28 02:44:04,029 INFO L272 TraceCheckUtils]: 6: Hoare triple {101249#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {101249#true} is VALID [2022-04-28 02:44:04,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {101249#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {101249#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {101249#true} is VALID [2022-04-28 02:44:04,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {101249#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {101249#true} is VALID [2022-04-28 02:44:04,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {101249#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {101249#true} is VALID [2022-04-28 02:44:04,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {101249#true} assume !false; {101249#true} is VALID [2022-04-28 02:44:04,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {101249#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {101249#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {101249#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {101249#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {101249#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {101249#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {101249#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {101249#true} assume 4369 == #t~mem49;havoc #t~mem49; {101249#true} is VALID [2022-04-28 02:44:04,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {101249#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {101249#true} is VALID [2022-04-28 02:44:04,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {101249#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {101249#true} is VALID [2022-04-28 02:44:04,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {101249#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {101249#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {101249#true} is VALID [2022-04-28 02:44:04,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {101249#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {101249#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {101249#true} is VALID [2022-04-28 02:44:04,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {101249#true} ~skip~0 := 0; {101249#true} is VALID [2022-04-28 02:44:04,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {101249#true} assume !false; {101249#true} is VALID [2022-04-28 02:44:04,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {101249#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {101249#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {101249#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {101249#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {101249#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {101249#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {101249#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {101249#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {101249#true} assume 4384 == #t~mem50;havoc #t~mem50; {101249#true} is VALID [2022-04-28 02:44:04,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {101249#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {101249#true} is VALID [2022-04-28 02:44:04,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {101249#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {101249#true} is VALID [2022-04-28 02:44:04,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {101249#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {101249#true} is VALID [2022-04-28 02:44:04,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {101249#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,034 INFO L290 TraceCheckUtils]: 42: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,034 INFO L290 TraceCheckUtils]: 43: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,036 INFO L290 TraceCheckUtils]: 48: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,037 INFO L290 TraceCheckUtils]: 51: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:04,037 INFO L290 TraceCheckUtils]: 52: Hoare triple {101254#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {101255#(not (= 4369 |ssl3_connect_#t~mem49|))} is VALID [2022-04-28 02:44:04,037 INFO L290 TraceCheckUtils]: 53: Hoare triple {101255#(not (= 4369 |ssl3_connect_#t~mem49|))} assume 4369 == #t~mem49;havoc #t~mem49; {101250#false} is VALID [2022-04-28 02:44:04,037 INFO L290 TraceCheckUtils]: 54: Hoare triple {101250#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {101250#false} is VALID [2022-04-28 02:44:04,038 INFO L290 TraceCheckUtils]: 55: Hoare triple {101250#false} assume !(0 == ~blastFlag~0); {101250#false} is VALID [2022-04-28 02:44:04,038 INFO L290 TraceCheckUtils]: 56: Hoare triple {101250#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,038 INFO L290 TraceCheckUtils]: 57: Hoare triple {101250#false} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {101250#false} is VALID [2022-04-28 02:44:04,038 INFO L290 TraceCheckUtils]: 58: Hoare triple {101250#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,038 INFO L290 TraceCheckUtils]: 59: Hoare triple {101250#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {101250#false} is VALID [2022-04-28 02:44:04,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {101250#false} ~skip~0 := 0; {101250#false} is VALID [2022-04-28 02:44:04,038 INFO L290 TraceCheckUtils]: 61: Hoare triple {101250#false} assume !false; {101250#false} is VALID [2022-04-28 02:44:04,038 INFO L290 TraceCheckUtils]: 62: Hoare triple {101250#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,038 INFO L290 TraceCheckUtils]: 63: Hoare triple {101250#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,038 INFO L290 TraceCheckUtils]: 64: Hoare triple {101250#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {101250#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {101250#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,039 INFO L290 TraceCheckUtils]: 67: Hoare triple {101250#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,039 INFO L290 TraceCheckUtils]: 68: Hoare triple {101250#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,039 INFO L290 TraceCheckUtils]: 69: Hoare triple {101250#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,039 INFO L290 TraceCheckUtils]: 70: Hoare triple {101250#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,039 INFO L290 TraceCheckUtils]: 71: Hoare triple {101250#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,039 INFO L290 TraceCheckUtils]: 72: Hoare triple {101250#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,039 INFO L290 TraceCheckUtils]: 73: Hoare triple {101250#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,040 INFO L290 TraceCheckUtils]: 74: Hoare triple {101250#false} assume 4416 == #t~mem54;havoc #t~mem54; {101250#false} is VALID [2022-04-28 02:44:04,040 INFO L290 TraceCheckUtils]: 75: Hoare triple {101250#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {101250#false} is VALID [2022-04-28 02:44:04,040 INFO L290 TraceCheckUtils]: 76: Hoare triple {101250#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {101250#false} is VALID [2022-04-28 02:44:04,040 INFO L290 TraceCheckUtils]: 77: Hoare triple {101250#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {101250#false} is VALID [2022-04-28 02:44:04,040 INFO L290 TraceCheckUtils]: 78: Hoare triple {101250#false} assume !(0 == ~tmp___6~0); {101250#false} is VALID [2022-04-28 02:44:04,040 INFO L290 TraceCheckUtils]: 79: Hoare triple {101250#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,040 INFO L290 TraceCheckUtils]: 80: Hoare triple {101250#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {101250#false} is VALID [2022-04-28 02:44:04,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {101250#false} ~skip~0 := 0; {101250#false} is VALID [2022-04-28 02:44:04,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {101250#false} assume !false; {101250#false} is VALID [2022-04-28 02:44:04,040 INFO L290 TraceCheckUtils]: 83: Hoare triple {101250#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,041 INFO L290 TraceCheckUtils]: 84: Hoare triple {101250#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {101250#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {101250#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,041 INFO L290 TraceCheckUtils]: 87: Hoare triple {101250#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,041 INFO L290 TraceCheckUtils]: 88: Hoare triple {101250#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,041 INFO L290 TraceCheckUtils]: 89: Hoare triple {101250#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {101250#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,041 INFO L290 TraceCheckUtils]: 91: Hoare triple {101250#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,041 INFO L290 TraceCheckUtils]: 92: Hoare triple {101250#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,041 INFO L290 TraceCheckUtils]: 93: Hoare triple {101250#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,041 INFO L290 TraceCheckUtils]: 94: Hoare triple {101250#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,042 INFO L290 TraceCheckUtils]: 95: Hoare triple {101250#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,042 INFO L290 TraceCheckUtils]: 96: Hoare triple {101250#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {101250#false} is VALID [2022-04-28 02:44:04,042 INFO L290 TraceCheckUtils]: 97: Hoare triple {101250#false} assume 4432 == #t~mem56;havoc #t~mem56; {101250#false} is VALID [2022-04-28 02:44:04,042 INFO L290 TraceCheckUtils]: 98: Hoare triple {101250#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {101250#false} is VALID [2022-04-28 02:44:04,042 INFO L290 TraceCheckUtils]: 99: Hoare triple {101250#false} assume 5 == ~blastFlag~0; {101250#false} is VALID [2022-04-28 02:44:04,042 INFO L290 TraceCheckUtils]: 100: Hoare triple {101250#false} assume !false; {101250#false} is VALID [2022-04-28 02:44:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 02:44:04,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:44:04,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690370078] [2022-04-28 02:44:04,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690370078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:04,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:04,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:44:04,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:44:04,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266970131] [2022-04-28 02:44:04,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266970131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:04,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:04,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:44:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114851207] [2022-04-28 02:44:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:44:04,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-28 02:44:04,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:44:04,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:04,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:04,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:44:04,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:04,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:44:04,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:44:04,115 INFO L87 Difference]: Start difference. First operand 754 states and 1150 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:06,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-28 02:44:07,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:07,220 INFO L93 Difference]: Finished difference Result 1447 states and 2183 transitions. [2022-04-28 02:44:07,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:44:07,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 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 101 [2022-04-28 02:44:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:44:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-28 02:44:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-28 02:44:07,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 470 transitions. [2022-04-28 02:44:07,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:07,585 INFO L225 Difference]: With dead ends: 1447 [2022-04-28 02:44:07,586 INFO L226 Difference]: Without dead ends: 971 [2022-04-28 02:44:07,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:44:07,587 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 108 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:44:07,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 330 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 402 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 02:44:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-28 02:44:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 757. [2022-04-28 02:44:07,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:44:07,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 971 states. Second operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:07,676 INFO L74 IsIncluded]: Start isIncluded. First operand 971 states. Second operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:07,677 INFO L87 Difference]: Start difference. First operand 971 states. Second operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:07,717 INFO L93 Difference]: Finished difference Result 971 states and 1443 transitions. [2022-04-28 02:44:07,717 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1443 transitions. [2022-04-28 02:44:07,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:07,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:07,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 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 971 states. [2022-04-28 02:44:07,720 INFO L87 Difference]: Start difference. First operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 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 971 states. [2022-04-28 02:44:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:07,760 INFO L93 Difference]: Finished difference Result 971 states and 1443 transitions. [2022-04-28 02:44:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1443 transitions. [2022-04-28 02:44:07,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:07,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:07,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:44:07,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:44:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1145 transitions. [2022-04-28 02:44:07,793 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1145 transitions. Word has length 101 [2022-04-28 02:44:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:44:07,793 INFO L495 AbstractCegarLoop]: Abstraction has 757 states and 1145 transitions. [2022-04-28 02:44:07,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:07,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 757 states and 1145 transitions. [2022-04-28 02:44:09,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1145 edges. 1145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1145 transitions. [2022-04-28 02:44:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 02:44:09,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:44:09,089 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:44:09,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 02:44:09,089 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:44:09,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:44:09,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1200804144, now seen corresponding path program 1 times [2022-04-28 02:44:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:09,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [737631079] [2022-04-28 02:44:14,327 WARN L232 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 198 DAG size of output: 190 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 02:44:23,613 WARN L232 SmtUtils]: Spent 7.97s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 02:44:31,994 WARN L232 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 02:44:33,534 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:44:33,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1200804144, now seen corresponding path program 2 times [2022-04-28 02:44:33,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:44:33,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135069314] [2022-04-28 02:44:33,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:44:33,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:44:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:44:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:33,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {107617#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {107611#true} is VALID [2022-04-28 02:44:33,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {107611#true} assume true; {107611#true} is VALID [2022-04-28 02:44:33,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107611#true} {107611#true} #591#return; {107611#true} is VALID [2022-04-28 02:44:33,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {107611#true} call ULTIMATE.init(); {107617#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:44:33,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {107617#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {107611#true} is VALID [2022-04-28 02:44:33,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {107611#true} assume true; {107611#true} is VALID [2022-04-28 02:44:33,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107611#true} {107611#true} #591#return; {107611#true} is VALID [2022-04-28 02:44:33,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {107611#true} call #t~ret159 := main(); {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {107611#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L272 TraceCheckUtils]: 6: Hoare triple {107611#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {107611#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {107611#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {107611#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {107611#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {107611#true} assume !false; {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {107611#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {107611#true} assume 12292 == #t~mem43;havoc #t~mem43; {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {107611#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {107611#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {107611#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {107611#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {107611#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {107611#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {107611#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {107611#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {107611#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {107611#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {107611#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {107611#true} ~skip~0 := 0; {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {107611#true} assume !false; {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {107611#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {107611#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {107611#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {107611#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {107611#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {107611#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {107611#true} assume 4368 == #t~mem48;havoc #t~mem48; {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {107611#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {107611#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {107611#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {107611#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {107611#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {107611#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {107611#true} ~skip~0 := 0; {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {107611#true} assume !false; {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {107611#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 43: Hoare triple {107611#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 44: Hoare triple {107611#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 45: Hoare triple {107611#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {107611#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,706 INFO L290 TraceCheckUtils]: 47: Hoare triple {107611#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {107611#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {107611#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {107611#true} is VALID [2022-04-28 02:44:33,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {107611#true} assume 4384 == #t~mem50;havoc #t~mem50; {107611#true} is VALID [2022-04-28 02:44:33,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {107611#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {107611#true} is VALID [2022-04-28 02:44:33,706 INFO L290 TraceCheckUtils]: 52: Hoare triple {107611#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,706 INFO L290 TraceCheckUtils]: 53: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,707 INFO L290 TraceCheckUtils]: 54: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,707 INFO L290 TraceCheckUtils]: 55: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,707 INFO L290 TraceCheckUtils]: 56: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,708 INFO L290 TraceCheckUtils]: 58: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,708 INFO L290 TraceCheckUtils]: 59: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,709 INFO L290 TraceCheckUtils]: 60: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,709 INFO L290 TraceCheckUtils]: 61: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,710 INFO L290 TraceCheckUtils]: 64: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume 20480 == #t~mem46;havoc #t~mem46; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,710 INFO L290 TraceCheckUtils]: 65: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,711 INFO L290 TraceCheckUtils]: 66: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,711 INFO L290 TraceCheckUtils]: 67: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,711 INFO L290 TraceCheckUtils]: 68: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,711 INFO L290 TraceCheckUtils]: 69: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,712 INFO L290 TraceCheckUtils]: 70: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,712 INFO L290 TraceCheckUtils]: 71: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,712 INFO L290 TraceCheckUtils]: 72: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,713 INFO L290 TraceCheckUtils]: 73: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,713 INFO L290 TraceCheckUtils]: 74: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,713 INFO L290 TraceCheckUtils]: 75: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,714 INFO L290 TraceCheckUtils]: 76: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,714 INFO L290 TraceCheckUtils]: 77: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,714 INFO L290 TraceCheckUtils]: 78: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,715 INFO L290 TraceCheckUtils]: 79: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,715 INFO L290 TraceCheckUtils]: 80: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,715 INFO L290 TraceCheckUtils]: 81: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,715 INFO L290 TraceCheckUtils]: 82: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,716 INFO L290 TraceCheckUtils]: 83: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,717 INFO L290 TraceCheckUtils]: 86: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,717 INFO L290 TraceCheckUtils]: 87: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,717 INFO L290 TraceCheckUtils]: 88: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,718 INFO L290 TraceCheckUtils]: 89: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem54;havoc #t~mem54; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,718 INFO L290 TraceCheckUtils]: 90: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {107616#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:33,718 INFO L290 TraceCheckUtils]: 91: Hoare triple {107616#(= 2 ssl3_connect_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {107612#false} is VALID [2022-04-28 02:44:33,718 INFO L290 TraceCheckUtils]: 92: Hoare triple {107612#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {107612#false} is VALID [2022-04-28 02:44:33,718 INFO L290 TraceCheckUtils]: 93: Hoare triple {107612#false} assume !(0 == ~tmp___6~0); {107612#false} is VALID [2022-04-28 02:44:33,719 INFO L290 TraceCheckUtils]: 94: Hoare triple {107612#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,719 INFO L290 TraceCheckUtils]: 95: Hoare triple {107612#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {107612#false} is VALID [2022-04-28 02:44:33,719 INFO L290 TraceCheckUtils]: 96: Hoare triple {107612#false} ~skip~0 := 0; {107612#false} is VALID [2022-04-28 02:44:33,719 INFO L290 TraceCheckUtils]: 97: Hoare triple {107612#false} assume !false; {107612#false} is VALID [2022-04-28 02:44:33,719 INFO L290 TraceCheckUtils]: 98: Hoare triple {107612#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,719 INFO L290 TraceCheckUtils]: 99: Hoare triple {107612#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,719 INFO L290 TraceCheckUtils]: 100: Hoare triple {107612#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,719 INFO L290 TraceCheckUtils]: 101: Hoare triple {107612#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,719 INFO L290 TraceCheckUtils]: 102: Hoare triple {107612#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,720 INFO L290 TraceCheckUtils]: 103: Hoare triple {107612#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,720 INFO L290 TraceCheckUtils]: 104: Hoare triple {107612#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,720 INFO L290 TraceCheckUtils]: 105: Hoare triple {107612#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,720 INFO L290 TraceCheckUtils]: 106: Hoare triple {107612#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,720 INFO L290 TraceCheckUtils]: 107: Hoare triple {107612#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,720 INFO L290 TraceCheckUtils]: 108: Hoare triple {107612#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,720 INFO L290 TraceCheckUtils]: 109: Hoare triple {107612#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,720 INFO L290 TraceCheckUtils]: 110: Hoare triple {107612#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,720 INFO L290 TraceCheckUtils]: 111: Hoare triple {107612#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {107612#false} is VALID [2022-04-28 02:44:33,720 INFO L290 TraceCheckUtils]: 112: Hoare triple {107612#false} assume 4432 == #t~mem56;havoc #t~mem56; {107612#false} is VALID [2022-04-28 02:44:33,721 INFO L290 TraceCheckUtils]: 113: Hoare triple {107612#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {107612#false} is VALID [2022-04-28 02:44:33,721 INFO L290 TraceCheckUtils]: 114: Hoare triple {107612#false} assume 5 == ~blastFlag~0; {107612#false} is VALID [2022-04-28 02:44:33,721 INFO L290 TraceCheckUtils]: 115: Hoare triple {107612#false} assume !false; {107612#false} is VALID [2022-04-28 02:44:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 02:44:33,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:44:33,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135069314] [2022-04-28 02:44:33,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135069314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:33,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:33,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:44:33,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:44:33,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [737631079] [2022-04-28 02:44:33,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [737631079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:33,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:33,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:44:33,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258969234] [2022-04-28 02:44:33,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:44:33,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 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 116 [2022-04-28 02:44:33,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:44:33,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:33,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:33,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:44:33,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:33,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:44:33,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:44:33,801 INFO L87 Difference]: Start difference. First operand 757 states and 1145 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:35,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:44:36,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:36,954 INFO L93 Difference]: Finished difference Result 1499 states and 2277 transitions. [2022-04-28 02:44:36,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:44:36,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 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 116 [2022-04-28 02:44:36,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:44:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-28 02:44:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-28 02:44:36,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-28 02:44:37,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:37,330 INFO L225 Difference]: With dead ends: 1499 [2022-04-28 02:44:37,330 INFO L226 Difference]: Without dead ends: 1023 [2022-04-28 02:44:37,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:44:37,331 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 121 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:44:37,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 02:44:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-04-28 02:44:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2022-04-28 02:44:37,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:44:37,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1023 states. Second operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:37,437 INFO L74 IsIncluded]: Start isIncluded. First operand 1023 states. Second operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:37,438 INFO L87 Difference]: Start difference. First operand 1023 states. Second operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:37,478 INFO L93 Difference]: Finished difference Result 1023 states and 1547 transitions. [2022-04-28 02:44:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1547 transitions. [2022-04-28 02:44:37,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:37,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:37,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 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 1023 states. [2022-04-28 02:44:37,481 INFO L87 Difference]: Start difference. First operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 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 1023 states. [2022-04-28 02:44:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:37,517 INFO L93 Difference]: Finished difference Result 1023 states and 1547 transitions. [2022-04-28 02:44:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1547 transitions. [2022-04-28 02:44:37,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:37,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:37,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:44:37,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:44:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1547 transitions. [2022-04-28 02:44:37,557 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1547 transitions. Word has length 116 [2022-04-28 02:44:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:44:37,558 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1547 transitions. [2022-04-28 02:44:37,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:37,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1023 states and 1547 transitions. [2022-04-28 02:44:39,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1547 edges. 1547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1547 transitions. [2022-04-28 02:44:39,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 02:44:39,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:44:39,159 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:44:39,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 02:44:39,159 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:44:39,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:44:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 1 times [2022-04-28 02:44:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:39,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005645916] [2022-04-28 02:44:39,160 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:44:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 2 times [2022-04-28 02:44:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:44:39,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532495120] [2022-04-28 02:44:39,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:44:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:44:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:44:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:39,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {114716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {114710#true} is VALID [2022-04-28 02:44:39,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {114710#true} assume true; {114710#true} is VALID [2022-04-28 02:44:39,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114710#true} {114710#true} #591#return; {114710#true} is VALID [2022-04-28 02:44:39,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {114710#true} call ULTIMATE.init(); {114716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:44:39,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {114716#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {114710#true} is VALID [2022-04-28 02:44:39,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {114710#true} assume true; {114710#true} is VALID [2022-04-28 02:44:39,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114710#true} {114710#true} #591#return; {114710#true} is VALID [2022-04-28 02:44:39,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {114710#true} call #t~ret159 := main(); {114710#true} is VALID [2022-04-28 02:44:39,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {114710#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {114710#true} is VALID [2022-04-28 02:44:39,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {114710#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {114710#true} is VALID [2022-04-28 02:44:39,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {114710#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {114710#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {114710#true} is VALID [2022-04-28 02:44:39,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {114710#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {114710#true} is VALID [2022-04-28 02:44:39,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {114710#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {114710#true} is VALID [2022-04-28 02:44:39,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {114710#true} assume !false; {114710#true} is VALID [2022-04-28 02:44:39,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {114710#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {114710#true} assume 12292 == #t~mem43;havoc #t~mem43; {114710#true} is VALID [2022-04-28 02:44:39,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {114710#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {114710#true} is VALID [2022-04-28 02:44:39,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {114710#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {114710#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {114710#true} is VALID [2022-04-28 02:44:39,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {114710#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {114710#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {114710#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {114710#true} is VALID [2022-04-28 02:44:39,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {114710#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {114710#true} is VALID [2022-04-28 02:44:39,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {114710#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {114710#true} is VALID [2022-04-28 02:44:39,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {114710#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {114710#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {114710#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {114710#true} is VALID [2022-04-28 02:44:39,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {114710#true} ~skip~0 := 0; {114710#true} is VALID [2022-04-28 02:44:39,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {114710#true} assume !false; {114710#true} is VALID [2022-04-28 02:44:39,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {114710#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {114710#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {114710#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {114710#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {114710#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {114710#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {114710#true} assume 4368 == #t~mem48;havoc #t~mem48; {114710#true} is VALID [2022-04-28 02:44:39,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {114710#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {114710#true} is VALID [2022-04-28 02:44:39,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {114710#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {114710#true} is VALID [2022-04-28 02:44:39,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {114710#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {114710#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {114710#true} is VALID [2022-04-28 02:44:39,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {114710#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {114710#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {114710#true} is VALID [2022-04-28 02:44:39,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {114710#true} ~skip~0 := 0; {114710#true} is VALID [2022-04-28 02:44:39,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {114710#true} assume !false; {114710#true} is VALID [2022-04-28 02:44:39,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {114710#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {114710#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {114710#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {114710#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,321 INFO L290 TraceCheckUtils]: 46: Hoare triple {114710#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {114710#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {114710#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,321 INFO L290 TraceCheckUtils]: 49: Hoare triple {114710#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,321 INFO L290 TraceCheckUtils]: 50: Hoare triple {114710#true} assume 4384 == #t~mem50;havoc #t~mem50; {114710#true} is VALID [2022-04-28 02:44:39,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {114710#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {114710#true} is VALID [2022-04-28 02:44:39,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {114710#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {114710#true} is VALID [2022-04-28 02:44:39,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {114710#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,322 INFO L290 TraceCheckUtils]: 54: Hoare triple {114710#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,322 INFO L290 TraceCheckUtils]: 55: Hoare triple {114710#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {114710#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {114710#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {114710#true} is VALID [2022-04-28 02:44:39,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {114710#true} ~skip~0 := 0; {114710#true} is VALID [2022-04-28 02:44:39,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {114710#true} assume !false; {114710#true} is VALID [2022-04-28 02:44:39,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {114710#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {114710#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {114710#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {114710#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {114710#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,323 INFO L290 TraceCheckUtils]: 65: Hoare triple {114710#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {114710#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {114710#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {114710#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {114710#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,323 INFO L290 TraceCheckUtils]: 70: Hoare triple {114710#true} assume 4400 == #t~mem52;havoc #t~mem52; {114710#true} is VALID [2022-04-28 02:44:39,323 INFO L290 TraceCheckUtils]: 71: Hoare triple {114710#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,323 INFO L290 TraceCheckUtils]: 72: Hoare triple {114710#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {114710#true} is VALID [2022-04-28 02:44:39,324 INFO L290 TraceCheckUtils]: 73: Hoare triple {114710#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {114710#true} is VALID [2022-04-28 02:44:39,324 INFO L290 TraceCheckUtils]: 74: Hoare triple {114710#true} assume !(~ret~0 <= 0); {114710#true} is VALID [2022-04-28 02:44:39,324 INFO L290 TraceCheckUtils]: 75: Hoare triple {114710#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,324 INFO L290 TraceCheckUtils]: 76: Hoare triple {114710#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,324 INFO L290 TraceCheckUtils]: 77: Hoare triple {114710#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {114710#true} is VALID [2022-04-28 02:44:39,324 INFO L290 TraceCheckUtils]: 78: Hoare triple {114710#true} ~skip~0 := 0; {114710#true} is VALID [2022-04-28 02:44:39,324 INFO L290 TraceCheckUtils]: 79: Hoare triple {114710#true} assume !false; {114710#true} is VALID [2022-04-28 02:44:39,324 INFO L290 TraceCheckUtils]: 80: Hoare triple {114710#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {114710#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,325 INFO L290 TraceCheckUtils]: 82: Hoare triple {114710#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,325 INFO L290 TraceCheckUtils]: 83: Hoare triple {114710#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,325 INFO L290 TraceCheckUtils]: 84: Hoare triple {114710#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,325 INFO L290 TraceCheckUtils]: 85: Hoare triple {114710#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,325 INFO L290 TraceCheckUtils]: 86: Hoare triple {114710#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,325 INFO L290 TraceCheckUtils]: 87: Hoare triple {114710#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,325 INFO L290 TraceCheckUtils]: 88: Hoare triple {114710#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,325 INFO L290 TraceCheckUtils]: 89: Hoare triple {114710#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,325 INFO L290 TraceCheckUtils]: 90: Hoare triple {114710#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,325 INFO L290 TraceCheckUtils]: 91: Hoare triple {114710#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {114710#true} is VALID [2022-04-28 02:44:39,326 INFO L290 TraceCheckUtils]: 92: Hoare triple {114710#true} assume 4416 == #t~mem54;havoc #t~mem54; {114710#true} is VALID [2022-04-28 02:44:39,326 INFO L290 TraceCheckUtils]: 93: Hoare triple {114710#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {114710#true} is VALID [2022-04-28 02:44:39,326 INFO L290 TraceCheckUtils]: 94: Hoare triple {114710#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,326 INFO L290 TraceCheckUtils]: 95: Hoare triple {114715#(= 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);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,327 INFO L290 TraceCheckUtils]: 96: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,327 INFO L290 TraceCheckUtils]: 97: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,327 INFO L290 TraceCheckUtils]: 98: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,328 INFO L290 TraceCheckUtils]: 99: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,328 INFO L290 TraceCheckUtils]: 100: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !false; {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,328 INFO L290 TraceCheckUtils]: 101: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,329 INFO L290 TraceCheckUtils]: 102: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,329 INFO L290 TraceCheckUtils]: 103: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,329 INFO L290 TraceCheckUtils]: 104: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,330 INFO L290 TraceCheckUtils]: 105: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,330 INFO L290 TraceCheckUtils]: 106: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,330 INFO L290 TraceCheckUtils]: 107: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,331 INFO L290 TraceCheckUtils]: 108: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,331 INFO L290 TraceCheckUtils]: 109: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,331 INFO L290 TraceCheckUtils]: 110: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,332 INFO L290 TraceCheckUtils]: 111: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,332 INFO L290 TraceCheckUtils]: 112: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,332 INFO L290 TraceCheckUtils]: 113: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,333 INFO L290 TraceCheckUtils]: 114: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,333 INFO L290 TraceCheckUtils]: 115: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem56;havoc #t~mem56; {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,333 INFO L290 TraceCheckUtils]: 116: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {114715#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 02:44:39,334 INFO L290 TraceCheckUtils]: 117: Hoare triple {114715#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {114711#false} is VALID [2022-04-28 02:44:39,334 INFO L290 TraceCheckUtils]: 118: Hoare triple {114711#false} assume !false; {114711#false} is VALID [2022-04-28 02:44:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-28 02:44:39,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:44:39,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532495120] [2022-04-28 02:44:39,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532495120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:39,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:39,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:44:39,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:44:39,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1005645916] [2022-04-28 02:44:39,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1005645916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:39,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:39,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:44:39,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934907204] [2022-04-28 02:44:39,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:44:39,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 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 119 [2022-04-28 02:44:39,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:44:39,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:39,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:39,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:44:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:39,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:44:39,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:44:39,411 INFO L87 Difference]: Start difference. First operand 1023 states and 1547 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:41,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:44:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:42,545 INFO L93 Difference]: Finished difference Result 2031 states and 3079 transitions. [2022-04-28 02:44:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:44:42,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 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 119 [2022-04-28 02:44:42,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:44:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-28 02:44:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-28 02:44:42,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-28 02:44:42,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:42,933 INFO L225 Difference]: With dead ends: 2031 [2022-04-28 02:44:42,933 INFO L226 Difference]: Without dead ends: 1289 [2022-04-28 02:44:42,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:44:42,934 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:44:42,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 02:44:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-04-28 02:44:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1287. [2022-04-28 02:44:43,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:44:43,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1289 states. Second operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:43,032 INFO L74 IsIncluded]: Start isIncluded. First operand 1289 states. Second operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:43,033 INFO L87 Difference]: Start difference. First operand 1289 states. Second operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:43,079 INFO L93 Difference]: Finished difference Result 1289 states and 1947 transitions. [2022-04-28 02:44:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1947 transitions. [2022-04-28 02:44:43,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:43,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:43,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 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 1289 states. [2022-04-28 02:44:43,083 INFO L87 Difference]: Start difference. First operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 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 1289 states. [2022-04-28 02:44:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:43,134 INFO L93 Difference]: Finished difference Result 1289 states and 1947 transitions. [2022-04-28 02:44:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1947 transitions. [2022-04-28 02:44:43,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:43,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:43,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:44:43,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:44:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1946 transitions. [2022-04-28 02:44:43,203 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1946 transitions. Word has length 119 [2022-04-28 02:44:43,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:44:43,203 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1946 transitions. [2022-04-28 02:44:43,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:43,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1287 states and 1946 transitions. [2022-04-28 02:44:45,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1946 edges. 1946 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1946 transitions. [2022-04-28 02:44:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 02:44:45,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:44:45,164 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:44:45,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 02:44:45,164 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:44:45,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:44:45,164 INFO L85 PathProgramCache]: Analyzing trace with hash -676421700, now seen corresponding path program 1 times [2022-04-28 02:44:45,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:45,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1579341589] [2022-04-28 02:44:45,165 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:44:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash -676421700, now seen corresponding path program 2 times [2022-04-28 02:44:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:44:45,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662258805] [2022-04-28 02:44:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:44:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:44:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:45,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:44:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:45,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {123939#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {123933#true} is VALID [2022-04-28 02:44:45,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {123933#true} assume true; {123933#true} is VALID [2022-04-28 02:44:45,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123933#true} {123933#true} #591#return; {123933#true} is VALID [2022-04-28 02:44:45,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {123933#true} call ULTIMATE.init(); {123939#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:44:45,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {123939#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {123933#true} is VALID [2022-04-28 02:44:45,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {123933#true} assume true; {123933#true} is VALID [2022-04-28 02:44:45,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123933#true} {123933#true} #591#return; {123933#true} is VALID [2022-04-28 02:44:45,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {123933#true} call #t~ret159 := main(); {123933#true} is VALID [2022-04-28 02:44:45,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {123933#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {123933#true} is VALID [2022-04-28 02:44:45,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {123933#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {123933#true} is VALID [2022-04-28 02:44:45,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {123933#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {123933#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {123933#true} is VALID [2022-04-28 02:44:45,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {123933#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {123933#true} is VALID [2022-04-28 02:44:45,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {123933#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {123933#true} is VALID [2022-04-28 02:44:45,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {123933#true} assume !false; {123933#true} is VALID [2022-04-28 02:44:45,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {123933#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {123933#true} assume 12292 == #t~mem43;havoc #t~mem43; {123933#true} is VALID [2022-04-28 02:44:45,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {123933#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {123933#true} is VALID [2022-04-28 02:44:45,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {123933#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {123933#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {123933#true} is VALID [2022-04-28 02:44:45,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {123933#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {123933#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {123933#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {123933#true} is VALID [2022-04-28 02:44:45,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {123933#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {123933#true} is VALID [2022-04-28 02:44:45,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {123933#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {123933#true} is VALID [2022-04-28 02:44:45,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {123933#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {123933#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {123933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123933#true} is VALID [2022-04-28 02:44:45,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {123933#true} ~skip~0 := 0; {123933#true} is VALID [2022-04-28 02:44:45,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {123933#true} assume !false; {123933#true} is VALID [2022-04-28 02:44:45,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {123933#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {123933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {123933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {123933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {123933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {123933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {123933#true} assume 4368 == #t~mem48;havoc #t~mem48; {123933#true} is VALID [2022-04-28 02:44:45,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {123933#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {123933#true} is VALID [2022-04-28 02:44:45,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {123933#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {123933#true} is VALID [2022-04-28 02:44:45,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {123933#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {123933#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {123933#true} is VALID [2022-04-28 02:44:45,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {123933#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {123933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123933#true} is VALID [2022-04-28 02:44:45,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {123933#true} ~skip~0 := 0; {123933#true} is VALID [2022-04-28 02:44:45,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {123933#true} assume !false; {123933#true} is VALID [2022-04-28 02:44:45,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {123933#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {123933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {123933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {123933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {123933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {123933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {123933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {123933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,325 INFO L290 TraceCheckUtils]: 50: Hoare triple {123933#true} assume 4384 == #t~mem50;havoc #t~mem50; {123933#true} is VALID [2022-04-28 02:44:45,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {123933#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {123933#true} is VALID [2022-04-28 02:44:45,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {123933#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {123933#true} is VALID [2022-04-28 02:44:45,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {123933#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {123933#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,326 INFO L290 TraceCheckUtils]: 55: Hoare triple {123933#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {123933#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {123933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123933#true} is VALID [2022-04-28 02:44:45,326 INFO L290 TraceCheckUtils]: 58: Hoare triple {123933#true} ~skip~0 := 0; {123933#true} is VALID [2022-04-28 02:44:45,326 INFO L290 TraceCheckUtils]: 59: Hoare triple {123933#true} assume !false; {123933#true} is VALID [2022-04-28 02:44:45,326 INFO L290 TraceCheckUtils]: 60: Hoare triple {123933#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {123933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,326 INFO L290 TraceCheckUtils]: 62: Hoare triple {123933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,326 INFO L290 TraceCheckUtils]: 63: Hoare triple {123933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,327 INFO L290 TraceCheckUtils]: 64: Hoare triple {123933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,327 INFO L290 TraceCheckUtils]: 65: Hoare triple {123933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,327 INFO L290 TraceCheckUtils]: 66: Hoare triple {123933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,327 INFO L290 TraceCheckUtils]: 67: Hoare triple {123933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,327 INFO L290 TraceCheckUtils]: 68: Hoare triple {123933#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,327 INFO L290 TraceCheckUtils]: 69: Hoare triple {123933#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,327 INFO L290 TraceCheckUtils]: 70: Hoare triple {123933#true} assume 4400 == #t~mem52;havoc #t~mem52; {123933#true} is VALID [2022-04-28 02:44:45,327 INFO L290 TraceCheckUtils]: 71: Hoare triple {123933#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {123933#true} is VALID [2022-04-28 02:44:45,327 INFO L290 TraceCheckUtils]: 72: Hoare triple {123933#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {123933#true} is VALID [2022-04-28 02:44:45,328 INFO L290 TraceCheckUtils]: 73: Hoare triple {123933#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,328 INFO L290 TraceCheckUtils]: 74: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,328 INFO L290 TraceCheckUtils]: 75: Hoare triple {123938#(= 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); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,329 INFO L290 TraceCheckUtils]: 76: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,329 INFO L290 TraceCheckUtils]: 77: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,329 INFO L290 TraceCheckUtils]: 78: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,330 INFO L290 TraceCheckUtils]: 79: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,330 INFO L290 TraceCheckUtils]: 80: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,330 INFO L290 TraceCheckUtils]: 81: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,331 INFO L290 TraceCheckUtils]: 82: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,331 INFO L290 TraceCheckUtils]: 83: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,331 INFO L290 TraceCheckUtils]: 84: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,332 INFO L290 TraceCheckUtils]: 85: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,332 INFO L290 TraceCheckUtils]: 86: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,332 INFO L290 TraceCheckUtils]: 87: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,332 INFO L290 TraceCheckUtils]: 88: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,333 INFO L290 TraceCheckUtils]: 89: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,333 INFO L290 TraceCheckUtils]: 90: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,334 INFO L290 TraceCheckUtils]: 91: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,334 INFO L290 TraceCheckUtils]: 92: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem54;havoc #t~mem54; {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,334 INFO L290 TraceCheckUtils]: 93: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {123938#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 02:44:45,335 INFO L290 TraceCheckUtils]: 94: Hoare triple {123938#(= 3 ssl3_connect_~blastFlag~0)} assume !(3 == ~blastFlag~0); {123934#false} is VALID [2022-04-28 02:44:45,335 INFO L290 TraceCheckUtils]: 95: Hoare triple {123934#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {123934#false} is VALID [2022-04-28 02:44:45,335 INFO L290 TraceCheckUtils]: 96: Hoare triple {123934#false} assume !(0 == ~tmp___6~0); {123934#false} is VALID [2022-04-28 02:44:45,335 INFO L290 TraceCheckUtils]: 97: Hoare triple {123934#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,335 INFO L290 TraceCheckUtils]: 98: Hoare triple {123934#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123934#false} is VALID [2022-04-28 02:44:45,335 INFO L290 TraceCheckUtils]: 99: Hoare triple {123934#false} ~skip~0 := 0; {123934#false} is VALID [2022-04-28 02:44:45,335 INFO L290 TraceCheckUtils]: 100: Hoare triple {123934#false} assume !false; {123934#false} is VALID [2022-04-28 02:44:45,335 INFO L290 TraceCheckUtils]: 101: Hoare triple {123934#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,335 INFO L290 TraceCheckUtils]: 102: Hoare triple {123934#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,336 INFO L290 TraceCheckUtils]: 103: Hoare triple {123934#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,336 INFO L290 TraceCheckUtils]: 104: Hoare triple {123934#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,336 INFO L290 TraceCheckUtils]: 105: Hoare triple {123934#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,336 INFO L290 TraceCheckUtils]: 106: Hoare triple {123934#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,336 INFO L290 TraceCheckUtils]: 107: Hoare triple {123934#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,336 INFO L290 TraceCheckUtils]: 108: Hoare triple {123934#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,336 INFO L290 TraceCheckUtils]: 109: Hoare triple {123934#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,336 INFO L290 TraceCheckUtils]: 110: Hoare triple {123934#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,336 INFO L290 TraceCheckUtils]: 111: Hoare triple {123934#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,336 INFO L290 TraceCheckUtils]: 112: Hoare triple {123934#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,336 INFO L290 TraceCheckUtils]: 113: Hoare triple {123934#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,337 INFO L290 TraceCheckUtils]: 114: Hoare triple {123934#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {123934#false} is VALID [2022-04-28 02:44:45,337 INFO L290 TraceCheckUtils]: 115: Hoare triple {123934#false} assume 4432 == #t~mem56;havoc #t~mem56; {123934#false} is VALID [2022-04-28 02:44:45,337 INFO L290 TraceCheckUtils]: 116: Hoare triple {123934#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {123934#false} is VALID [2022-04-28 02:44:45,337 INFO L290 TraceCheckUtils]: 117: Hoare triple {123934#false} assume 5 == ~blastFlag~0; {123934#false} is VALID [2022-04-28 02:44:45,337 INFO L290 TraceCheckUtils]: 118: Hoare triple {123934#false} assume !false; {123934#false} is VALID [2022-04-28 02:44:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 02:44:45,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:44:45,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662258805] [2022-04-28 02:44:45,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662258805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:45,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:45,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:44:45,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:44:45,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1579341589] [2022-04-28 02:44:45,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1579341589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:45,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:45,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:44:45,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549079416] [2022-04-28 02:44:45,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:44:45,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 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 119 [2022-04-28 02:44:45,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:44:45,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:45,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:45,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:44:45,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:45,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:44:45,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:44:45,423 INFO L87 Difference]: Start difference. First operand 1287 states and 1946 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:47,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:44:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:48,581 INFO L93 Difference]: Finished difference Result 2267 states and 3431 transitions. [2022-04-28 02:44:48,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:44:48,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 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 119 [2022-04-28 02:44:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:44:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-28 02:44:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-28 02:44:48,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 492 transitions. [2022-04-28 02:44:48,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:48,965 INFO L225 Difference]: With dead ends: 2267 [2022-04-28 02:44:48,965 INFO L226 Difference]: Without dead ends: 1261 [2022-04-28 02:44:48,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:44:48,966 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 130 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:44:48,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 481 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 02:44:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-04-28 02:44:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1261. [2022-04-28 02:44:49,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:44:49,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1261 states. Second operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:49,056 INFO L74 IsIncluded]: Start isIncluded. First operand 1261 states. Second operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:49,057 INFO L87 Difference]: Start difference. First operand 1261 states. Second operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:49,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:49,107 INFO L93 Difference]: Finished difference Result 1261 states and 1900 transitions. [2022-04-28 02:44:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1900 transitions. [2022-04-28 02:44:49,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:49,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:49,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 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 1261 states. [2022-04-28 02:44:49,110 INFO L87 Difference]: Start difference. First operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 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 1261 states. [2022-04-28 02:44:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:49,150 INFO L93 Difference]: Finished difference Result 1261 states and 1900 transitions. [2022-04-28 02:44:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1900 transitions. [2022-04-28 02:44:49,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:49,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:49,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:44:49,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:44:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1900 transitions. [2022-04-28 02:44:49,211 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1900 transitions. Word has length 119 [2022-04-28 02:44:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:44:49,211 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1900 transitions. [2022-04-28 02:44:49,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:49,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1261 states and 1900 transitions. [2022-04-28 02:44:51,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1900 edges. 1900 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1900 transitions. [2022-04-28 02:44:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-28 02:44:51,139 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:44:51,139 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2022-04-28 02:44:51,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 02:44:51,139 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:44:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:44:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1107867599, now seen corresponding path program 1 times [2022-04-28 02:44:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:51,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1698568914] [2022-04-28 02:44:51,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:44:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1107867599, now seen corresponding path program 2 times [2022-04-28 02:44:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:44:51,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674665072] [2022-04-28 02:44:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:44:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:44:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:51,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:44:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:44:51,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {133527#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {133520#true} is VALID [2022-04-28 02:44:51,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {133520#true} assume true; {133520#true} is VALID [2022-04-28 02:44:51,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133520#true} {133520#true} #591#return; {133520#true} is VALID [2022-04-28 02:44:51,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {133520#true} call ULTIMATE.init(); {133527#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:44:51,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {133527#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base); {133520#true} is VALID [2022-04-28 02:44:51,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {133520#true} assume true; {133520#true} is VALID [2022-04-28 02:44:51,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133520#true} {133520#true} #591#return; {133520#true} is VALID [2022-04-28 02:44:51,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {133520#true} call #t~ret159 := main(); {133520#true} is VALID [2022-04-28 02:44:51,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {133520#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 852 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 836 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 836 + #t~mem15.offset, 4);call write~int(#t~nondet17, #t~mem16.base, 12 + #t~mem16.offset, 4);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;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, 844 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet20 % 4294967296 % 4294967296 else #t~nondet20 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet21 % 4294967296 % 4294967296 else #t~nondet21 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet24 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet24 % 4294967296 % 4294967296 else #t~nondet24 % 4294967296 % 4294967296 - 4294967296), #t~mem23.base, 108 + #t~mem23.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet26 % 4294967296 % 4294967296 else #t~nondet26 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet27 % 4294967296 % 4294967296 else #t~nondet27 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet27; {133520#true} is VALID [2022-04-28 02:44:51,305 INFO L272 TraceCheckUtils]: 6: Hoare triple {133520#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {133520#true} is VALID [2022-04-28 02:44:51,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {133520#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet29;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;havoc ~tmp___0~1.base, ~tmp___0~1.offset;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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {133520#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {133520#true} is VALID [2022-04-28 02:44:51,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {133520#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {133520#true} is VALID [2022-04-28 02:44:51,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {133520#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {133520#true} is VALID [2022-04-28 02:44:51,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {133520#true} assume !false; {133520#true} is VALID [2022-04-28 02:44:51,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {133520#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {133520#true} assume 12292 == #t~mem43;havoc #t~mem43; {133520#true} is VALID [2022-04-28 02:44:51,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {133520#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {133520#true} is VALID [2022-04-28 02:44:51,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {133520#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {133520#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {133520#true} is VALID [2022-04-28 02:44:51,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {133520#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {133520#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {133520#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {133520#true} is VALID [2022-04-28 02:44:51,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {133520#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {133520#true} is VALID [2022-04-28 02:44:51,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {133520#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {133520#true} is VALID [2022-04-28 02:44:51,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {133520#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {133520#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {133520#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {133520#true} is VALID [2022-04-28 02:44:51,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {133520#true} ~skip~0 := 0; {133520#true} is VALID [2022-04-28 02:44:51,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {133520#true} assume !false; {133520#true} is VALID [2022-04-28 02:44:51,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {133520#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {133520#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {133520#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {133520#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {133520#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {133520#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {133520#true} assume 4368 == #t~mem48;havoc #t~mem48; {133520#true} is VALID [2022-04-28 02:44:51,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {133520#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {133520#true} is VALID [2022-04-28 02:44:51,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {133520#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {133520#true} is VALID [2022-04-28 02:44:51,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {133520#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {133520#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {133520#true} is VALID [2022-04-28 02:44:51,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {133520#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {133520#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {133520#true} is VALID [2022-04-28 02:44:51,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {133520#true} ~skip~0 := 0; {133520#true} is VALID [2022-04-28 02:44:51,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {133520#true} assume !false; {133520#true} is VALID [2022-04-28 02:44:51,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {133520#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {133520#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {133520#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {133520#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {133520#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {133520#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {133520#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {133520#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {133520#true} assume 4384 == #t~mem50;havoc #t~mem50; {133520#true} is VALID [2022-04-28 02:44:51,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {133520#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {133520#true} is VALID [2022-04-28 02:44:51,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {133520#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {133520#true} is VALID [2022-04-28 02:44:51,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {133520#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {133520#true} is VALID [2022-04-28 02:44:51,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {133520#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,313 INFO L290 TraceCheckUtils]: 59: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,313 INFO L290 TraceCheckUtils]: 60: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,314 INFO L290 TraceCheckUtils]: 62: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,314 INFO L290 TraceCheckUtils]: 63: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,315 INFO L290 TraceCheckUtils]: 65: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,315 INFO L290 TraceCheckUtils]: 66: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,316 INFO L290 TraceCheckUtils]: 68: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 02:44:51,316 INFO L290 TraceCheckUtils]: 69: Hoare triple {133525#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {133526#(not (= |ssl3_connect_#t~mem52| 4400))} is VALID [2022-04-28 02:44:51,316 INFO L290 TraceCheckUtils]: 70: Hoare triple {133526#(not (= |ssl3_connect_#t~mem52| 4400))} assume 4400 == #t~mem52;havoc #t~mem52; {133521#false} is VALID [2022-04-28 02:44:51,316 INFO L290 TraceCheckUtils]: 71: Hoare triple {133521#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,317 INFO L290 TraceCheckUtils]: 72: Hoare triple {133521#false} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {133521#false} is VALID [2022-04-28 02:44:51,317 INFO L290 TraceCheckUtils]: 73: Hoare triple {133521#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {133521#false} is VALID [2022-04-28 02:44:51,317 INFO L290 TraceCheckUtils]: 74: Hoare triple {133521#false} assume !(~ret~0 <= 0); {133521#false} is VALID [2022-04-28 02:44:51,317 INFO L290 TraceCheckUtils]: 75: Hoare triple {133521#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,317 INFO L290 TraceCheckUtils]: 76: Hoare triple {133521#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,317 INFO L290 TraceCheckUtils]: 77: Hoare triple {133521#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {133521#false} is VALID [2022-04-28 02:44:51,317 INFO L290 TraceCheckUtils]: 78: Hoare triple {133521#false} ~skip~0 := 0; {133521#false} is VALID [2022-04-28 02:44:51,317 INFO L290 TraceCheckUtils]: 79: Hoare triple {133521#false} assume !false; {133521#false} is VALID [2022-04-28 02:44:51,317 INFO L290 TraceCheckUtils]: 80: Hoare triple {133521#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,317 INFO L290 TraceCheckUtils]: 81: Hoare triple {133521#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,317 INFO L290 TraceCheckUtils]: 82: Hoare triple {133521#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,318 INFO L290 TraceCheckUtils]: 83: Hoare triple {133521#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,318 INFO L290 TraceCheckUtils]: 84: Hoare triple {133521#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,318 INFO L290 TraceCheckUtils]: 85: Hoare triple {133521#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,318 INFO L290 TraceCheckUtils]: 86: Hoare triple {133521#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,318 INFO L290 TraceCheckUtils]: 87: Hoare triple {133521#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,318 INFO L290 TraceCheckUtils]: 88: Hoare triple {133521#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,318 INFO L290 TraceCheckUtils]: 89: Hoare triple {133521#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,318 INFO L290 TraceCheckUtils]: 90: Hoare triple {133521#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,318 INFO L290 TraceCheckUtils]: 91: Hoare triple {133521#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,318 INFO L290 TraceCheckUtils]: 92: Hoare triple {133521#false} assume 4416 == #t~mem54;havoc #t~mem54; {133521#false} is VALID [2022-04-28 02:44:51,319 INFO L290 TraceCheckUtils]: 93: Hoare triple {133521#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {133521#false} is VALID [2022-04-28 02:44:51,319 INFO L290 TraceCheckUtils]: 94: Hoare triple {133521#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {133521#false} is VALID [2022-04-28 02:44:51,319 INFO L290 TraceCheckUtils]: 95: Hoare triple {133521#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {133521#false} is VALID [2022-04-28 02:44:51,319 INFO L290 TraceCheckUtils]: 96: Hoare triple {133521#false} assume !(0 == ~tmp___6~0); {133521#false} is VALID [2022-04-28 02:44:51,319 INFO L290 TraceCheckUtils]: 97: Hoare triple {133521#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,319 INFO L290 TraceCheckUtils]: 98: Hoare triple {133521#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {133521#false} is VALID [2022-04-28 02:44:51,319 INFO L290 TraceCheckUtils]: 99: Hoare triple {133521#false} ~skip~0 := 0; {133521#false} is VALID [2022-04-28 02:44:51,319 INFO L290 TraceCheckUtils]: 100: Hoare triple {133521#false} assume !false; {133521#false} is VALID [2022-04-28 02:44:51,319 INFO L290 TraceCheckUtils]: 101: Hoare triple {133521#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,319 INFO L290 TraceCheckUtils]: 102: Hoare triple {133521#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,319 INFO L290 TraceCheckUtils]: 103: Hoare triple {133521#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,320 INFO L290 TraceCheckUtils]: 104: Hoare triple {133521#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,320 INFO L290 TraceCheckUtils]: 105: Hoare triple {133521#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,320 INFO L290 TraceCheckUtils]: 106: Hoare triple {133521#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,320 INFO L290 TraceCheckUtils]: 107: Hoare triple {133521#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,320 INFO L290 TraceCheckUtils]: 108: Hoare triple {133521#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,320 INFO L290 TraceCheckUtils]: 109: Hoare triple {133521#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,320 INFO L290 TraceCheckUtils]: 110: Hoare triple {133521#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,320 INFO L290 TraceCheckUtils]: 111: Hoare triple {133521#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,320 INFO L290 TraceCheckUtils]: 112: Hoare triple {133521#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,320 INFO L290 TraceCheckUtils]: 113: Hoare triple {133521#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,321 INFO L290 TraceCheckUtils]: 114: Hoare triple {133521#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,321 INFO L290 TraceCheckUtils]: 115: Hoare triple {133521#false} assume 4432 == #t~mem56;havoc #t~mem56; {133521#false} is VALID [2022-04-28 02:44:51,321 INFO L290 TraceCheckUtils]: 116: Hoare triple {133521#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {133521#false} is VALID [2022-04-28 02:44:51,321 INFO L290 TraceCheckUtils]: 117: Hoare triple {133521#false} assume !(5 == ~blastFlag~0); {133521#false} is VALID [2022-04-28 02:44:51,321 INFO L290 TraceCheckUtils]: 118: Hoare triple {133521#false} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,321 INFO L290 TraceCheckUtils]: 119: Hoare triple {133521#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,321 INFO L290 TraceCheckUtils]: 120: Hoare triple {133521#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {133521#false} is VALID [2022-04-28 02:44:51,321 INFO L290 TraceCheckUtils]: 121: Hoare triple {133521#false} ~skip~0 := 0; {133521#false} is VALID [2022-04-28 02:44:51,321 INFO L290 TraceCheckUtils]: 122: Hoare triple {133521#false} assume !false; {133521#false} is VALID [2022-04-28 02:44:51,321 INFO L290 TraceCheckUtils]: 123: Hoare triple {133521#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,321 INFO L290 TraceCheckUtils]: 124: Hoare triple {133521#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,322 INFO L290 TraceCheckUtils]: 125: Hoare triple {133521#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,322 INFO L290 TraceCheckUtils]: 126: Hoare triple {133521#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,322 INFO L290 TraceCheckUtils]: 127: Hoare triple {133521#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,322 INFO L290 TraceCheckUtils]: 128: Hoare triple {133521#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,322 INFO L290 TraceCheckUtils]: 129: Hoare triple {133521#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,322 INFO L290 TraceCheckUtils]: 130: Hoare triple {133521#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,322 INFO L290 TraceCheckUtils]: 131: Hoare triple {133521#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,322 INFO L290 TraceCheckUtils]: 132: Hoare triple {133521#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,322 INFO L290 TraceCheckUtils]: 133: Hoare triple {133521#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,322 INFO L290 TraceCheckUtils]: 134: Hoare triple {133521#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,322 INFO L290 TraceCheckUtils]: 135: Hoare triple {133521#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,323 INFO L290 TraceCheckUtils]: 136: Hoare triple {133521#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,323 INFO L290 TraceCheckUtils]: 137: Hoare triple {133521#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,323 INFO L290 TraceCheckUtils]: 138: Hoare triple {133521#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {133521#false} is VALID [2022-04-28 02:44:51,323 INFO L290 TraceCheckUtils]: 139: Hoare triple {133521#false} assume 4448 == #t~mem58;havoc #t~mem58; {133521#false} is VALID [2022-04-28 02:44:51,323 INFO L290 TraceCheckUtils]: 140: Hoare triple {133521#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {133521#false} is VALID [2022-04-28 02:44:51,323 INFO L290 TraceCheckUtils]: 141: Hoare triple {133521#false} assume 4 == ~blastFlag~0; {133521#false} is VALID [2022-04-28 02:44:51,323 INFO L290 TraceCheckUtils]: 142: Hoare triple {133521#false} assume !false; {133521#false} is VALID [2022-04-28 02:44:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-28 02:44:51,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:44:51,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674665072] [2022-04-28 02:44:51,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674665072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:51,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:51,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:44:51,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:44:51,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1698568914] [2022-04-28 02:44:51,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1698568914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:44:51,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:44:51,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:44:51,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126974390] [2022-04-28 02:44:51,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:44:51,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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 143 [2022-04-28 02:44:51,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:44:51,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:51,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:51,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:44:51,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:51,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:44:51,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:44:51,405 INFO L87 Difference]: Start difference. First operand 1261 states and 1900 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:53,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 02:44:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:54,741 INFO L93 Difference]: Finished difference Result 2764 states and 4089 transitions. [2022-04-28 02:44:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:44:54,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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 143 [2022-04-28 02:44:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:44:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 02:44:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 02:44:54,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-28 02:44:55,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:55,160 INFO L225 Difference]: With dead ends: 2764 [2022-04-28 02:44:55,161 INFO L226 Difference]: Without dead ends: 1519 [2022-04-28 02:44:55,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:44:55,162 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 107 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:44:55,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 295 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 02:44:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2022-04-28 02:44:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1261. [2022-04-28 02:44:55,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:44:55,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1519 states. Second operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:55,257 INFO L74 IsIncluded]: Start isIncluded. First operand 1519 states. Second operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:55,258 INFO L87 Difference]: Start difference. First operand 1519 states. Second operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:55,311 INFO L93 Difference]: Finished difference Result 1519 states and 2192 transitions. [2022-04-28 02:44:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2192 transitions. [2022-04-28 02:44:55,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:55,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:55,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 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 1519 states. [2022-04-28 02:44:55,314 INFO L87 Difference]: Start difference. First operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 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 1519 states. [2022-04-28 02:44:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:44:55,367 INFO L93 Difference]: Finished difference Result 1519 states and 2192 transitions. [2022-04-28 02:44:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2192 transitions. [2022-04-28 02:44:55,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:44:55,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:44:55,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:44:55,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:44:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1882 transitions. [2022-04-28 02:44:55,441 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1882 transitions. Word has length 143 [2022-04-28 02:44:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:44:55,441 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1882 transitions. [2022-04-28 02:44:55,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:44:55,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1261 states and 1882 transitions. [2022-04-28 02:44:57,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1882 edges. 1882 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:44:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1882 transitions. [2022-04-28 02:44:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-28 02:44:57,421 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:44:57,421 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2022-04-28 02:44:57,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 02:44:57,421 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:44:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:44:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 1 times [2022-04-28 02:44:57,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:44:57,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946022362] [2022-04-28 02:44:57,422 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:44:57,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 2 times [2022-04-28 02:44:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:44:57,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129701511] [2022-04-28 02:44:57,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:44:57,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:44:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:44:58,264 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:44:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:44:58,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:44:58,645 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 02:44:58,645 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 02:44:58,650 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:44:58,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 02:44:58,654 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 02:44:58,656 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2022-04-28 02:44:58,705 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1123 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1123 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1084 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1084 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1668 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1668 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1049 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1049 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1126-2 has no Hoare annotation [2022-04-28 02:44:58,706 WARN L170 areAnnotationChecker]: L1126 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1126 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1084-1 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1668-1 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1052 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1052 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1049-2 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1052-1 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1134 has no Hoare annotation [2022-04-28 02:44:58,707 WARN L170 areAnnotationChecker]: L1134 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1143-1 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1143-1 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1143-1 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1054 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1054 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1648 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1054-1 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1652 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1652 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1652-2 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1147 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1149 has no Hoare annotation [2022-04-28 02:44:58,708 WARN L170 areAnnotationChecker]: L1149 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1257-2 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-28 02:44:58,709 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1269-2 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1303 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1303 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1282 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1282 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1303-2 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1303-2 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1324 has no Hoare annotation [2022-04-28 02:44:58,710 WARN L170 areAnnotationChecker]: L1324 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1324-2 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1324-2 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1343 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1343 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1617-1 has no Hoare annotation [2022-04-28 02:44:58,711 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1343-2 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1347-2 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1347-2 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1621 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1621 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1619-2 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1619-2 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-28 02:44:58,712 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1377 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1377 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-28 02:44:58,713 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1413-2 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 02:44:58,714 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1442 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1442 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1442-2 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 02:44:58,715 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1473-2 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1479 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1479 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-28 02:44:58,716 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1486 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1486 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1503-1 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1520 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1520 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1525 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1525 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1525-2 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-28 02:44:58,717 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-28 02:44:58,718 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-28 02:44:58,718 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-28 02:44:58,718 WARN L170 areAnnotationChecker]: L1538 has no Hoare annotation [2022-04-28 02:44:58,718 WARN L170 areAnnotationChecker]: L1538 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1551 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1551 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1551-2 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1556-2 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-28 02:44:58,719 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-28 02:44:58,719 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:44:58,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:44:58 BoogieIcfgContainer [2022-04-28 02:44:58,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:44:58,723 INFO L158 Benchmark]: Toolchain (without parser) took 167881.42ms. Allocated memory was 185.6MB in the beginning and 311.4MB in the end (delta: 125.8MB). Free memory was 126.0MB in the beginning and 127.3MB in the end (delta: -1.3MB). Peak memory consumption was 172.0MB. Max. memory is 8.0GB. [2022-04-28 02:44:58,724 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:44:58,724 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.55ms. Allocated memory was 185.6MB in the beginning and 259.0MB in the end (delta: 73.4MB). Free memory was 125.8MB in the beginning and 209.9MB in the end (delta: -84.2MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-04-28 02:44:58,724 INFO L158 Benchmark]: Boogie Preprocessor took 147.29ms. Allocated memory is still 259.0MB. Free memory was 209.9MB in the beginning and 200.6MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 02:44:58,724 INFO L158 Benchmark]: RCFGBuilder took 2626.37ms. Allocated memory is still 259.0MB. Free memory was 200.6MB in the beginning and 177.3MB in the end (delta: 23.3MB). Peak memory consumption was 59.0MB. Max. memory is 8.0GB. [2022-04-28 02:44:58,724 INFO L158 Benchmark]: TraceAbstraction took 164560.23ms. Allocated memory was 259.0MB in the beginning and 311.4MB in the end (delta: 52.4MB). Free memory was 176.8MB in the beginning and 127.3MB in the end (delta: 49.5MB). Peak memory consumption was 148.6MB. Max. memory is 8.0GB. [2022-04-28 02:44:58,729 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 541.55ms. Allocated memory was 185.6MB in the beginning and 259.0MB in the end (delta: 73.4MB). Free memory was 125.8MB in the beginning and 209.9MB in the end (delta: -84.2MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 147.29ms. Allocated memory is still 259.0MB. Free memory was 209.9MB in the beginning and 200.6MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2626.37ms. Allocated memory is still 259.0MB. Free memory was 200.6MB in the beginning and 177.3MB in the end (delta: 23.3MB). Peak memory consumption was 59.0MB. Max. memory is 8.0GB. * TraceAbstraction took 164560.23ms. Allocated memory was 259.0MB in the beginning and 311.4MB in the end (delta: 52.4MB). Free memory was 176.8MB in the beginning and 127.3MB in the end (delta: 49.5MB). Peak memory consumption was 148.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1658]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1343. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; [L1065] SSL *s ; [L1069] s = malloc (sizeof (SSL)) [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] EXPR s->s3 [L1071] s->s3->flags = __VERIFIER_nondet_long() [L1072] EXPR s->s3 [L1072] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1073] EXPR s->s3 [L1073] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1074] EXPR s->s3 [L1074] EXPR (s->s3)->tmp.new_cipher [L1074] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1075] EXPR s->s3 [L1075] s->s3->tmp.next_state = __VERIFIER_nondet_int() [L1076] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1077] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1078] s->ctx = malloc(sizeof(SSL_CTX)) [L1079] EXPR s->ctx [L1079] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1080] s->state = 12292 [L1081] s->version = __VERIFIER_nondet_int() [L1082] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1083] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1084] CALL ssl3_connect(s) [L1090] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1091] unsigned long tmp ; [L1092] unsigned long l ; [L1093] long num1 ; [L1094] void (*cb)() ; [L1095] int ret ; [L1096] int new_state ; [L1097] int state ; [L1098] int skip ; [L1099] int *tmp___0 ; [L1100] int tmp___1 = __VERIFIER_nondet_int(); [L1101] int tmp___2 = __VERIFIER_nondet_int(); [L1102] int tmp___3 ; [L1103] int tmp___4 ; [L1104] int tmp___5 ; [L1105] int tmp___6 ; [L1106] int tmp___7 ; [L1107] int tmp___8 ; [L1108] long tmp___9 ; [L1110] int blastFlag ; [L1113] blastFlag = 0 [L1114] s->state = 12292 [L1115] s->hit = __VERIFIER_nondet_int() [L1117] tmp = __VERIFIER_nondet_int() [L1118] cb = (void (*)())((void *)0) [L1119] ret = -1 [L1120] skip = 0 [L1121] tmp___0 = (int*)malloc(sizeof(int)) [L1122] *tmp___0 = 0 [L1123] EXPR s->info_callback [L1123] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1124] EXPR s->info_callback [L1124] cb = s->info_callback [L1132] EXPR s->in_handshake [L1132] s->in_handshake += 1 [L1133] COND FALSE !(tmp___1 & 12288) [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND TRUE s->state == 12292 [L1249] s->new_session = 1 [L1250] s->state = 4096 [L1251] EXPR s->ctx [L1251] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1251] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1256] s->server = 0 [L1257] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) [L1262] EXPR s->version [L1262] COND FALSE !((s->version & 65280) != 768) [L1268] s->type = 4096 [L1269] EXPR s->init_buf [L1269] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1281] tmp___4 = __VERIFIER_nondet_int() [L1282] COND FALSE !(! tmp___4) [L1288] tmp___5 = __VERIFIER_nondet_int() [L1289] COND FALSE !(! tmp___5) [L1295] s->state = 4368 [L1296] EXPR s->ctx [L1296] EXPR (s->ctx)->stats.sess_connect [L1296] (s->ctx)->stats.sess_connect += 1 [L1297] s->init_num = 0 [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND TRUE s->state == 4368 [L1301] s->shutdown = 0 [L1302] ret = __VERIFIER_nondet_int() [L1303] COND TRUE blastFlag == 0 [L1304] blastFlag = 1 [L1308] COND FALSE !(ret <= 0) [L1313] s->state = 4384 [L1314] s->init_num = 0 [L1315] EXPR s->bbio [L1315] EXPR s->wbio [L1315] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state [L1167] COND TRUE s->state == 4384 [L1323] ret = __VERIFIER_nondet_int() [L1324] COND TRUE blastFlag == 1 [L1325] blastFlag = 2 [L1329] COND FALSE !(ret <= 0) [L1334] s->hit [L1334] COND FALSE !(s->hit) [L1337] s->state = 4400 [L1339] s->init_num = 0 [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state [L1173] COND TRUE s->state == 4400 [L1343] EXPR s->s3 [L1343] EXPR (s->s3)->tmp.new_cipher [L1343] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1343] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1346] ret = __VERIFIER_nondet_int() [L1347] COND TRUE blastFlag == 2 [L1348] blastFlag = 3 [L1352] COND FALSE !(ret <= 0) [L1358] s->state = 4416 [L1359] s->init_num = 0 [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state [L1179] COND TRUE s->state == 4416 [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 3 [L1365] blastFlag = 4 [L1369] COND FALSE !(ret <= 0) [L1374] s->state = 4432 [L1375] s->init_num = 0 [L1376] tmp___6 = __VERIFIER_nondet_int() [L1377] COND FALSE !(! tmp___6) [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state [L1185] COND TRUE s->state == 4432 [L1386] ret = __VERIFIER_nondet_int() [L1387] COND FALSE !(blastFlag == 5) [L1392] COND FALSE !(ret <= 0) [L1397] s->state = 4448 [L1398] s->init_num = 0 [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4432) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 4433) [L1191] EXPR s->state [L1191] COND TRUE s->state == 4448 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 [L1658] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 164.5s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 95.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26 mSolverCounterUnknown, 2598 SdHoareTripleChecker+Valid, 63.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2598 mSDsluCounter, 10848 SdHoareTripleChecker+Invalid, 63.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6002 mSDsCounter, 573 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10590 IncrementalHoareTripleChecker+Invalid, 11189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 573 mSolverCounterUnsat, 4846 mSDtfsCounter, 10590 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1287occurred in iteration=23, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 3387 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-28 02:44:58,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...