/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:15:55,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:15:55,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:15:55,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:15:55,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:15:55,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:15:55,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:15:55,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:15:55,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:15:55,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:15:55,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:15:55,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:15:55,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:15:55,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:15:55,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:15:55,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:15:55,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:15:55,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:15:55,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:15:55,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:15:55,495 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:15:55,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:15:55,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:15:55,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:15:55,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:15:55,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:15:55,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:15:55,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:15:55,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:15:55,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:15:55,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:15:55,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:15:55,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:15:55,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:15:55,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:15:55,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:15:55,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:15:55,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:15:55,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:15:55,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:15:55,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:15:55,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:15:55,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 18:15:55,520 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:15:55,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:15:55,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:15:55,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:15:55,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:15:55,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:15:55,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:15:55,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:15:55,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:15:55,523 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:15:55,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:15:55,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:15:55,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:15:55,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:15:55,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:15:55,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:15:55,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:15:55,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:15:55,524 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:15:55,524 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:15:55,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:15:55,524 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:15:55,525 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 18:15:55,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:15:55,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:15:55,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:15:55,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:15:55,765 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:15:55,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-1.c [2022-04-15 18:15:55,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b90a4274f/e2aeb210e6cd4b109d41b4b9b1108414/FLAG74740e497 [2022-04-15 18:15:56,263 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:15:56,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-1.c [2022-04-15 18:15:56,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b90a4274f/e2aeb210e6cd4b109d41b4b9b1108414/FLAG74740e497 [2022-04-15 18:15:56,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b90a4274f/e2aeb210e6cd4b109d41b4b9b1108414 [2022-04-15 18:15:56,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:15:56,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:15:56,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:15:56,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:15:56,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:15:56,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:15:56" (1/1) ... [2022-04-15 18:15:56,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d1f701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:15:56, skipping insertion in model container [2022-04-15 18:15:56,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:15:56" (1/1) ... [2022-04-15 18:15:56,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:15:56,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:15:56,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-04-15 18:15:56,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:15:56,649 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:15:56,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-04-15 18:15:56,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:15:56,758 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:15:56,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:15:56 WrapperNode [2022-04-15 18:15:56,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:15:56,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:15:56,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:15:56,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:15:56,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:15:56" (1/1) ... [2022-04-15 18:15:56,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:15:56" (1/1) ... [2022-04-15 18:15:56,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:15:56" (1/1) ... [2022-04-15 18:15:56,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:15:56" (1/1) ... [2022-04-15 18:15:56,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:15:56" (1/1) ... [2022-04-15 18:15:56,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:15:56" (1/1) ... [2022-04-15 18:15:56,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:15:56" (1/1) ... [2022-04-15 18:15:56,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:15:56,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:15:56,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:15:56,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:15:56,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:15:56" (1/1) ... [2022-04-15 18:15:56,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:15:56,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:15:56,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 18:15:56,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 18:15:56,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:15:56,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:15:56,951 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:15:56,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 18:15:56,951 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 18:15:56,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:15:56,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 18:15:56,952 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 18:15:56,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 18:15:56,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 18:15:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:15:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:15:56,953 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:15:56,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:15:56,954 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 18:15:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 18:15:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:15:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 18:15:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 18:15:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 18:15:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 18:15:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 18:15:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 18:15:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 18:15:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 18:15:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 18:15:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:15:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 18:15:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:15:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 18:15:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:15:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 18:15:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 18:15:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:15:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:15:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:15:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 18:15:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 18:15:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 18:15:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 18:15:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:15:57,107 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:15:57,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:15:58,713 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:15:59,119 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 18:15:59,120 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 18:15:59,129 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:15:59,135 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:15:59,135 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 18:15:59,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:15:59 BoogieIcfgContainer [2022-04-15 18:15:59,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:15:59,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:15:59,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:15:59,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:15:59,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:15:56" (1/3) ... [2022-04-15 18:15:59,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1785cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:15:59, skipping insertion in model container [2022-04-15 18:15:59,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:15:56" (2/3) ... [2022-04-15 18:15:59,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1785cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:15:59, skipping insertion in model container [2022-04-15 18:15:59,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:15:59" (3/3) ... [2022-04-15 18:15:59,142 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2022-04-15 18:15:59,146 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:15:59,146 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:15:59,179 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:15:59,184 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 18:15:59,184 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:15:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 18:15:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 18:15:59,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:59,208 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:15:59,208 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:59,212 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-15 18:15:59,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:59,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1257411454] [2022-04-15 18:15:59,227 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:15:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-15 18:15:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:59,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294065008] [2022-04-15 18:15:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:59,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:59,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 18:15:59,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 18:15:59,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 18:15:59,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:59,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 18:15:59,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 18:15:59,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 18:15:59,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-15 18:15:59,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-15 18:15:59,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-15 18:15:59,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:15:59,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:15:59,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:15:59,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:15:59,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:15:59,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-15 18:15:59,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:15:59,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-15 18:15:59,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-15 18:15:59,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 4 == ~blastFlag~0; {142#false} is VALID [2022-04-15 18:15:59,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-15 18:15:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:15:59,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:59,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294065008] [2022-04-15 18:15:59,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294065008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:59,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:59,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:59,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:59,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1257411454] [2022-04-15 18:15:59,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1257411454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:59,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:59,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:59,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190025944] [2022-04-15 18:15:59,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:59,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:15:59,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:59,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:59,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:59,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:15:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:59,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:15:59,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:15:59,842 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:02,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:04,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:06,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:09,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:10,294 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-15 18:16:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:16:10,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:16:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 18:16:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 18:16:10,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 18:16:10,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:10,702 INFO L225 Difference]: With dead ends: 267 [2022-04-15 18:16:10,702 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 18:16:10,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:16:10,712 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:10,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 3 Unknown, 0 Unchecked, 7.5s Time] [2022-04-15 18:16:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 18:16:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 18:16:10,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:10,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:10,795 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:10,796 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:10,806 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 18:16:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 18:16:10,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:10,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:10,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 18:16:10,808 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 18:16:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:10,814 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 18:16:10,814 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 18:16:10,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:10,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:10,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:10,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-15 18:16:10,824 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-15 18:16:10,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:10,824 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-15 18:16:10,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:10,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-15 18:16:10,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-15 18:16:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 18:16:10,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:10,956 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:10,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:16:10,956 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:10,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:10,957 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-15 18:16:10,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:10,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294253909] [2022-04-15 18:16:10,958 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-15 18:16:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:10,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541259324] [2022-04-15 18:16:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:10,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:11,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:11,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 18:16:11,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 18:16:11,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 18:16:11,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:11,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 18:16:11,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 18:16:11,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 18:16:11,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-15 18:16:11,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1173#true} is VALID [2022-04-15 18:16:11,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {1173#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1173#true} is VALID [2022-04-15 18:16:11,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 56 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:16:11,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {1174#false} is VALID [2022-04-15 18:16:11,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-15 18:16:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:16:11,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:11,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541259324] [2022-04-15 18:16:11,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541259324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:11,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:11,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:11,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:11,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294253909] [2022-04-15 18:16:11,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294253909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:11,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:11,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930923868] [2022-04-15 18:16:11,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:11,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 18:16:11,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:11,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:11,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:11,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:16:11,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:11,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:16:11,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:11,246 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:13,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:13,938 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-15 18:16:13,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:16:13,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 18:16:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 18:16:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 18:16:13,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 18:16:14,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:14,294 INFO L225 Difference]: With dead ends: 327 [2022-04-15 18:16:14,294 INFO L226 Difference]: Without dead ends: 222 [2022-04-15 18:16:14,295 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:14,296 INFO L913 BasicCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:14,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 18:16:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-15 18:16:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-15 18:16:14,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:14,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:14,309 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:14,309 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:14,316 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 18:16:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 18:16:14,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:14,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:14,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 18:16:14,319 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 18:16:14,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:14,326 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 18:16:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 18:16:14,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:14,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:14,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:14,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-15 18:16:14,335 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-15 18:16:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:14,335 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-15 18:16:14,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:14,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-15 18:16:14,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 18:16:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 18:16:14,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:14,592 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:14,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:16:14,592 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:14,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-15 18:16:14,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:14,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1687871783] [2022-04-15 18:16:14,594 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:14,594 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-15 18:16:14,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:14,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939838498] [2022-04-15 18:16:14,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:14,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:14,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:14,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2724#true} is VALID [2022-04-15 18:16:14,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 18:16:14,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 18:16:14,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:14,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2724#true} is VALID [2022-04-15 18:16:14,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 18:16:14,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 18:16:14,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-15 18:16:14,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2724#true} is VALID [2022-04-15 18:16:14,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {2724#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2724#true} is VALID [2022-04-15 18:16:14,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {2724#true} is VALID [2022-04-15 18:16:14,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {2724#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {2724#true} is VALID [2022-04-15 18:16:14,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {2724#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {2724#true} is VALID [2022-04-15 18:16:14,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {2724#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2724#true} is VALID [2022-04-15 18:16:14,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 18:16:14,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:16:14,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-15 18:16:14,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {2724#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {2724#true} is VALID [2022-04-15 18:16:14,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:16:14,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {2724#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2724#true} is VALID [2022-04-15 18:16:14,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:16:14,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {2724#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {2724#true} is VALID [2022-04-15 18:16:14,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {2724#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {2724#true} is VALID [2022-04-15 18:16:14,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-15 18:16:14,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {2724#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:16:14,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {2724#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {2724#true} is VALID [2022-04-15 18:16:14,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {2724#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2724#true} is VALID [2022-04-15 18:16:14,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-15 18:16:14,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 18:16:14,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:16:14,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {2724#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:16:14,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {2724#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:16:14,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {2724#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:16:14,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {2724#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:16:14,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {2724#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:16:14,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-15 18:16:14,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {2724#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {2724#true} is VALID [2022-04-15 18:16:14,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-15 18:16:14,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {2724#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,827 INFO L290 TraceCheckUtils]: 40: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,827 INFO L290 TraceCheckUtils]: 41: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,829 INFO L290 TraceCheckUtils]: 46: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,831 INFO L290 TraceCheckUtils]: 51: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:14,832 INFO L290 TraceCheckUtils]: 54: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2730#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-15 18:16:14,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {2730#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-15 18:16:14,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {2725#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {2725#false} is VALID [2022-04-15 18:16:14,834 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 4 == ~blastFlag~0; {2725#false} is VALID [2022-04-15 18:16:14,836 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 18:16:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:16:14,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:14,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939838498] [2022-04-15 18:16:14,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939838498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:14,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:14,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:14,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:14,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1687871783] [2022-04-15 18:16:14,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1687871783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:14,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:14,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883559845] [2022-04-15 18:16:14,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:14,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 18:16:14,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:14,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:14,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:14,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:16:14,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:14,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:16:14,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:16:14,897 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:16,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:18,160 INFO L93 Difference]: Finished difference Result 611 states and 908 transitions. [2022-04-15 18:16:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:16:18,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 18:16:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:16:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:16:18,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 18:16:18,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:18,524 INFO L225 Difference]: With dead ends: 611 [2022-04-15 18:16:18,524 INFO L226 Difference]: Without dead ends: 405 [2022-04-15 18:16:18,525 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:16:18,526 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:18,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 279 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 18:16:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-15 18:16:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 270. [2022-04-15 18:16:18,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:18,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,561 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,561 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:18,574 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-15 18:16:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-15 18:16:18,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:18,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:18,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-15 18:16:18,576 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-15 18:16:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:18,589 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-15 18:16:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-15 18:16:18,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:18,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:18,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:18,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 410 transitions. [2022-04-15 18:16:18,599 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 410 transitions. Word has length 59 [2022-04-15 18:16:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:18,599 INFO L478 AbstractCegarLoop]: Abstraction has 270 states and 410 transitions. [2022-04-15 18:16:18,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 270 states and 410 transitions. [2022-04-15 18:16:18,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 410 transitions. [2022-04-15 18:16:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 18:16:18,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:18,920 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:18,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:16:18,920 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:18,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash -949350737, now seen corresponding path program 1 times [2022-04-15 18:16:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:18,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835970133] [2022-04-15 18:16:18,921 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash -949350737, now seen corresponding path program 2 times [2022-04-15 18:16:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:18,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653467728] [2022-04-15 18:16:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:19,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:19,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {5315#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {5308#true} is VALID [2022-04-15 18:16:19,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {5308#true} assume true; {5308#true} is VALID [2022-04-15 18:16:19,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5308#true} {5308#true} #593#return; {5308#true} is VALID [2022-04-15 18:16:19,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {5308#true} call ULTIMATE.init(); {5315#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:19,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {5315#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {5308#true} is VALID [2022-04-15 18:16:19,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {5308#true} assume true; {5308#true} is VALID [2022-04-15 18:16:19,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5308#true} {5308#true} #593#return; {5308#true} is VALID [2022-04-15 18:16:19,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {5308#true} call #t~ret158 := main(); {5308#true} is VALID [2022-04-15 18:16:19,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {5308#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {5308#true} is VALID [2022-04-15 18:16:19,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {5308#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {5308#true} is VALID [2022-04-15 18:16:19,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {5308#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {5308#true} is VALID [2022-04-15 18:16:19,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {5308#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {5308#true} is VALID [2022-04-15 18:16:19,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {5308#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {5308#true} is VALID [2022-04-15 18:16:19,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {5308#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5308#true} is VALID [2022-04-15 18:16:19,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {5308#true} assume !false; {5308#true} is VALID [2022-04-15 18:16:19,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {5308#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:16:19,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {5308#true} assume 12292 == #t~mem49;havoc #t~mem49; {5308#true} is VALID [2022-04-15 18:16:19,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {5308#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {5308#true} is VALID [2022-04-15 18:16:19,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {5308#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:16:19,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {5308#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {5308#true} is VALID [2022-04-15 18:16:19,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {5308#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:16:19,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {5308#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {5308#true} is VALID [2022-04-15 18:16:19,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {5308#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {5308#true} is VALID [2022-04-15 18:16:19,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {5308#true} assume !(0 == ~tmp___4~0); {5308#true} is VALID [2022-04-15 18:16:19,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {5308#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:16:19,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {5308#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {5308#true} is VALID [2022-04-15 18:16:19,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {5308#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {5308#true} is VALID [2022-04-15 18:16:19,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {5308#true} ~skip~0 := 0; {5308#true} is VALID [2022-04-15 18:16:19,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {5308#true} assume !false; {5308#true} is VALID [2022-04-15 18:16:19,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {5308#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:16:19,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {5308#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:16:19,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {5308#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:16:19,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {5308#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:16:19,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {5308#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:16:19,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {5308#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:16:19,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {5308#true} assume 4368 == #t~mem54;havoc #t~mem54; {5308#true} is VALID [2022-04-15 18:16:19,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {5308#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {5308#true} is VALID [2022-04-15 18:16:19,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {5308#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5308#true} is VALID [2022-04-15 18:16:19,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {5308#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} ~skip~0 := 0; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !false; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,163 INFO L290 TraceCheckUtils]: 45: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:16:19,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5314#(not (= |ssl3_connect_#t~mem63| 4433))} is VALID [2022-04-15 18:16:19,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {5314#(not (= |ssl3_connect_#t~mem63| 4433))} assume 4433 == #t~mem63;havoc #t~mem63; {5309#false} is VALID [2022-04-15 18:16:19,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {5309#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {5309#false} is VALID [2022-04-15 18:16:19,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {5309#false} assume 4 == ~blastFlag~0; {5309#false} is VALID [2022-04-15 18:16:19,171 INFO L290 TraceCheckUtils]: 59: Hoare triple {5309#false} assume !false; {5309#false} is VALID [2022-04-15 18:16:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:16:19,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:19,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653467728] [2022-04-15 18:16:19,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653467728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:19,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:19,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:19,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:19,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835970133] [2022-04-15 18:16:19,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835970133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:19,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:19,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:19,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896390060] [2022-04-15 18:16:19,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:19,174 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 60 [2022-04-15 18:16:19,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:19,176 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-15 18:16:19,216 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-15 18:16:19,216 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:16:19,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:19,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:16:19,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:16:19,218 INFO L87 Difference]: Start difference. First operand 270 states and 410 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-15 18:16:21,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:22,300 INFO L93 Difference]: Finished difference Result 707 states and 1076 transitions. [2022-04-15 18:16:22,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:16:22,300 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 60 [2022-04-15 18:16:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:22,300 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-15 18:16:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:16:22,304 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-15 18:16:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:16:22,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 18:16:22,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:22,716 INFO L225 Difference]: With dead ends: 707 [2022-04-15 18:16:22,716 INFO L226 Difference]: Without dead ends: 453 [2022-04-15 18:16:22,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:16:22,727 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:22,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:16:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-15 18:16:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 320. [2022-04-15 18:16:22,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:22,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:22,750 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:22,751 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:22,766 INFO L93 Difference]: Finished difference Result 453 states and 684 transitions. [2022-04-15 18:16:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 684 transitions. [2022-04-15 18:16:22,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:22,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:22,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 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 453 states. [2022-04-15 18:16:22,768 INFO L87 Difference]: Start difference. First operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 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 453 states. [2022-04-15 18:16:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:22,793 INFO L93 Difference]: Finished difference Result 453 states and 684 transitions. [2022-04-15 18:16:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 684 transitions. [2022-04-15 18:16:22,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:22,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:22,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:22,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 498 transitions. [2022-04-15 18:16:22,800 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 498 transitions. Word has length 60 [2022-04-15 18:16:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:22,801 INFO L478 AbstractCegarLoop]: Abstraction has 320 states and 498 transitions. [2022-04-15 18:16:22,801 INFO L479 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-15 18:16:22,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 320 states and 498 transitions. [2022-04-15 18:16:23,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 498 transitions. [2022-04-15 18:16:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 18:16:23,181 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:23,181 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:23,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 18:16:23,181 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:23,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1308079053, now seen corresponding path program 1 times [2022-04-15 18:16:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:23,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1781434303] [2022-04-15 18:16:23,182 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1308079053, now seen corresponding path program 2 times [2022-04-15 18:16:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:23,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930125689] [2022-04-15 18:16:23,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:23,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:23,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:23,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {8286#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {8280#true} is VALID [2022-04-15 18:16:23,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {8280#true} assume true; {8280#true} is VALID [2022-04-15 18:16:23,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8280#true} {8280#true} #593#return; {8280#true} is VALID [2022-04-15 18:16:23,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {8280#true} call ULTIMATE.init(); {8286#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:23,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {8286#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {8280#true} is VALID [2022-04-15 18:16:23,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {8280#true} assume true; {8280#true} is VALID [2022-04-15 18:16:23,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8280#true} {8280#true} #593#return; {8280#true} is VALID [2022-04-15 18:16:23,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {8280#true} call #t~ret158 := main(); {8280#true} is VALID [2022-04-15 18:16:23,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {8280#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {8280#true} is VALID [2022-04-15 18:16:23,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {8280#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {8280#true} is VALID [2022-04-15 18:16:23,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {8280#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {8280#true} is VALID [2022-04-15 18:16:23,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {8280#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {8280#true} is VALID [2022-04-15 18:16:23,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {8280#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {8280#true} is VALID [2022-04-15 18:16:23,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {8280#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8280#true} is VALID [2022-04-15 18:16:23,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {8280#true} assume !false; {8280#true} is VALID [2022-04-15 18:16:23,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {8280#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:16:23,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {8280#true} assume 12292 == #t~mem49;havoc #t~mem49; {8280#true} is VALID [2022-04-15 18:16:23,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {8280#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {8280#true} is VALID [2022-04-15 18:16:23,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {8280#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:16:23,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {8280#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8280#true} is VALID [2022-04-15 18:16:23,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {8280#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:16:23,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {8280#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {8280#true} is VALID [2022-04-15 18:16:23,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {8280#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {8280#true} is VALID [2022-04-15 18:16:23,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {8280#true} assume !(0 == ~tmp___4~0); {8280#true} is VALID [2022-04-15 18:16:23,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {8280#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:16:23,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {8280#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8280#true} is VALID [2022-04-15 18:16:23,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {8280#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8280#true} is VALID [2022-04-15 18:16:23,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {8280#true} ~skip~0 := 0; {8280#true} is VALID [2022-04-15 18:16:23,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {8280#true} assume !false; {8280#true} is VALID [2022-04-15 18:16:23,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {8280#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:16:23,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {8280#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:16:23,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {8280#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:16:23,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {8280#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:16:23,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {8280#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:16:23,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {8280#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:16:23,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {8280#true} assume 4368 == #t~mem54;havoc #t~mem54; {8280#true} is VALID [2022-04-15 18:16:23,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {8280#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {8280#true} is VALID [2022-04-15 18:16:23,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {8280#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !false; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,451 INFO L290 TraceCheckUtils]: 47: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,451 INFO L290 TraceCheckUtils]: 48: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,451 INFO L290 TraceCheckUtils]: 49: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,452 INFO L290 TraceCheckUtils]: 51: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,452 INFO L290 TraceCheckUtils]: 52: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume 4416 == #t~mem60;havoc #t~mem60; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:23,454 INFO L290 TraceCheckUtils]: 55: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {8281#false} is VALID [2022-04-15 18:16:23,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {8281#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {8281#false} assume !(0 == ~tmp___6~0); {8281#false} is VALID [2022-04-15 18:16:23,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {8281#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,454 INFO L290 TraceCheckUtils]: 59: Hoare triple {8281#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8281#false} is VALID [2022-04-15 18:16:23,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {8281#false} ~skip~0 := 0; {8281#false} is VALID [2022-04-15 18:16:23,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {8281#false} assume !false; {8281#false} is VALID [2022-04-15 18:16:23,455 INFO L290 TraceCheckUtils]: 62: Hoare triple {8281#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,455 INFO L290 TraceCheckUtils]: 63: Hoare triple {8281#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,455 INFO L290 TraceCheckUtils]: 64: Hoare triple {8281#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,455 INFO L290 TraceCheckUtils]: 65: Hoare triple {8281#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,455 INFO L290 TraceCheckUtils]: 66: Hoare triple {8281#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,455 INFO L290 TraceCheckUtils]: 67: Hoare triple {8281#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,455 INFO L290 TraceCheckUtils]: 68: Hoare triple {8281#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,455 INFO L290 TraceCheckUtils]: 69: Hoare triple {8281#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,455 INFO L290 TraceCheckUtils]: 70: Hoare triple {8281#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,455 INFO L290 TraceCheckUtils]: 71: Hoare triple {8281#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,456 INFO L290 TraceCheckUtils]: 72: Hoare triple {8281#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,456 INFO L290 TraceCheckUtils]: 73: Hoare triple {8281#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,456 INFO L290 TraceCheckUtils]: 74: Hoare triple {8281#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,456 INFO L290 TraceCheckUtils]: 75: Hoare triple {8281#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:16:23,456 INFO L290 TraceCheckUtils]: 76: Hoare triple {8281#false} assume 4432 == #t~mem62;havoc #t~mem62; {8281#false} is VALID [2022-04-15 18:16:23,456 INFO L290 TraceCheckUtils]: 77: Hoare triple {8281#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {8281#false} is VALID [2022-04-15 18:16:23,456 INFO L290 TraceCheckUtils]: 78: Hoare triple {8281#false} assume 4 == ~blastFlag~0; {8281#false} is VALID [2022-04-15 18:16:23,456 INFO L290 TraceCheckUtils]: 79: Hoare triple {8281#false} assume !false; {8281#false} is VALID [2022-04-15 18:16:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:16:23,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:23,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930125689] [2022-04-15 18:16:23,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930125689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:23,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:23,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:23,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:23,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1781434303] [2022-04-15 18:16:23,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1781434303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:23,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:23,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636743389] [2022-04-15 18:16:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:23,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 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 80 [2022-04-15 18:16:23,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:23,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 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-15 18:16:23,531 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-15 18:16:23,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:16:23,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:23,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:16:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:23,532 INFO L87 Difference]: Start difference. First operand 320 states and 498 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 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-15 18:16:25,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:26,577 INFO L93 Difference]: Finished difference Result 623 states and 981 transitions. [2022-04-15 18:16:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:16:26,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 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 80 [2022-04-15 18:16:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 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-15 18:16:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-15 18:16:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 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-15 18:16:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-15 18:16:26,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 486 transitions. [2022-04-15 18:16:26,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:26,913 INFO L225 Difference]: With dead ends: 623 [2022-04-15 18:16:26,913 INFO L226 Difference]: Without dead ends: 469 [2022-04-15 18:16:26,913 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:26,914 INFO L913 BasicCegarLoop]: 308 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:26,914 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 470 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 332 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 18:16:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-15 18:16:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2022-04-15 18:16:26,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:26,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 469 states. Second operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:26,935 INFO L74 IsIncluded]: Start isIncluded. First operand 469 states. Second operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:26,936 INFO L87 Difference]: Start difference. First operand 469 states. Second operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:26,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:26,949 INFO L93 Difference]: Finished difference Result 469 states and 731 transitions. [2022-04-15 18:16:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-15 18:16:26,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:26,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:26,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 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 469 states. [2022-04-15 18:16:26,952 INFO L87 Difference]: Start difference. First operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 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 469 states. [2022-04-15 18:16:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:26,965 INFO L93 Difference]: Finished difference Result 469 states and 731 transitions. [2022-04-15 18:16:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-15 18:16:26,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:26,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:26,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:26,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 731 transitions. [2022-04-15 18:16:26,981 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 731 transitions. Word has length 80 [2022-04-15 18:16:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:26,981 INFO L478 AbstractCegarLoop]: Abstraction has 469 states and 731 transitions. [2022-04-15 18:16:26,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 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-15 18:16:26,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 469 states and 731 transitions. [2022-04-15 18:16:27,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 731 edges. 731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-15 18:16:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 18:16:27,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:27,575 INFO L499 BasicCegarLoop]: 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] [2022-04-15 18:16:27,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 18:16:27,576 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1829686905, now seen corresponding path program 1 times [2022-04-15 18:16:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:27,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1808372662] [2022-04-15 18:16:27,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1829686905, now seen corresponding path program 2 times [2022-04-15 18:16:27,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:27,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239345566] [2022-04-15 18:16:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:27,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:27,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:27,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {11417#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11411#true} is VALID [2022-04-15 18:16:27,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {11411#true} assume true; {11411#true} is VALID [2022-04-15 18:16:27,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11411#true} {11411#true} #593#return; {11411#true} is VALID [2022-04-15 18:16:27,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {11411#true} call ULTIMATE.init(); {11417#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:27,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {11417#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11411#true} is VALID [2022-04-15 18:16:27,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {11411#true} assume true; {11411#true} is VALID [2022-04-15 18:16:27,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11411#true} {11411#true} #593#return; {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {11411#true} call #t~ret158 := main(); {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {11411#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L272 TraceCheckUtils]: 6: Hoare triple {11411#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {11411#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {11411#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {11411#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {11411#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {11411#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {11411#true} assume 12292 == #t~mem49;havoc #t~mem49; {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {11411#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {11411#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {11411#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {11411#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {11411#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {11411#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {11411#true} assume !(0 == ~tmp___4~0); {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {11411#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {11411#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {11411#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {11411#true} ~skip~0 := 0; {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {11411#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {11411#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {11411#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {11411#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {11411#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {11411#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {11411#true} assume 4368 == #t~mem54;havoc #t~mem54; {11411#true} is VALID [2022-04-15 18:16:27,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {11411#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {11411#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {11411#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {11411#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {11411#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {11411#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {11411#true} ~skip~0 := 0; {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {11411#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {11411#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {11411#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {11411#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {11411#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {11411#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {11411#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {11411#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:16:27,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {11411#true} assume 4384 == #t~mem56;havoc #t~mem56; {11411#true} is VALID [2022-04-15 18:16:27,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {11411#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11411#true} is VALID [2022-04-15 18:16:27,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {11411#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,811 INFO L290 TraceCheckUtils]: 52: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,812 INFO L290 TraceCheckUtils]: 55: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,813 INFO L290 TraceCheckUtils]: 57: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,813 INFO L290 TraceCheckUtils]: 58: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,813 INFO L290 TraceCheckUtils]: 59: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,813 INFO L290 TraceCheckUtils]: 60: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,814 INFO L290 TraceCheckUtils]: 61: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,814 INFO L290 TraceCheckUtils]: 62: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,814 INFO L290 TraceCheckUtils]: 63: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,814 INFO L290 TraceCheckUtils]: 64: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,815 INFO L290 TraceCheckUtils]: 66: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,815 INFO L290 TraceCheckUtils]: 67: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,816 INFO L290 TraceCheckUtils]: 68: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,816 INFO L290 TraceCheckUtils]: 69: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,816 INFO L290 TraceCheckUtils]: 70: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem60;havoc #t~mem60; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,817 INFO L290 TraceCheckUtils]: 72: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:27,817 INFO L290 TraceCheckUtils]: 73: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {11412#false} is VALID [2022-04-15 18:16:27,817 INFO L290 TraceCheckUtils]: 74: Hoare triple {11412#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,817 INFO L290 TraceCheckUtils]: 75: Hoare triple {11412#false} assume !(0 == ~tmp___6~0); {11412#false} is VALID [2022-04-15 18:16:27,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {11412#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,817 INFO L290 TraceCheckUtils]: 77: Hoare triple {11412#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11412#false} is VALID [2022-04-15 18:16:27,817 INFO L290 TraceCheckUtils]: 78: Hoare triple {11412#false} ~skip~0 := 0; {11412#false} is VALID [2022-04-15 18:16:27,817 INFO L290 TraceCheckUtils]: 79: Hoare triple {11412#false} assume !false; {11412#false} is VALID [2022-04-15 18:16:27,817 INFO L290 TraceCheckUtils]: 80: Hoare triple {11412#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,817 INFO L290 TraceCheckUtils]: 81: Hoare triple {11412#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 82: Hoare triple {11412#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 83: Hoare triple {11412#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 84: Hoare triple {11412#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 85: Hoare triple {11412#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 86: Hoare triple {11412#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 87: Hoare triple {11412#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 88: Hoare triple {11412#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 89: Hoare triple {11412#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 90: Hoare triple {11412#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 91: Hoare triple {11412#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 92: Hoare triple {11412#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 93: Hoare triple {11412#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 94: Hoare triple {11412#false} assume 4432 == #t~mem62;havoc #t~mem62; {11412#false} is VALID [2022-04-15 18:16:27,818 INFO L290 TraceCheckUtils]: 95: Hoare triple {11412#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11412#false} is VALID [2022-04-15 18:16:27,819 INFO L290 TraceCheckUtils]: 96: Hoare triple {11412#false} assume 4 == ~blastFlag~0; {11412#false} is VALID [2022-04-15 18:16:27,819 INFO L290 TraceCheckUtils]: 97: Hoare triple {11412#false} assume !false; {11412#false} is VALID [2022-04-15 18:16:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 18:16:27,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:27,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239345566] [2022-04-15 18:16:27,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239345566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:27,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:27,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:27,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:27,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1808372662] [2022-04-15 18:16:27,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1808372662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:27,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:27,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:27,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480665392] [2022-04-15 18:16:27,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:27,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 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 98 [2022-04-15 18:16:27,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:27,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:27,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:27,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:16:27,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:27,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:16:27,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:27,885 INFO L87 Difference]: Start difference. First operand 469 states and 731 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:29,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:30,944 INFO L93 Difference]: Finished difference Result 922 states and 1448 transitions. [2022-04-15 18:16:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:16:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 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 98 [2022-04-15 18:16:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 18:16:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 18:16:30,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 18:16:31,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:31,323 INFO L225 Difference]: With dead ends: 922 [2022-04-15 18:16:31,324 INFO L226 Difference]: Without dead ends: 619 [2022-04-15 18:16:31,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:31,325 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 127 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:31,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 477 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 18:16:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-15 18:16:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2022-04-15 18:16:31,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:31,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:31,343 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:31,344 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:31,357 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-15 18:16:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-15 18:16:31,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:31,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:31,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 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 619 states. [2022-04-15 18:16:31,360 INFO L87 Difference]: Start difference. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 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 619 states. [2022-04-15 18:16:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:31,373 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-15 18:16:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-15 18:16:31,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:31,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:31,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:31,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 966 transitions. [2022-04-15 18:16:31,392 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 966 transitions. Word has length 98 [2022-04-15 18:16:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:31,392 INFO L478 AbstractCegarLoop]: Abstraction has 619 states and 966 transitions. [2022-04-15 18:16:31,392 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:31,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 619 states and 966 transitions. [2022-04-15 18:16:32,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 966 edges. 966 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-15 18:16:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 18:16:32,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:32,114 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:32,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 18:16:32,114 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:32,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 1 times [2022-04-15 18:16:32,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:32,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [786657941] [2022-04-15 18:16:32,115 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:32,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 2 times [2022-04-15 18:16:32,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:32,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716022021] [2022-04-15 18:16:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:32,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:32,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:32,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {15747#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15740#true} is VALID [2022-04-15 18:16:32,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {15740#true} assume true; {15740#true} is VALID [2022-04-15 18:16:32,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15740#true} {15740#true} #593#return; {15740#true} is VALID [2022-04-15 18:16:32,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {15740#true} call ULTIMATE.init(); {15747#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:32,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {15747#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15740#true} is VALID [2022-04-15 18:16:32,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {15740#true} assume true; {15740#true} is VALID [2022-04-15 18:16:32,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15740#true} {15740#true} #593#return; {15740#true} is VALID [2022-04-15 18:16:32,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {15740#true} call #t~ret158 := main(); {15740#true} is VALID [2022-04-15 18:16:32,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {15740#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15740#true} is VALID [2022-04-15 18:16:32,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {15740#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15740#true} is VALID [2022-04-15 18:16:32,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {15740#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {15740#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {15740#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {15740#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {15740#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {15740#true} assume 12292 == #t~mem49;havoc #t~mem49; {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {15740#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {15740#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {15740#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {15740#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {15740#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {15740#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {15740#true} assume !(0 == ~tmp___4~0); {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {15740#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {15740#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {15740#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {15740#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {15740#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {15740#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {15740#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {15740#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {15740#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {15740#true} assume 4368 == #t~mem54;havoc #t~mem54; {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {15740#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {15740#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {15740#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {15740#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {15740#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {15740#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15740#true} is VALID [2022-04-15 18:16:32,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-15 18:16:32,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {15740#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {15740#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {15740#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {15740#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {15740#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {15740#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {15740#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {15740#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {15740#true} assume 4384 == #t~mem56;havoc #t~mem56; {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 50: Hoare triple {15740#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {15740#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15740#true} is VALID [2022-04-15 18:16:32,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {15740#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:16:32,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {15740#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,331 INFO L290 TraceCheckUtils]: 55: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,331 INFO L290 TraceCheckUtils]: 56: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,332 INFO L290 TraceCheckUtils]: 57: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,332 INFO L290 TraceCheckUtils]: 58: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,332 INFO L290 TraceCheckUtils]: 59: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,333 INFO L290 TraceCheckUtils]: 60: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,333 INFO L290 TraceCheckUtils]: 61: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,333 INFO L290 TraceCheckUtils]: 62: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,333 INFO L290 TraceCheckUtils]: 63: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,334 INFO L290 TraceCheckUtils]: 64: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,334 INFO L290 TraceCheckUtils]: 65: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,334 INFO L290 TraceCheckUtils]: 66: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,335 INFO L290 TraceCheckUtils]: 67: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:32,335 INFO L290 TraceCheckUtils]: 68: Hoare triple {15745#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15746#(not (= |ssl3_connect_#t~mem58| 4400))} is VALID [2022-04-15 18:16:32,335 INFO L290 TraceCheckUtils]: 69: Hoare triple {15746#(not (= |ssl3_connect_#t~mem58| 4400))} assume 4400 == #t~mem58;havoc #t~mem58; {15741#false} is VALID [2022-04-15 18:16:32,335 INFO L290 TraceCheckUtils]: 70: Hoare triple {15741#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {15741#false} is VALID [2022-04-15 18:16:32,335 INFO L290 TraceCheckUtils]: 71: Hoare triple {15741#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 72: Hoare triple {15741#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 73: Hoare triple {15741#false} assume !(~ret~0 <= 0); {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 74: Hoare triple {15741#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 75: Hoare triple {15741#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 76: Hoare triple {15741#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 77: Hoare triple {15741#false} ~skip~0 := 0; {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 78: Hoare triple {15741#false} assume !false; {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 79: Hoare triple {15741#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 80: Hoare triple {15741#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 81: Hoare triple {15741#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 82: Hoare triple {15741#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 83: Hoare triple {15741#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 84: Hoare triple {15741#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,336 INFO L290 TraceCheckUtils]: 85: Hoare triple {15741#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,337 INFO L290 TraceCheckUtils]: 86: Hoare triple {15741#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 87: Hoare triple {15741#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 88: Hoare triple {15741#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 89: Hoare triple {15741#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 90: Hoare triple {15741#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 91: Hoare triple {15741#false} assume 4416 == #t~mem60;havoc #t~mem60; {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 92: Hoare triple {15741#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 93: Hoare triple {15741#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 94: Hoare triple {15741#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 95: Hoare triple {15741#false} assume !(0 == ~tmp___6~0); {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 96: Hoare triple {15741#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 97: Hoare triple {15741#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 98: Hoare triple {15741#false} ~skip~0 := 0; {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 99: Hoare triple {15741#false} assume !false; {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 100: Hoare triple {15741#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 101: Hoare triple {15741#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,338 INFO L290 TraceCheckUtils]: 102: Hoare triple {15741#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,339 INFO L290 TraceCheckUtils]: 103: Hoare triple {15741#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,339 INFO L290 TraceCheckUtils]: 104: Hoare triple {15741#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,339 INFO L290 TraceCheckUtils]: 105: Hoare triple {15741#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,339 INFO L290 TraceCheckUtils]: 106: Hoare triple {15741#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,339 INFO L290 TraceCheckUtils]: 107: Hoare triple {15741#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,339 INFO L290 TraceCheckUtils]: 108: Hoare triple {15741#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,339 INFO L290 TraceCheckUtils]: 109: Hoare triple {15741#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,340 INFO L290 TraceCheckUtils]: 110: Hoare triple {15741#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,342 INFO L290 TraceCheckUtils]: 111: Hoare triple {15741#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,342 INFO L290 TraceCheckUtils]: 112: Hoare triple {15741#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,342 INFO L290 TraceCheckUtils]: 113: Hoare triple {15741#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {15741#false} is VALID [2022-04-15 18:16:32,342 INFO L290 TraceCheckUtils]: 114: Hoare triple {15741#false} assume 4432 == #t~mem62;havoc #t~mem62; {15741#false} is VALID [2022-04-15 18:16:32,342 INFO L290 TraceCheckUtils]: 115: Hoare triple {15741#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15741#false} is VALID [2022-04-15 18:16:32,342 INFO L290 TraceCheckUtils]: 116: Hoare triple {15741#false} assume 4 == ~blastFlag~0; {15741#false} is VALID [2022-04-15 18:16:32,342 INFO L290 TraceCheckUtils]: 117: Hoare triple {15741#false} assume !false; {15741#false} is VALID [2022-04-15 18:16:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-15 18:16:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:32,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716022021] [2022-04-15 18:16:32,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716022021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:32,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:32,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:32,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:32,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [786657941] [2022-04-15 18:16:32,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [786657941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:32,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:32,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:32,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704671468] [2022-04-15 18:16:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:32,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 18:16:32,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:32,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:32,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:32,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:16:32,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:32,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:16:32,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:16:32,409 INFO L87 Difference]: Start difference. First operand 619 states and 966 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:34,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:35,625 INFO L93 Difference]: Finished difference Result 1561 states and 2405 transitions. [2022-04-15 18:16:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:16:35,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 18:16:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:16:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:16:35,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 18:16:36,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:36,082 INFO L225 Difference]: With dead ends: 1561 [2022-04-15 18:16:36,083 INFO L226 Difference]: Without dead ends: 958 [2022-04-15 18:16:36,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:16:36,085 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 111 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 280 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-15 18:16:36,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 280 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:16:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-04-15 18:16:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 682. [2022-04-15 18:16:36,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:36,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 958 states. Second operand has 682 states, 677 states have (on average 1.568685376661743) internal successors, (1062), 677 states have internal predecessors, (1062), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:36,118 INFO L74 IsIncluded]: Start isIncluded. First operand 958 states. Second operand has 682 states, 677 states have (on average 1.568685376661743) internal successors, (1062), 677 states have internal predecessors, (1062), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:36,119 INFO L87 Difference]: Start difference. First operand 958 states. Second operand has 682 states, 677 states have (on average 1.568685376661743) internal successors, (1062), 677 states have internal predecessors, (1062), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:36,160 INFO L93 Difference]: Finished difference Result 958 states and 1451 transitions. [2022-04-15 18:16:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1451 transitions. [2022-04-15 18:16:36,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:36,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:36,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 682 states, 677 states have (on average 1.568685376661743) internal successors, (1062), 677 states have internal predecessors, (1062), 3 states have call successors, (3), 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 958 states. [2022-04-15 18:16:36,166 INFO L87 Difference]: Start difference. First operand has 682 states, 677 states have (on average 1.568685376661743) internal successors, (1062), 677 states have internal predecessors, (1062), 3 states have call successors, (3), 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 958 states. [2022-04-15 18:16:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:36,207 INFO L93 Difference]: Finished difference Result 958 states and 1451 transitions. [2022-04-15 18:16:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1451 transitions. [2022-04-15 18:16:36,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:36,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:36,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:36,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 677 states have (on average 1.568685376661743) internal successors, (1062), 677 states have internal predecessors, (1062), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1066 transitions. [2022-04-15 18:16:36,254 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1066 transitions. Word has length 118 [2022-04-15 18:16:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:36,254 INFO L478 AbstractCegarLoop]: Abstraction has 682 states and 1066 transitions. [2022-04-15 18:16:36,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:36,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 682 states and 1066 transitions. [2022-04-15 18:16:37,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1066 edges. 1066 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1066 transitions. [2022-04-15 18:16:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 18:16:37,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:37,219 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:37,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 18:16:37,220 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:37,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash -577524775, now seen corresponding path program 1 times [2022-04-15 18:16:37,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:37,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1188230482] [2022-04-15 18:16:37,220 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:37,221 INFO L85 PathProgramCache]: Analyzing trace with hash -577524775, now seen corresponding path program 2 times [2022-04-15 18:16:37,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:37,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963934979] [2022-04-15 18:16:37,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:37,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 18:16:38,346 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 18:16:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 18:16:38,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 18:16:38,821 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 18:16:38,821 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 18:16:38,825 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 18:16:38,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 18:16:38,830 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 18:16:38,832 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 18:16:38,881 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 18:16:38,881 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 18:16:38,881 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 18:16:38,882 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1135-2 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1675-1 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 18:16:38,883 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1655 has no Hoare annotation [2022-04-15 18:16:38,884 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1659-2 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1261 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1266-2 has no Hoare annotation [2022-04-15 18:16:38,885 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-15 18:16:38,886 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1337-2 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1337-2 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1624-1 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-15 18:16:38,887 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1347-2 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1363-2 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1363-2 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1363 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1363 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-15 18:16:38,888 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-15 18:16:38,889 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-15 18:16:38,890 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-15 18:16:38,890 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-15 18:16:38,890 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-15 18:16:38,890 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-15 18:16:38,890 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-15 18:16:38,890 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-15 18:16:38,890 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-15 18:16:38,890 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-15 18:16:38,890 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-15 18:16:38,890 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-15 18:16:38,890 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-15 18:16:38,903 WARN L170 areAnnotationChecker]: L1453-2 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1512-1 has no Hoare annotation [2022-04-15 18:16:38,904 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1542-1 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1255 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1558-2 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1570-2 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-15 18:16:38,905 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-15 18:16:38,905 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-15 18:16:38,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:16:38 BoogieIcfgContainer [2022-04-15 18:16:38,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 18:16:38,908 INFO L158 Benchmark]: Toolchain (without parser) took 42615.79ms. Allocated memory was 191.9MB in the beginning and 231.7MB in the end (delta: 39.8MB). Free memory was 138.0MB in the beginning and 170.7MB in the end (delta: -32.7MB). Peak memory consumption was 115.3MB. Max. memory is 8.0GB. [2022-04-15 18:16:38,908 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 191.9MB. Free memory was 156.6MB in the beginning and 156.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 18:16:38,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.27ms. Allocated memory is still 191.9MB. Free memory was 137.7MB in the beginning and 144.9MB in the end (delta: -7.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 18:16:38,909 INFO L158 Benchmark]: Boogie Preprocessor took 113.27ms. Allocated memory is still 191.9MB. Free memory was 144.9MB in the beginning and 135.6MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 18:16:38,909 INFO L158 Benchmark]: RCFGBuilder took 2252.73ms. Allocated memory was 191.9MB in the beginning and 231.7MB in the end (delta: 39.8MB). Free memory was 135.6MB in the beginning and 137.9MB in the end (delta: -2.3MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. [2022-04-15 18:16:38,909 INFO L158 Benchmark]: TraceAbstraction took 39769.61ms. Allocated memory is still 231.7MB. Free memory was 137.4MB in the beginning and 170.7MB in the end (delta: -33.4MB). Peak memory consumption was 74.1MB. Max. memory is 8.0GB. [2022-04-15 18:16:38,910 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.13ms. Allocated memory is still 191.9MB. Free memory was 156.6MB in the beginning and 156.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 465.27ms. Allocated memory is still 191.9MB. Free memory was 137.7MB in the beginning and 144.9MB in the end (delta: -7.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 113.27ms. Allocated memory is still 191.9MB. Free memory was 144.9MB in the beginning and 135.6MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2252.73ms. Allocated memory was 191.9MB in the beginning and 231.7MB in the end (delta: 39.8MB). Free memory was 135.6MB in the beginning and 137.9MB in the end (delta: -2.3MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. * TraceAbstraction took 39769.61ms. Allocated memory is still 231.7MB. Free memory was 137.4MB in the beginning and 170.7MB in the end (delta: -33.4MB). Peak memory consumption was 74.1MB. 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: 1665]: 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 1356. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) [L1271] EXPR s->version [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 [L1321] COND FALSE !(ret <= 0) [L1326] s->state = 4384 [L1327] s->init_num = 0 [L1328] EXPR s->bbio [L1328] EXPR s->wbio [L1328] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND TRUE s->state == 4384 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 [L1342] COND FALSE !(ret <= 0) [L1347] s->hit [L1347] COND FALSE !(s->hit) [L1350] s->state = 4400 [L1352] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND TRUE s->state == 4400 [L1356] EXPR s->s3 [L1356] EXPR (s->s3)->tmp.new_cipher [L1356] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1356] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1359] ret = __VERIFIER_nondet_int() [L1360] COND TRUE blastFlag == 2 [L1361] blastFlag = 3 [L1369] COND FALSE !(ret <= 0) [L1375] s->state = 4416 [L1376] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 [L1393] COND FALSE !(! tmp___6) [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 [L1665] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.7s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 707 SdHoareTripleChecker+Valid, 21.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 707 mSDsluCounter, 2658 SdHoareTripleChecker+Invalid, 21.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1364 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2330 IncrementalHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 1294 mSDtfsCounter, 2330 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=682occurred in iteration=7, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 545 StatesRemovedByMinimization, 4 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-15 18:16:38,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...