/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-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 15:12:45,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 15:12:45,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 15:12:45,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 15:12:45,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 15:12:45,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 15:12:45,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 15:12:45,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 15:12:45,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 15:12:45,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 15:12:45,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 15:12:45,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 15:12:45,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 15:12:45,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 15:12:45,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 15:12:45,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 15:12:45,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 15:12:45,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 15:12:45,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 15:12:45,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 15:12:45,965 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 15:12:45,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 15:12:45,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 15:12:45,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 15:12:45,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 15:12:45,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 15:12:45,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 15:12:45,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 15:12:45,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 15:12:45,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 15:12:45,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 15:12:45,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 15:12:45,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 15:12:45,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 15:12:45,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 15:12:45,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 15:12:45,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 15:12:45,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 15:12:45,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 15:12:45,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 15:12:45,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 15:12:45,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 15:12:45,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 15:12:45,986 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 15:12:45,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 15:12:45,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 15:12:45,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 15:12:45,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 15:12:45,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 15:12:45,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 15:12:45,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 15:12:45,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 15:12:45,988 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 15:12:45,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 15:12:45,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 15:12:45,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 15:12:45,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 15:12:45,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 15:12:45,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:12:45,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 15:12:45,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 15:12:45,989 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 15:12:45,989 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 15:12:45,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 15:12:45,989 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 15:12:45,989 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-08 15:12:46,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 15:12:46,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 15:12:46,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 15:12:46,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 15:12:46,178 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 15:12:46,178 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-2.c [2022-04-08 15:12:46,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a2d116ce/0526808141764915a9377a61c98fdbda/FLAG0a5cf9e40 [2022-04-08 15:12:46,705 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 15:12:46,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c [2022-04-08 15:12:46,720 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a2d116ce/0526808141764915a9377a61c98fdbda/FLAG0a5cf9e40 [2022-04-08 15:12:46,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a2d116ce/0526808141764915a9377a61c98fdbda [2022-04-08 15:12:46,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 15:12:46,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 15:12:46,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 15:12:46,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 15:12:46,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 15:12:46,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:12:46" (1/1) ... [2022-04-08 15:12:46,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3859974d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:12:46, skipping insertion in model container [2022-04-08 15:12:46,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:12:46" (1/1) ... [2022-04-08 15:12:46,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 15:12:46,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 15:12:47,068 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-2.c[65405,65418] [2022-04-08 15:12:47,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:12:47,091 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 15:12:47,179 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-2.c[65405,65418] [2022-04-08 15:12:47,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:12:47,197 INFO L208 MainTranslator]: Completed translation [2022-04-08 15:12:47,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:12:47 WrapperNode [2022-04-08 15:12:47,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 15:12:47,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 15:12:47,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 15:12:47,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 15:12:47,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:12:47" (1/1) ... [2022-04-08 15:12:47,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:12:47" (1/1) ... [2022-04-08 15:12:47,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:12:47" (1/1) ... [2022-04-08 15:12:47,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:12:47" (1/1) ... [2022-04-08 15:12:47,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:12:47" (1/1) ... [2022-04-08 15:12:47,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:12:47" (1/1) ... [2022-04-08 15:12:47,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:12:47" (1/1) ... [2022-04-08 15:12:47,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 15:12:47,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 15:12:47,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 15:12:47,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 15:12:47,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:12:47" (1/1) ... [2022-04-08 15:12:47,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:12:47,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 15:12:47,336 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-08 15:12:47,342 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-08 15:12:47,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 15:12:47,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 15:12:47,372 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 15:12:47,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-08 15:12:47,373 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-08 15:12:47,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 15:12:47,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-08 15:12:47,373 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 15:12:47,373 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 15:12:47,373 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 15:12:47,373 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 15:12:47,373 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 15:12:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 15:12:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 15:12:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 15:12:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 15:12:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 15:12:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 15:12:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 15:12:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 15:12:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-08 15:12:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 15:12:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-08 15:12:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-08 15:12:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 15:12:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 15:12:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 15:12:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 15:12:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 15:12:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 15:12:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 15:12:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 15:12:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 15:12:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 15:12:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 15:12:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 15:12:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 15:12:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 15:12:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 15:12:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 15:12:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 15:12:47,537 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 15:12:47,538 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 15:12:48,864 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:12:49,238 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-08 15:12:49,239 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-08 15:12:49,248 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 15:12:49,253 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 15:12:49,254 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 15:12:49,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:12:49 BoogieIcfgContainer [2022-04-08 15:12:49,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 15:12:49,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 15:12:49,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 15:12:49,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 15:12:49,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:12:46" (1/3) ... [2022-04-08 15:12:49,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebabd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:12:49, skipping insertion in model container [2022-04-08 15:12:49,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:12:47" (2/3) ... [2022-04-08 15:12:49,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebabd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:12:49, skipping insertion in model container [2022-04-08 15:12:49,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:12:49" (3/3) ... [2022-04-08 15:12:49,260 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-2.c [2022-04-08 15:12:49,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 15:12:49,263 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 15:12:49,288 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 15:12:49,292 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-08 15:12:49,292 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 15:12:49,309 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-08 15:12:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 15:12:49,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:12:49,314 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-08 15:12:49,315 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:12:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:12:49,318 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-08 15:12:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:12:49,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1991762863] [2022-04-08 15:12:49,329 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:12:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-08 15:12:49,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:12:49,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76966771] [2022-04-08 15:12:49,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:12:49,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:12:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:12:49,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:12:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:12:49,804 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-08 15:12:49,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-08 15:12:49,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-08 15:12:49,806 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-08 15:12:49,806 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-08 15:12:49,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-08 15:12:49,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-08 15:12:49,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-08 15:12:49,807 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-08 15:12:49,807 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-08 15:12:49,809 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-08 15:12:49,809 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-08 15:12:49,810 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-08 15:12:49,810 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-08 15:12:49,811 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-08 15:12:49,811 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-08 15:12:49,812 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-08 15:12:49,812 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-08 15:12:49,812 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-08 15:12:49,812 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-08 15:12:49,812 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-08 15:12:49,813 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-08 15:12:49,813 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-08 15:12:49,813 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-08 15:12:49,813 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-08 15:12:49,813 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-08 15:12:49,813 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-08 15:12:49,814 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-08 15:12:49,814 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-08 15:12:49,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-08 15:12:49,814 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-08 15:12:49,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-08 15:12:49,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-08 15:12:49,815 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-08 15:12:49,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:12:49,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76966771] [2022-04-08 15:12:49,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76966771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:12:49,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:12:49,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:12:49,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:12:49,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1991762863] [2022-04-08 15:12:49,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1991762863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:12:49,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:12:49,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:12:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429255521] [2022-04-08 15:12:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:12:49,822 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-08 15:12:49,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:12:49,825 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-08 15:12:49,853 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-08 15:12:49,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:12:49,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:12:49,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:12:49,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:12:49,870 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-08 15:12:54,824 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-08 15:12:56,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:58,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:59,850 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-08 15:12:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:12:59,850 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-08 15:12:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:12:59,851 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-08 15:12:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 15:12:59,861 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-08 15:12:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 15:12:59,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-08 15:13:00,153 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-08 15:13:00,168 INFO L225 Difference]: With dead ends: 267 [2022-04-08 15:13:00,169 INFO L226 Difference]: Without dead ends: 122 [2022-04-08 15:13:00,172 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-08 15:13:00,180 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:00,180 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.2s Time] [2022-04-08 15:13:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-08 15:13:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-08 15:13:00,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:00,207 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-08 15:13:00,208 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-08 15:13:00,209 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-08 15:13:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:00,213 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-08 15:13:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-08 15:13:00,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:00,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:00,214 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-08 15:13:00,215 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-08 15:13:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:00,220 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-08 15:13:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-08 15:13:00,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:00,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:00,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:00,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:00,221 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-08 15:13:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-08 15:13:00,226 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-08 15:13:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:00,226 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-08 15:13:00,227 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-08 15:13:00,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-08 15:13:00,366 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-08 15:13:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-08 15:13:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 15:13:00,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:00,368 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-08 15:13:00,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 15:13:00,368 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:00,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:00,369 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-08 15:13:00,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:00,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820979659] [2022-04-08 15:13:00,369 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-08 15:13:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:00,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602109118] [2022-04-08 15:13:00,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:00,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:00,536 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-08 15:13:00,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-08 15:13:00,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-08 15:13:00,537 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-08 15:13:00,537 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-08 15:13:00,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-08 15:13:00,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-08 15:13:00,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-08 15:13:00,538 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-08 15:13:00,538 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-08 15:13:00,538 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-08 15:13:00,539 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-08 15:13:00,540 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-08 15:13:00,540 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-08 15:13:00,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:13:00,541 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-08 15:13:00,541 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-08 15:13:00,543 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-08 15:13:00,544 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-08 15:13:00,547 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-08 15:13:00,548 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-08 15:13:00,548 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-08 15:13:00,548 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-08 15:13:00,549 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-08 15:13:00,549 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-08 15:13:00,549 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-08 15:13:00,550 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-08 15:13:00,550 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-08 15:13:00,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:13:00,551 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-08 15:13:00,551 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-08 15:13:00,551 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-08 15:13:00,552 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-08 15:13:00,552 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-08 15:13:00,552 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-08 15:13:00,553 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-08 15:13:00,553 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-08 15:13:00,553 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-08 15:13:00,554 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-08 15:13:00,554 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-08 15:13:00,554 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-08 15:13:00,554 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-08 15:13:00,555 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-08 15:13:00,555 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-08 15:13:00,555 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-08 15:13:00,556 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-08 15:13:00,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-08 15:13:00,556 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-08 15:13:00,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:00,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602109118] [2022-04-08 15:13:00,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602109118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:00,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:00,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:00,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:00,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820979659] [2022-04-08 15:13:00,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820979659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:00,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:00,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:00,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545774496] [2022-04-08 15:13:00,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:00,558 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-08 15:13:00,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:00,559 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-08 15:13:00,589 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-08 15:13:00,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:13:00,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:00,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:13:00,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:13:00,590 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-08 15:13:02,622 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-08 15:13:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:03,251 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-08 15:13:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:13:03,252 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-08 15:13:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:03,252 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-08 15:13:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 15:13:03,256 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-08 15:13:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 15:13:03,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-08 15:13:03,644 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-08 15:13:03,649 INFO L225 Difference]: With dead ends: 327 [2022-04-08 15:13:03,649 INFO L226 Difference]: Without dead ends: 222 [2022-04-08 15:13:03,650 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-08 15:13:03,650 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-08 15:13:03,651 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-08 15:13:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-08 15:13:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-08 15:13:03,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:03,674 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-08 15:13:03,674 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-08 15:13:03,675 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-08 15:13:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:03,684 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-08 15:13:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-08 15:13:03,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:03,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:03,691 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-08 15:13:03,692 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-08 15:13:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:03,704 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-08 15:13:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-08 15:13:03,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:03,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:03,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:03,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:03,706 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-08 15:13:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-08 15:13:03,713 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-08 15:13:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:03,713 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-08 15:13:03,714 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-08 15:13:03,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-08 15:13:03,947 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-08 15:13:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-08 15:13:03,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 15:13:03,949 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:03,950 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-08 15:13:03,950 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 15:13:03,950 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:03,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:03,951 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-08 15:13:03,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:03,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [124428471] [2022-04-08 15:13:03,952 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:03,952 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-08 15:13:03,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:03,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825143183] [2022-04-08 15:13:03,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:03,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:04,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:04,163 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-08 15:13:04,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-08 15:13:04,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-08 15:13:04,164 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-08 15:13:04,164 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-08 15:13:04,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-08 15:13:04,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-08 15:13:04,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-08 15:13:04,165 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-08 15:13:04,165 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-08 15:13:04,165 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-08 15:13:04,165 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-08 15:13:04,165 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-08 15:13:04,166 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-08 15:13:04,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-08 15:13:04,166 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-08 15:13:04,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-08 15:13:04,166 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-08 15:13:04,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {2724#true} is VALID [2022-04-08 15:13:04,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {2724#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2724#true} is VALID [2022-04-08 15:13:04,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2724#true} is VALID [2022-04-08 15:13:04,167 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-08 15:13:04,167 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-08 15:13:04,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-08 15:13:04,168 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-08 15:13:04,168 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-08 15:13:04,169 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-08 15:13:04,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-08 15:13:04,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-08 15:13:04,169 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-08 15:13:04,169 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-08 15:13:04,169 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-08 15:13:04,169 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-08 15:13:04,170 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-08 15:13:04,171 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-08 15:13:04,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-08 15:13:04,171 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-08 15:13:04,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-08 15:13:04,174 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-08 15:13:04,181 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-08 15:13:04,183 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-08 15:13:04,183 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-08 15:13:04,184 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-08 15:13:04,184 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-08 15:13:04,185 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-08 15:13:04,185 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-08 15:13:04,186 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-08 15:13:04,186 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-08 15:13:04,186 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-08 15:13:04,187 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-08 15:13:04,187 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-08 15:13:04,188 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-08 15:13:04,188 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-08 15:13:04,188 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-08 15:13:04,189 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-08 15:13:04,189 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-08 15:13:04,189 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-08 15:13:04,190 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-08 15:13:04,190 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-08 15:13:04,190 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-08 15:13:04,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 5 == ~blastFlag~0; {2725#false} is VALID [2022-04-08 15:13:04,191 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-08 15:13:04,195 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-08 15:13:04,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:04,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825143183] [2022-04-08 15:13:04,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825143183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:04,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:04,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:04,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:04,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [124428471] [2022-04-08 15:13:04,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [124428471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:04,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:04,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:04,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074194761] [2022-04-08 15:13:04,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:04,196 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-08 15:13:04,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:04,197 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-08 15:13:04,238 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-08 15:13:04,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:04,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:04,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:04,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:04,239 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-08 15:13:06,270 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-08 15:13:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:07,316 INFO L93 Difference]: Finished difference Result 611 states and 908 transitions. [2022-04-08 15:13:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:07,316 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-08 15:13:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:07,318 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-08 15:13:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:13:07,321 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-08 15:13:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:13:07,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 15:13:07,634 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-08 15:13:07,654 INFO L225 Difference]: With dead ends: 611 [2022-04-08 15:13:07,654 INFO L226 Difference]: Without dead ends: 405 [2022-04-08 15:13:07,655 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-08 15:13:07,655 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:07,656 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.4s Time] [2022-04-08 15:13:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-08 15:13:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 270. [2022-04-08 15:13:07,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:07,673 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-08 15:13:07,674 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-08 15:13:07,674 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-08 15:13:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:07,695 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-08 15:13:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-08 15:13:07,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:07,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:07,696 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-08 15:13:07,696 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-08 15:13:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:07,715 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-08 15:13:07,715 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-08 15:13:07,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:07,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:07,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:07,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:07,716 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-08 15:13:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 410 transitions. [2022-04-08 15:13:07,721 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 410 transitions. Word has length 59 [2022-04-08 15:13:07,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:07,721 INFO L478 AbstractCegarLoop]: Abstraction has 270 states and 410 transitions. [2022-04-08 15:13:07,721 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-08 15:13:07,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 270 states and 410 transitions. [2022-04-08 15:13:08,023 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-08 15:13:08,023 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 410 transitions. [2022-04-08 15:13:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 15:13:08,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:08,025 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-08 15:13:08,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 15:13:08,025 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:08,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:08,025 INFO L85 PathProgramCache]: Analyzing trace with hash -949350737, now seen corresponding path program 1 times [2022-04-08 15:13:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:08,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [457929197] [2022-04-08 15:13:08,026 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash -949350737, now seen corresponding path program 2 times [2022-04-08 15:13:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:08,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011415526] [2022-04-08 15:13:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:08,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:08,203 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-08 15:13:08,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {5308#true} assume true; {5308#true} is VALID [2022-04-08 15:13:08,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5308#true} {5308#true} #593#return; {5308#true} is VALID [2022-04-08 15:13:08,204 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-08 15:13:08,205 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-08 15:13:08,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {5308#true} assume true; {5308#true} is VALID [2022-04-08 15:13:08,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5308#true} {5308#true} #593#return; {5308#true} is VALID [2022-04-08 15:13:08,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {5308#true} call #t~ret158 := main(); {5308#true} is VALID [2022-04-08 15:13:08,205 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-08 15:13:08,205 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-08 15:13:08,205 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-08 15:13:08,205 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-08 15:13:08,205 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-08 15:13:08,205 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-08 15:13:08,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {5308#true} assume !false; {5308#true} is VALID [2022-04-08 15:13:08,206 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-08 15:13:08,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {5308#true} assume 12292 == #t~mem49;havoc #t~mem49; {5308#true} is VALID [2022-04-08 15:13:08,206 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-08 15:13:08,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {5308#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {5308#true} is VALID [2022-04-08 15:13:08,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {5308#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {5308#true} is VALID [2022-04-08 15:13:08,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {5308#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {5308#true} is VALID [2022-04-08 15:13:08,206 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-08 15:13:08,206 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-08 15:13:08,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {5308#true} assume !(0 == ~tmp___4~0); {5308#true} is VALID [2022-04-08 15:13:08,206 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-08 15:13:08,207 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-08 15:13:08,207 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-08 15:13:08,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {5308#true} ~skip~0 := 0; {5308#true} is VALID [2022-04-08 15:13:08,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {5308#true} assume !false; {5308#true} is VALID [2022-04-08 15:13:08,208 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-08 15:13:08,208 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-08 15:13:08,208 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-08 15:13:08,208 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-08 15:13:08,208 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-08 15:13:08,208 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-08 15:13:08,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {5308#true} assume 4368 == #t~mem54;havoc #t~mem54; {5308#true} is VALID [2022-04-08 15:13:08,208 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-08 15:13:08,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {5308#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5308#true} is VALID [2022-04-08 15:13:08,209 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-08 15:13:08,211 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-08 15:13:08,211 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-08 15:13:08,212 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-08 15:13:08,212 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-08 15:13:08,212 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-08 15:13:08,213 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-08 15:13:08,213 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-08 15:13:08,213 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-08 15:13:08,213 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-08 15:13:08,214 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-08 15:13:08,214 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-08 15:13:08,214 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-08 15:13:08,215 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-08 15:13:08,215 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-08 15:13:08,215 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-08 15:13:08,215 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-08 15:13:08,216 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-08 15:13:08,216 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-08 15:13:08,216 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-08 15:13:08,217 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-08 15:13:08,217 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-08 15:13:08,219 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-08 15:13:08,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {5309#false} assume 5 == ~blastFlag~0; {5309#false} is VALID [2022-04-08 15:13:08,219 INFO L290 TraceCheckUtils]: 59: Hoare triple {5309#false} assume !false; {5309#false} is VALID [2022-04-08 15:13:08,220 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-08 15:13:08,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:08,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011415526] [2022-04-08 15:13:08,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011415526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:08,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:08,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:08,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:08,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [457929197] [2022-04-08 15:13:08,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [457929197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:08,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:08,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:08,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222544024] [2022-04-08 15:13:08,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:08,221 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-08 15:13:08,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:08,223 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-08 15:13:08,262 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-08 15:13:08,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:08,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:08,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:08,263 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-08 15:13:12,818 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-08 15:13:14,846 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-08 15:13:16,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:13:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:17,803 INFO L93 Difference]: Finished difference Result 707 states and 1076 transitions. [2022-04-08 15:13:17,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:17,803 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-08 15:13:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:17,803 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-08 15:13:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:13:17,806 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-08 15:13:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:13:17,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 15:13:18,127 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-08 15:13:18,136 INFO L225 Difference]: With dead ends: 707 [2022-04-08 15:13:18,136 INFO L226 Difference]: Without dead ends: 453 [2022-04-08 15:13:18,137 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-08 15:13:18,138 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 46 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:18,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 278 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 383 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2022-04-08 15:13:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-08 15:13:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 320. [2022-04-08 15:13:18,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:18,150 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-08 15:13:18,150 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-08 15:13:18,151 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-08 15:13:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:18,159 INFO L93 Difference]: Finished difference Result 453 states and 684 transitions. [2022-04-08 15:13:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 684 transitions. [2022-04-08 15:13:18,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:18,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:18,160 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-08 15:13:18,161 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-08 15:13:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:18,170 INFO L93 Difference]: Finished difference Result 453 states and 684 transitions. [2022-04-08 15:13:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 684 transitions. [2022-04-08 15:13:18,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:18,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:18,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:18,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:18,171 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-08 15:13:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 498 transitions. [2022-04-08 15:13:18,194 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 498 transitions. Word has length 60 [2022-04-08 15:13:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:18,194 INFO L478 AbstractCegarLoop]: Abstraction has 320 states and 498 transitions. [2022-04-08 15:13:18,194 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-08 15:13:18,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 320 states and 498 transitions. [2022-04-08 15:13:18,562 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-08 15:13:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 498 transitions. [2022-04-08 15:13:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 15:13:18,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:18,563 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-08 15:13:18,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 15:13:18,564 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1308079053, now seen corresponding path program 1 times [2022-04-08 15:13:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:18,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1315874579] [2022-04-08 15:13:18,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:18,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1308079053, now seen corresponding path program 2 times [2022-04-08 15:13:18,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:18,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737492817] [2022-04-08 15:13:18,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:18,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:18,733 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-08 15:13:18,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {8280#true} assume true; {8280#true} is VALID [2022-04-08 15:13:18,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8280#true} {8280#true} #593#return; {8280#true} is VALID [2022-04-08 15:13:18,734 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-08 15:13:18,734 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-08 15:13:18,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {8280#true} assume true; {8280#true} is VALID [2022-04-08 15:13:18,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8280#true} {8280#true} #593#return; {8280#true} is VALID [2022-04-08 15:13:18,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {8280#true} call #t~ret158 := main(); {8280#true} is VALID [2022-04-08 15:13:18,735 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-08 15:13:18,735 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-08 15:13:18,735 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-08 15:13:18,735 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-08 15:13:18,735 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-08 15:13:18,735 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-08 15:13:18,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {8280#true} assume !false; {8280#true} is VALID [2022-04-08 15:13:18,735 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-08 15:13:18,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {8280#true} assume 12292 == #t~mem49;havoc #t~mem49; {8280#true} is VALID [2022-04-08 15:13:18,735 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-08 15:13:18,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {8280#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {8280#true} is VALID [2022-04-08 15:13:18,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {8280#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8280#true} is VALID [2022-04-08 15:13:18,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {8280#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {8280#true} is VALID [2022-04-08 15:13:18,736 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-08 15:13:18,736 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-08 15:13:18,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {8280#true} assume !(0 == ~tmp___4~0); {8280#true} is VALID [2022-04-08 15:13:18,736 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-08 15:13:18,736 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-08 15:13:18,736 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-08 15:13:18,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {8280#true} ~skip~0 := 0; {8280#true} is VALID [2022-04-08 15:13:18,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {8280#true} assume !false; {8280#true} is VALID [2022-04-08 15:13:18,737 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-08 15:13:18,737 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-08 15:13:18,737 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-08 15:13:18,737 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-08 15:13:18,737 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-08 15:13:18,737 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-08 15:13:18,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {8280#true} assume 4368 == #t~mem54;havoc #t~mem54; {8280#true} is VALID [2022-04-08 15:13:18,737 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-08 15:13:18,743 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-08 15:13:18,743 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-08 15:13:18,744 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-08 15:13:18,745 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-08 15:13:18,748 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-08 15:13:18,749 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-08 15:13:18,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !false; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:13:18,749 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-08 15:13:18,750 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-08 15:13:18,750 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-08 15:13:18,751 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-08 15:13:18,751 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-08 15:13:18,752 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-08 15:13:18,754 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-08 15:13:18,754 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-08 15:13:18,754 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-08 15:13:18,755 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-08 15:13:18,755 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-08 15:13:18,755 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-08 15:13:18,756 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-08 15:13:18,756 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-08 15:13:18,756 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-08 15:13:18,756 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-08 15:13:18,756 INFO L290 TraceCheckUtils]: 57: Hoare triple {8281#false} assume !(0 == ~tmp___6~0); {8281#false} is VALID [2022-04-08 15:13:18,756 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-08 15:13:18,757 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-08 15:13:18,757 INFO L290 TraceCheckUtils]: 60: Hoare triple {8281#false} ~skip~0 := 0; {8281#false} is VALID [2022-04-08 15:13:18,757 INFO L290 TraceCheckUtils]: 61: Hoare triple {8281#false} assume !false; {8281#false} is VALID [2022-04-08 15:13:18,757 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-08 15:13:18,757 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-08 15:13:18,757 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-08 15:13:18,757 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-08 15:13:18,757 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-08 15:13:18,757 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-08 15:13:18,757 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-08 15:13:18,757 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-08 15:13:18,757 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-08 15:13:18,759 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-08 15:13:18,759 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-08 15:13:18,759 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-08 15:13:18,759 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-08 15:13:18,759 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-08 15:13:18,759 INFO L290 TraceCheckUtils]: 76: Hoare triple {8281#false} assume 4432 == #t~mem62;havoc #t~mem62; {8281#false} is VALID [2022-04-08 15:13:18,759 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-08 15:13:18,759 INFO L290 TraceCheckUtils]: 78: Hoare triple {8281#false} assume 5 == ~blastFlag~0; {8281#false} is VALID [2022-04-08 15:13:18,759 INFO L290 TraceCheckUtils]: 79: Hoare triple {8281#false} assume !false; {8281#false} is VALID [2022-04-08 15:13:18,761 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-08 15:13:18,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:18,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737492817] [2022-04-08 15:13:18,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737492817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:18,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:18,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:18,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:18,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1315874579] [2022-04-08 15:13:18,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1315874579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:18,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:18,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:18,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279505961] [2022-04-08 15:13:18,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:18,766 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-08 15:13:18,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:18,766 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-08 15:13:18,824 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-08 15:13:18,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:13:18,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:18,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:13:18,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:13:18,825 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-08 15:13:20,841 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-08 15:13:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:21,744 INFO L93 Difference]: Finished difference Result 623 states and 981 transitions. [2022-04-08 15:13:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:13:21,745 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-08 15:13:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:21,745 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-08 15:13:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-08 15:13:21,747 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-08 15:13:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-08 15:13:21,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 486 transitions. [2022-04-08 15:13:22,066 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-08 15:13:22,075 INFO L225 Difference]: With dead ends: 623 [2022-04-08 15:13:22,075 INFO L226 Difference]: Without dead ends: 469 [2022-04-08 15:13:22,076 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-08 15:13:22,076 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-08 15:13:22,077 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-08 15:13:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-08 15:13:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2022-04-08 15:13:22,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:22,091 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-08 15:13:22,091 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-08 15:13:22,092 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-08 15:13:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:22,107 INFO L93 Difference]: Finished difference Result 469 states and 731 transitions. [2022-04-08 15:13:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-08 15:13:22,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:22,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:22,108 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-08 15:13:22,109 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-08 15:13:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:22,118 INFO L93 Difference]: Finished difference Result 469 states and 731 transitions. [2022-04-08 15:13:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-08 15:13:22,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:22,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:22,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:22,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:22,119 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-08 15:13:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 731 transitions. [2022-04-08 15:13:22,145 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 731 transitions. Word has length 80 [2022-04-08 15:13:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:22,146 INFO L478 AbstractCegarLoop]: Abstraction has 469 states and 731 transitions. [2022-04-08 15:13:22,146 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-08 15:13:22,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 469 states and 731 transitions. [2022-04-08 15:13:22,703 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-08 15:13:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-08 15:13:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 15:13:22,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:22,705 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-08 15:13:22,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 15:13:22,706 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1829686905, now seen corresponding path program 1 times [2022-04-08 15:13:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:22,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837231397] [2022-04-08 15:13:22,707 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:22,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1829686905, now seen corresponding path program 2 times [2022-04-08 15:13:22,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:22,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373440010] [2022-04-08 15:13:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:22,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:22,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:22,871 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-08 15:13:22,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {11411#true} assume true; {11411#true} is VALID [2022-04-08 15:13:22,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11411#true} {11411#true} #593#return; {11411#true} is VALID [2022-04-08 15:13:22,872 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-08 15:13:22,872 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-08 15:13:22,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {11411#true} assume true; {11411#true} is VALID [2022-04-08 15:13:22,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11411#true} {11411#true} #593#return; {11411#true} is VALID [2022-04-08 15:13:22,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {11411#true} call #t~ret158 := main(); {11411#true} is VALID [2022-04-08 15:13:22,872 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-08 15:13:22,872 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-08 15:13:22,873 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-08 15:13:22,873 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-08 15:13:22,873 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-08 15:13:22,873 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-08 15:13:22,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-08 15:13:22,873 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-08 15:13:22,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {11411#true} assume 12292 == #t~mem49;havoc #t~mem49; {11411#true} is VALID [2022-04-08 15:13:22,874 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-08 15:13:22,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {11411#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {11411#true} is VALID [2022-04-08 15:13:22,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {11411#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11411#true} is VALID [2022-04-08 15:13:22,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {11411#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11411#true} is VALID [2022-04-08 15:13:22,874 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-08 15:13:22,874 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-08 15:13:22,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {11411#true} assume !(0 == ~tmp___4~0); {11411#true} is VALID [2022-04-08 15:13:22,874 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-08 15:13:22,874 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-08 15:13:22,875 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-08 15:13:22,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {11411#true} ~skip~0 := 0; {11411#true} is VALID [2022-04-08 15:13:22,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-08 15:13:22,875 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-08 15:13:22,875 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-08 15:13:22,875 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-08 15:13:22,875 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-08 15:13:22,875 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-08 15:13:22,875 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-08 15:13:22,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {11411#true} assume 4368 == #t~mem54;havoc #t~mem54; {11411#true} is VALID [2022-04-08 15:13:22,875 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-08 15:13:22,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {11411#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11411#true} is VALID [2022-04-08 15:13:22,875 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-08 15:13:22,876 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-08 15:13:22,876 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-08 15:13:22,876 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-08 15:13:22,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {11411#true} ~skip~0 := 0; {11411#true} is VALID [2022-04-08 15:13:22,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-08 15:13:22,876 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-08 15:13:22,876 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-08 15:13:22,876 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-08 15:13:22,876 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-08 15:13:22,876 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-08 15:13:22,876 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-08 15:13:22,880 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-08 15:13:22,880 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-08 15:13:22,880 INFO L290 TraceCheckUtils]: 49: Hoare triple {11411#true} assume 4384 == #t~mem56;havoc #t~mem56; {11411#true} is VALID [2022-04-08 15:13:22,880 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-08 15:13:22,881 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-08 15:13:22,882 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-08 15:13:22,882 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-08 15:13:22,882 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-08 15:13:22,882 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-08 15:13:22,883 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-08 15:13:22,883 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-08 15:13:22,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:22,883 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-08 15:13:22,884 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-08 15:13:22,884 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-08 15:13:22,884 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-08 15:13:22,884 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-08 15:13:22,885 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-08 15:13:22,885 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-08 15:13:22,885 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-08 15:13:22,885 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-08 15:13:22,886 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-08 15:13:22,886 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-08 15:13:22,886 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-08 15:13:22,886 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-08 15:13:22,887 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-08 15:13:22,887 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-08 15:13:22,887 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-08 15:13:22,887 INFO L290 TraceCheckUtils]: 75: Hoare triple {11412#false} assume !(0 == ~tmp___6~0); {11412#false} is VALID [2022-04-08 15:13:22,887 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-08 15:13:22,887 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-08 15:13:22,888 INFO L290 TraceCheckUtils]: 78: Hoare triple {11412#false} ~skip~0 := 0; {11412#false} is VALID [2022-04-08 15:13:22,888 INFO L290 TraceCheckUtils]: 79: Hoare triple {11412#false} assume !false; {11412#false} is VALID [2022-04-08 15:13:22,889 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-08 15:13:22,889 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-08 15:13:22,890 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-08 15:13:22,891 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-08 15:13:22,891 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-08 15:13:22,891 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-08 15:13:22,891 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-08 15:13:22,891 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-08 15:13:22,891 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-08 15:13:22,891 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-08 15:13:22,892 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-08 15:13:22,892 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-08 15:13:22,892 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-08 15:13:22,892 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-08 15:13:22,892 INFO L290 TraceCheckUtils]: 94: Hoare triple {11412#false} assume 4432 == #t~mem62;havoc #t~mem62; {11412#false} is VALID [2022-04-08 15:13:22,892 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-08 15:13:22,892 INFO L290 TraceCheckUtils]: 96: Hoare triple {11412#false} assume 5 == ~blastFlag~0; {11412#false} is VALID [2022-04-08 15:13:22,892 INFO L290 TraceCheckUtils]: 97: Hoare triple {11412#false} assume !false; {11412#false} is VALID [2022-04-08 15:13:22,892 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-08 15:13:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:22,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373440010] [2022-04-08 15:13:22,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373440010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:22,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:22,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:22,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:22,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837231397] [2022-04-08 15:13:22,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837231397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:22,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:22,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:22,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867048706] [2022-04-08 15:13:22,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:22,894 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-08 15:13:22,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:22,894 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-08 15:13:22,967 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-08 15:13:22,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:13:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:22,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:13:22,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:13:22,968 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-08 15:13:24,985 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-08 15:13:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:25,952 INFO L93 Difference]: Finished difference Result 922 states and 1448 transitions. [2022-04-08 15:13:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:13:25,952 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-08 15:13:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:25,953 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-08 15:13:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 15:13:25,956 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-08 15:13:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 15:13:25,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-08 15:13:26,300 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-08 15:13:26,316 INFO L225 Difference]: With dead ends: 922 [2022-04-08 15:13:26,316 INFO L226 Difference]: Without dead ends: 619 [2022-04-08 15:13:26,316 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-08 15:13:26,317 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-08 15:13:26,317 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-08 15:13:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-08 15:13:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2022-04-08 15:13:26,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:26,332 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-08 15:13:26,332 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-08 15:13:26,333 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-08 15:13:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:26,346 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-08 15:13:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-08 15:13:26,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:26,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:26,348 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-08 15:13:26,348 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-08 15:13:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:26,361 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-08 15:13:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-08 15:13:26,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:26,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:26,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:26,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:26,363 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-08 15:13:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 966 transitions. [2022-04-08 15:13:26,379 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 966 transitions. Word has length 98 [2022-04-08 15:13:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:26,379 INFO L478 AbstractCegarLoop]: Abstraction has 619 states and 966 transitions. [2022-04-08 15:13:26,379 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-08 15:13:26,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 619 states and 966 transitions. [2022-04-08 15:13:27,076 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-08 15:13:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-08 15:13:27,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 15:13:27,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:27,077 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-08 15:13:27,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 15:13:27,077 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:27,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 1 times [2022-04-08 15:13:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:27,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1831373009] [2022-04-08 15:13:27,078 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 2 times [2022-04-08 15:13:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:27,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346182680] [2022-04-08 15:13:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:27,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {15746#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:13:27,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {15740#true} assume true; {15740#true} is VALID [2022-04-08 15:13:27,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15740#true} {15740#true} #593#return; {15740#true} is VALID [2022-04-08 15:13:27,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {15740#true} call ULTIMATE.init(); {15746#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:13:27,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {15746#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:13:27,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {15740#true} assume true; {15740#true} is VALID [2022-04-08 15:13:27,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15740#true} {15740#true} #593#return; {15740#true} is VALID [2022-04-08 15:13:27,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {15740#true} call #t~ret158 := main(); {15740#true} is VALID [2022-04-08 15:13:27,258 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-08 15:13:27,258 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-08 15:13:27,258 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-08 15:13:27,259 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-08 15:13:27,259 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-08 15:13:27,259 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-08 15:13:27,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-08 15:13:27,259 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-08 15:13:27,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {15740#true} assume 12292 == #t~mem49;havoc #t~mem49; {15740#true} is VALID [2022-04-08 15:13:27,259 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-08 15:13:27,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {15740#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {15740#true} is VALID [2022-04-08 15:13:27,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {15740#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {15740#true} is VALID [2022-04-08 15:13:27,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {15740#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15740#true} is VALID [2022-04-08 15:13:27,259 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-08 15:13:27,259 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-08 15:13:27,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {15740#true} assume !(0 == ~tmp___4~0); {15740#true} is VALID [2022-04-08 15:13:27,259 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-08 15:13:27,260 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-08 15:13:27,260 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-08 15:13:27,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-08 15:13:27,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-08 15:13:27,260 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-08 15:13:27,260 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-08 15:13:27,261 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-08 15:13:27,261 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-08 15:13:27,261 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-08 15:13:27,261 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-08 15:13:27,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {15740#true} assume 4368 == #t~mem54;havoc #t~mem54; {15740#true} is VALID [2022-04-08 15:13:27,261 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-08 15:13:27,261 INFO L290 TraceCheckUtils]: 34: Hoare triple {15740#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15740#true} is VALID [2022-04-08 15:13:27,261 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-08 15:13:27,261 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-08 15:13:27,261 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-08 15:13:27,261 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-08 15:13:27,261 INFO L290 TraceCheckUtils]: 39: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-08 15:13:27,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-08 15:13:27,261 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-08 15:13:27,262 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-08 15:13:27,262 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-08 15:13:27,262 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-08 15:13:27,262 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-08 15:13:27,262 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-08 15:13:27,262 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-08 15:13:27,262 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-08 15:13:27,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {15740#true} assume 4384 == #t~mem56;havoc #t~mem56; {15740#true} is VALID [2022-04-08 15:13:27,262 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-08 15:13:27,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {15740#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15740#true} is VALID [2022-04-08 15:13:27,262 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-08 15:13:27,262 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); {15740#true} is VALID [2022-04-08 15:13:27,262 INFO L290 TraceCheckUtils]: 54: Hoare triple {15740#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {15740#true} is VALID [2022-04-08 15:13:27,262 INFO L290 TraceCheckUtils]: 55: 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-08 15:13:27,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {15740#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15740#true} is VALID [2022-04-08 15:13:27,263 INFO L290 TraceCheckUtils]: 57: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-08 15:13:27,263 INFO L290 TraceCheckUtils]: 58: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-08 15:13:27,263 INFO L290 TraceCheckUtils]: 59: 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-08 15:13:27,263 INFO L290 TraceCheckUtils]: 60: 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-08 15:13:27,263 INFO L290 TraceCheckUtils]: 61: 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-08 15:13:27,263 INFO L290 TraceCheckUtils]: 62: 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-08 15:13:27,263 INFO L290 TraceCheckUtils]: 63: 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-08 15:13:27,263 INFO L290 TraceCheckUtils]: 64: 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-08 15:13:27,263 INFO L290 TraceCheckUtils]: 65: 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-08 15:13:27,263 INFO L290 TraceCheckUtils]: 66: 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-08 15:13:27,263 INFO L290 TraceCheckUtils]: 67: Hoare triple {15740#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-08 15:13:27,263 INFO L290 TraceCheckUtils]: 68: Hoare triple {15740#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-08 15:13:27,264 INFO L290 TraceCheckUtils]: 69: Hoare triple {15740#true} assume 4400 == #t~mem58;havoc #t~mem58; {15740#true} is VALID [2022-04-08 15:13:27,264 INFO L290 TraceCheckUtils]: 70: Hoare triple {15740#true} 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); {15740#true} is VALID [2022-04-08 15:13:27,264 INFO L290 TraceCheckUtils]: 71: Hoare triple {15740#true} 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; {15740#true} is VALID [2022-04-08 15:13:27,264 INFO L290 TraceCheckUtils]: 72: Hoare triple {15740#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {15740#true} is VALID [2022-04-08 15:13:27,264 INFO L290 TraceCheckUtils]: 73: Hoare triple {15740#true} assume !(~ret~0 <= 0); {15740#true} is VALID [2022-04-08 15:13:27,264 INFO L290 TraceCheckUtils]: 74: Hoare triple {15740#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {15740#true} is VALID [2022-04-08 15:13:27,264 INFO L290 TraceCheckUtils]: 75: 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-08 15:13:27,264 INFO L290 TraceCheckUtils]: 76: Hoare triple {15740#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15740#true} is VALID [2022-04-08 15:13:27,264 INFO L290 TraceCheckUtils]: 77: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-08 15:13:27,264 INFO L290 TraceCheckUtils]: 78: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-08 15:13:27,264 INFO L290 TraceCheckUtils]: 79: 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-08 15:13:27,264 INFO L290 TraceCheckUtils]: 80: 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-08 15:13:27,264 INFO L290 TraceCheckUtils]: 81: 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-08 15:13:27,264 INFO L290 TraceCheckUtils]: 82: 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-08 15:13:27,265 INFO L290 TraceCheckUtils]: 83: 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-08 15:13:27,265 INFO L290 TraceCheckUtils]: 84: 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-08 15:13:27,265 INFO L290 TraceCheckUtils]: 85: 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-08 15:13:27,266 INFO L290 TraceCheckUtils]: 86: 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-08 15:13:27,266 INFO L290 TraceCheckUtils]: 87: Hoare triple {15740#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-08 15:13:27,266 INFO L290 TraceCheckUtils]: 88: Hoare triple {15740#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-08 15:13:27,266 INFO L290 TraceCheckUtils]: 89: Hoare triple {15740#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-08 15:13:27,266 INFO L290 TraceCheckUtils]: 90: Hoare triple {15740#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-08 15:13:27,266 INFO L290 TraceCheckUtils]: 91: Hoare triple {15740#true} assume 4416 == #t~mem60;havoc #t~mem60; {15740#true} is VALID [2022-04-08 15:13:27,266 INFO L290 TraceCheckUtils]: 92: Hoare triple {15740#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {15740#true} is VALID [2022-04-08 15:13:27,266 INFO L290 TraceCheckUtils]: 93: Hoare triple {15740#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,267 INFO L290 TraceCheckUtils]: 94: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,267 INFO L290 TraceCheckUtils]: 95: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,267 INFO L290 TraceCheckUtils]: 96: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} 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#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,267 INFO L290 TraceCheckUtils]: 97: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,268 INFO L290 TraceCheckUtils]: 98: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,268 INFO L290 TraceCheckUtils]: 99: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !false; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,268 INFO L290 TraceCheckUtils]: 100: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} 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#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,268 INFO L290 TraceCheckUtils]: 101: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,268 INFO L290 TraceCheckUtils]: 102: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,269 INFO L290 TraceCheckUtils]: 103: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,269 INFO L290 TraceCheckUtils]: 104: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,269 INFO L290 TraceCheckUtils]: 105: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,269 INFO L290 TraceCheckUtils]: 106: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,270 INFO L290 TraceCheckUtils]: 107: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,270 INFO L290 TraceCheckUtils]: 108: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,270 INFO L290 TraceCheckUtils]: 109: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,270 INFO L290 TraceCheckUtils]: 110: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,271 INFO L290 TraceCheckUtils]: 111: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,271 INFO L290 TraceCheckUtils]: 112: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,271 INFO L290 TraceCheckUtils]: 113: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,272 INFO L290 TraceCheckUtils]: 114: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,272 INFO L290 TraceCheckUtils]: 115: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:13:27,272 INFO L290 TraceCheckUtils]: 116: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {15741#false} is VALID [2022-04-08 15:13:27,272 INFO L290 TraceCheckUtils]: 117: Hoare triple {15741#false} assume !false; {15741#false} is VALID [2022-04-08 15:13:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-08 15:13:27,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:27,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346182680] [2022-04-08 15:13:27,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346182680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:27,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:27,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:27,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:27,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1831373009] [2022-04-08 15:13:27,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1831373009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:27,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:27,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788367777] [2022-04-08 15:13:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:27,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-08 15:13:27,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:27,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:27,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:27,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:13:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:27,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:13:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:13:27,329 INFO L87 Difference]: Start difference. First operand 619 states and 966 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:29,349 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-08 15:13:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:30,308 INFO L93 Difference]: Finished difference Result 1223 states and 1920 transitions. [2022-04-08 15:13:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:13:30,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-08 15:13:30,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-08 15:13:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-08 15:13:30,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-08 15:13:30,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:30,664 INFO L225 Difference]: With dead ends: 1223 [2022-04-08 15:13:30,664 INFO L226 Difference]: Without dead ends: 770 [2022-04-08 15:13:30,665 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-08 15:13:30,666 INFO L913 BasicCegarLoop]: 316 mSDtfsCounter, 127 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:30,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 478 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:13:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-04-08 15:13:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-04-08 15:13:30,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:30,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 770 states. Second operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:30,684 INFO L74 IsIncluded]: Start isIncluded. First operand 770 states. Second operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:30,685 INFO L87 Difference]: Start difference. First operand 770 states. Second operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:30,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:30,705 INFO L93 Difference]: Finished difference Result 770 states and 1202 transitions. [2022-04-08 15:13:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1202 transitions. [2022-04-08 15:13:30,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:30,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:30,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 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 770 states. [2022-04-08 15:13:30,709 INFO L87 Difference]: Start difference. First operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 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 770 states. [2022-04-08 15:13:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:30,729 INFO L93 Difference]: Finished difference Result 770 states and 1202 transitions. [2022-04-08 15:13:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1202 transitions. [2022-04-08 15:13:30,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:30,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:30,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:30,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1202 transitions. [2022-04-08 15:13:30,755 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1202 transitions. Word has length 118 [2022-04-08 15:13:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:30,755 INFO L478 AbstractCegarLoop]: Abstraction has 770 states and 1202 transitions. [2022-04-08 15:13:30,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:30,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 770 states and 1202 transitions. [2022-04-08 15:13:31,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1202 edges. 1202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1202 transitions. [2022-04-08 15:13:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 15:13:31,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:31,605 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-08 15:13:31,605 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 15:13:31,605 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:31,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1249203673, now seen corresponding path program 1 times [2022-04-08 15:13:31,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:31,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [782747638] [2022-04-08 15:13:31,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1249203673, now seen corresponding path program 2 times [2022-04-08 15:13:31,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:31,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444962584] [2022-04-08 15:13:31,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:31,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:31,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {21281#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {21275#true} is VALID [2022-04-08 15:13:31,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {21275#true} assume true; {21275#true} is VALID [2022-04-08 15:13:31,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21275#true} {21275#true} #593#return; {21275#true} is VALID [2022-04-08 15:13:31,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {21275#true} call ULTIMATE.init(); {21281#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:13:31,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {21281#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {21275#true} is VALID [2022-04-08 15:13:31,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {21275#true} assume true; {21275#true} is VALID [2022-04-08 15:13:31,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21275#true} {21275#true} #593#return; {21275#true} is VALID [2022-04-08 15:13:31,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {21275#true} call #t~ret158 := main(); {21275#true} is VALID [2022-04-08 15:13:31,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {21275#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; {21275#true} is VALID [2022-04-08 15:13:31,759 INFO L272 TraceCheckUtils]: 6: Hoare triple {21275#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21275#true} is VALID [2022-04-08 15:13:31,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {21275#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); {21275#true} is VALID [2022-04-08 15:13:31,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {21275#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; {21275#true} is VALID [2022-04-08 15:13:31,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {21275#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; {21275#true} is VALID [2022-04-08 15:13:31,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {21275#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21275#true} is VALID [2022-04-08 15:13:31,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-08 15:13:31,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {21275#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); {21275#true} is VALID [2022-04-08 15:13:31,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {21275#true} assume 12292 == #t~mem49;havoc #t~mem49; {21275#true} is VALID [2022-04-08 15:13:31,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {21275#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; {21275#true} is VALID [2022-04-08 15:13:31,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {21275#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {21275#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21275#true} is VALID [2022-04-08 15:13:31,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {21275#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {21275#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); {21275#true} is VALID [2022-04-08 15:13:31,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {21275#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {21275#true} is VALID [2022-04-08 15:13:31,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {21275#true} assume !(0 == ~tmp___4~0); {21275#true} is VALID [2022-04-08 15:13:31,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {21275#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); {21275#true} is VALID [2022-04-08 15:13:31,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {21275#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); {21275#true} is VALID [2022-04-08 15:13:31,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {21275#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21275#true} is VALID [2022-04-08 15:13:31,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {21275#true} ~skip~0 := 0; {21275#true} is VALID [2022-04-08 15:13:31,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-08 15:13:31,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {21275#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); {21275#true} is VALID [2022-04-08 15:13:31,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {21275#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {21275#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {21275#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {21275#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {21275#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {21275#true} assume 4368 == #t~mem54;havoc #t~mem54; {21275#true} is VALID [2022-04-08 15:13:31,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {21275#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; {21275#true} is VALID [2022-04-08 15:13:31,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {21275#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21275#true} is VALID [2022-04-08 15:13:31,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {21275#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); {21275#true} is VALID [2022-04-08 15:13:31,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {21275#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; {21275#true} is VALID [2022-04-08 15:13:31,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {21275#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); {21275#true} is VALID [2022-04-08 15:13:31,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {21275#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21275#true} is VALID [2022-04-08 15:13:31,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {21275#true} ~skip~0 := 0; {21275#true} is VALID [2022-04-08 15:13:31,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-08 15:13:31,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {21275#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); {21275#true} is VALID [2022-04-08 15:13:31,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {21275#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {21275#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {21275#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {21275#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {21275#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {21275#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {21275#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {21275#true} assume 4384 == #t~mem56;havoc #t~mem56; {21275#true} is VALID [2022-04-08 15:13:31,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {21275#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21275#true} is VALID [2022-04-08 15:13:31,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {21275#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21275#true} is VALID [2022-04-08 15:13:31,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {21275#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {21275#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {21275#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {21275#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); {21275#true} is VALID [2022-04-08 15:13:31,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {21275#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21275#true} is VALID [2022-04-08 15:13:31,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {21275#true} ~skip~0 := 0; {21275#true} is VALID [2022-04-08 15:13:31,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-08 15:13:31,764 INFO L290 TraceCheckUtils]: 59: Hoare triple {21275#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); {21275#true} is VALID [2022-04-08 15:13:31,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {21275#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {21275#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,765 INFO L290 TraceCheckUtils]: 62: Hoare triple {21275#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {21275#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {21275#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {21275#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,765 INFO L290 TraceCheckUtils]: 66: Hoare triple {21275#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,765 INFO L290 TraceCheckUtils]: 67: Hoare triple {21275#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,765 INFO L290 TraceCheckUtils]: 68: Hoare triple {21275#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-08 15:13:31,765 INFO L290 TraceCheckUtils]: 69: Hoare triple {21275#true} assume 4400 == #t~mem58;havoc #t~mem58; {21275#true} is VALID [2022-04-08 15:13:31,765 INFO L290 TraceCheckUtils]: 70: Hoare triple {21275#true} 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); {21275#true} is VALID [2022-04-08 15:13:31,765 INFO L290 TraceCheckUtils]: 71: Hoare triple {21275#true} 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; {21275#true} is VALID [2022-04-08 15:13:31,766 INFO L290 TraceCheckUtils]: 72: Hoare triple {21275#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,766 INFO L290 TraceCheckUtils]: 73: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,766 INFO L290 TraceCheckUtils]: 74: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,767 INFO L290 TraceCheckUtils]: 75: Hoare triple {21280#(= 3 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); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,767 INFO L290 TraceCheckUtils]: 76: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,767 INFO L290 TraceCheckUtils]: 77: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,768 INFO L290 TraceCheckUtils]: 78: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,768 INFO L290 TraceCheckUtils]: 79: Hoare triple {21280#(= 3 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); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,768 INFO L290 TraceCheckUtils]: 80: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,768 INFO L290 TraceCheckUtils]: 81: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,769 INFO L290 TraceCheckUtils]: 82: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,769 INFO L290 TraceCheckUtils]: 83: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,769 INFO L290 TraceCheckUtils]: 84: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,770 INFO L290 TraceCheckUtils]: 85: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,770 INFO L290 TraceCheckUtils]: 86: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,770 INFO L290 TraceCheckUtils]: 87: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,770 INFO L290 TraceCheckUtils]: 88: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,771 INFO L290 TraceCheckUtils]: 89: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,771 INFO L290 TraceCheckUtils]: 90: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,771 INFO L290 TraceCheckUtils]: 91: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem60;havoc #t~mem60; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,772 INFO L290 TraceCheckUtils]: 92: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:13:31,772 INFO L290 TraceCheckUtils]: 93: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(3 == ~blastFlag~0); {21276#false} is VALID [2022-04-08 15:13:31,772 INFO L290 TraceCheckUtils]: 94: Hoare triple {21276#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); {21276#false} is VALID [2022-04-08 15:13:31,772 INFO L290 TraceCheckUtils]: 95: Hoare triple {21276#false} assume !(0 == ~tmp___6~0); {21276#false} is VALID [2022-04-08 15:13:31,772 INFO L290 TraceCheckUtils]: 96: Hoare triple {21276#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); {21276#false} is VALID [2022-04-08 15:13:31,772 INFO L290 TraceCheckUtils]: 97: Hoare triple {21276#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21276#false} is VALID [2022-04-08 15:13:31,772 INFO L290 TraceCheckUtils]: 98: Hoare triple {21276#false} ~skip~0 := 0; {21276#false} is VALID [2022-04-08 15:13:31,773 INFO L290 TraceCheckUtils]: 99: Hoare triple {21276#false} assume !false; {21276#false} is VALID [2022-04-08 15:13:31,773 INFO L290 TraceCheckUtils]: 100: Hoare triple {21276#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); {21276#false} is VALID [2022-04-08 15:13:31,773 INFO L290 TraceCheckUtils]: 101: Hoare triple {21276#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,773 INFO L290 TraceCheckUtils]: 102: Hoare triple {21276#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,773 INFO L290 TraceCheckUtils]: 103: Hoare triple {21276#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,773 INFO L290 TraceCheckUtils]: 104: Hoare triple {21276#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,773 INFO L290 TraceCheckUtils]: 105: Hoare triple {21276#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,773 INFO L290 TraceCheckUtils]: 106: Hoare triple {21276#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,773 INFO L290 TraceCheckUtils]: 107: Hoare triple {21276#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,774 INFO L290 TraceCheckUtils]: 108: Hoare triple {21276#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,774 INFO L290 TraceCheckUtils]: 109: Hoare triple {21276#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,774 INFO L290 TraceCheckUtils]: 110: Hoare triple {21276#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,774 INFO L290 TraceCheckUtils]: 111: Hoare triple {21276#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,774 INFO L290 TraceCheckUtils]: 112: Hoare triple {21276#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,774 INFO L290 TraceCheckUtils]: 113: Hoare triple {21276#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-08 15:13:31,774 INFO L290 TraceCheckUtils]: 114: Hoare triple {21276#false} assume 4432 == #t~mem62;havoc #t~mem62; {21276#false} is VALID [2022-04-08 15:13:31,774 INFO L290 TraceCheckUtils]: 115: Hoare triple {21276#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21276#false} is VALID [2022-04-08 15:13:31,774 INFO L290 TraceCheckUtils]: 116: Hoare triple {21276#false} assume 5 == ~blastFlag~0; {21276#false} is VALID [2022-04-08 15:13:31,775 INFO L290 TraceCheckUtils]: 117: Hoare triple {21276#false} assume !false; {21276#false} is VALID [2022-04-08 15:13:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 15:13:31,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:31,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444962584] [2022-04-08 15:13:31,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444962584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:31,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:31,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:31,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:31,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [782747638] [2022-04-08 15:13:31,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [782747638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:31,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:31,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:13:31,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568168844] [2022-04-08 15:13:31,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:31,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 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-08 15:13:31,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:31,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:31,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:31,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:13:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:31,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:13:31,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:13:31,846 INFO L87 Difference]: Start difference. First operand 770 states and 1202 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:33,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:13:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:34,922 INFO L93 Difference]: Finished difference Result 1500 states and 2348 transitions. [2022-04-08 15:13:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:13:34,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 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-08 15:13:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-08 15:13:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-08 15:13:34,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-08 15:13:35,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:35,269 INFO L225 Difference]: With dead ends: 1500 [2022-04-08 15:13:35,269 INFO L226 Difference]: Without dead ends: 896 [2022-04-08 15:13:35,269 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-08 15:13:35,270 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 128 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:35,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:13:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-04-08 15:13:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2022-04-08 15:13:35,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:35,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 896 states. Second operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:35,291 INFO L74 IsIncluded]: Start isIncluded. First operand 896 states. Second operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:35,292 INFO L87 Difference]: Start difference. First operand 896 states. Second operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:35,315 INFO L93 Difference]: Finished difference Result 896 states and 1394 transitions. [2022-04-08 15:13:35,315 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1394 transitions. [2022-04-08 15:13:35,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:35,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:35,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 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 896 states. [2022-04-08 15:13:35,319 INFO L87 Difference]: Start difference. First operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 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 896 states. [2022-04-08 15:13:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:35,342 INFO L93 Difference]: Finished difference Result 896 states and 1394 transitions. [2022-04-08 15:13:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1394 transitions. [2022-04-08 15:13:35,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:35,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:35,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:35,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1394 transitions. [2022-04-08 15:13:35,391 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1394 transitions. Word has length 118 [2022-04-08 15:13:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:35,391 INFO L478 AbstractCegarLoop]: Abstraction has 896 states and 1394 transitions. [2022-04-08 15:13:35,392 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:35,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 896 states and 1394 transitions. [2022-04-08 15:13:36,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1394 edges. 1394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1394 transitions. [2022-04-08 15:13:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-08 15:13:36,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:36,403 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:13:36,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 15:13:36,403 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:36,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash -154258084, now seen corresponding path program 1 times [2022-04-08 15:13:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:36,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [401391556] [2022-04-08 15:13:48,919 WARN L232 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:13:56,635 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:56,636 INFO L85 PathProgramCache]: Analyzing trace with hash -154258084, now seen corresponding path program 2 times [2022-04-08 15:13:56,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:56,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676157978] [2022-04-08 15:13:56,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:56,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:56,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {27875#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {27868#true} is VALID [2022-04-08 15:13:56,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {27868#true} assume true; {27868#true} is VALID [2022-04-08 15:13:56,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27868#true} {27868#true} #593#return; {27868#true} is VALID [2022-04-08 15:13:56,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {27868#true} call ULTIMATE.init(); {27875#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:13:56,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {27875#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {27868#true} is VALID [2022-04-08 15:13:56,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {27868#true} assume true; {27868#true} is VALID [2022-04-08 15:13:56,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27868#true} {27868#true} #593#return; {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {27868#true} call #t~ret158 := main(); {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {27868#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; {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {27868#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {27868#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); {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {27868#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; {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {27868#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; {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {27868#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {27868#true} assume !false; {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {27868#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); {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {27868#true} assume 12292 == #t~mem49;havoc #t~mem49; {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {27868#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; {27868#true} is VALID [2022-04-08 15:13:56,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {27868#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {27868#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {27868#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {27868#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); {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {27868#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {27868#true} assume !(0 == ~tmp___4~0); {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {27868#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); {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {27868#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); {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {27868#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {27868#true} ~skip~0 := 0; {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {27868#true} assume !false; {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {27868#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); {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {27868#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {27868#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {27868#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {27868#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {27868#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {27868#true} assume 4368 == #t~mem54;havoc #t~mem54; {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {27868#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; {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {27868#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {27868#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); {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {27868#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; {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {27868#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); {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {27868#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {27868#true} ~skip~0 := 0; {27868#true} is VALID [2022-04-08 15:13:56,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {27868#true} assume !false; {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {27868#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); {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {27868#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {27868#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {27868#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {27868#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {27868#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {27868#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {27868#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {27868#true} assume 4384 == #t~mem56;havoc #t~mem56; {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {27868#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {27868#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {27868#true} is VALID [2022-04-08 15:13:56,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {27868#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {27868#true} is VALID [2022-04-08 15:13:56,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {27868#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {27873#(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; {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,815 INFO L290 TraceCheckUtils]: 57: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,815 INFO L290 TraceCheckUtils]: 58: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,815 INFO L290 TraceCheckUtils]: 59: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,816 INFO L290 TraceCheckUtils]: 60: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,816 INFO L290 TraceCheckUtils]: 61: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,816 INFO L290 TraceCheckUtils]: 62: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,817 INFO L290 TraceCheckUtils]: 63: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,817 INFO L290 TraceCheckUtils]: 64: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,817 INFO L290 TraceCheckUtils]: 65: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,818 INFO L290 TraceCheckUtils]: 66: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,818 INFO L290 TraceCheckUtils]: 67: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:13:56,818 INFO L290 TraceCheckUtils]: 68: Hoare triple {27873#(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); {27874#(not (= |ssl3_connect_#t~mem58| 4400))} is VALID [2022-04-08 15:13:56,819 INFO L290 TraceCheckUtils]: 69: Hoare triple {27874#(not (= |ssl3_connect_#t~mem58| 4400))} assume 4400 == #t~mem58;havoc #t~mem58; {27869#false} is VALID [2022-04-08 15:13:56,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,819 INFO L290 TraceCheckUtils]: 71: Hoare triple {27869#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; {27869#false} is VALID [2022-04-08 15:13:56,819 INFO L290 TraceCheckUtils]: 72: Hoare triple {27869#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {27869#false} is VALID [2022-04-08 15:13:56,819 INFO L290 TraceCheckUtils]: 73: Hoare triple {27869#false} assume !(~ret~0 <= 0); {27869#false} is VALID [2022-04-08 15:13:56,819 INFO L290 TraceCheckUtils]: 74: Hoare triple {27869#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,819 INFO L290 TraceCheckUtils]: 75: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,819 INFO L290 TraceCheckUtils]: 76: Hoare triple {27869#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27869#false} is VALID [2022-04-08 15:13:56,819 INFO L290 TraceCheckUtils]: 77: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-08 15:13:56,819 INFO L290 TraceCheckUtils]: 78: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-08 15:13:56,819 INFO L290 TraceCheckUtils]: 79: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 80: Hoare triple {27869#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 81: Hoare triple {27869#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 82: Hoare triple {27869#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 83: Hoare triple {27869#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 84: Hoare triple {27869#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 85: Hoare triple {27869#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 86: Hoare triple {27869#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 87: Hoare triple {27869#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 88: Hoare triple {27869#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 89: Hoare triple {27869#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 90: Hoare triple {27869#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 91: Hoare triple {27869#false} assume 4416 == #t~mem60;havoc #t~mem60; {27869#false} is VALID [2022-04-08 15:13:56,820 INFO L290 TraceCheckUtils]: 92: Hoare triple {27869#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {27869#false} is VALID [2022-04-08 15:13:56,821 INFO L290 TraceCheckUtils]: 93: Hoare triple {27869#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {27869#false} is VALID [2022-04-08 15:13:56,821 INFO L290 TraceCheckUtils]: 94: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,821 INFO L290 TraceCheckUtils]: 95: Hoare triple {27869#false} assume !(0 == ~tmp___6~0); {27869#false} is VALID [2022-04-08 15:13:56,821 INFO L290 TraceCheckUtils]: 96: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,821 INFO L290 TraceCheckUtils]: 97: Hoare triple {27869#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27869#false} is VALID [2022-04-08 15:13:56,821 INFO L290 TraceCheckUtils]: 98: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-08 15:13:56,821 INFO L290 TraceCheckUtils]: 99: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-08 15:13:56,821 INFO L290 TraceCheckUtils]: 100: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,821 INFO L290 TraceCheckUtils]: 101: Hoare triple {27869#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,821 INFO L290 TraceCheckUtils]: 102: Hoare triple {27869#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,822 INFO L290 TraceCheckUtils]: 103: Hoare triple {27869#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,822 INFO L290 TraceCheckUtils]: 104: Hoare triple {27869#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,822 INFO L290 TraceCheckUtils]: 105: Hoare triple {27869#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,822 INFO L290 TraceCheckUtils]: 106: Hoare triple {27869#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,822 INFO L290 TraceCheckUtils]: 107: Hoare triple {27869#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,822 INFO L290 TraceCheckUtils]: 108: Hoare triple {27869#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,822 INFO L290 TraceCheckUtils]: 109: Hoare triple {27869#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,822 INFO L290 TraceCheckUtils]: 110: Hoare triple {27869#false} assume 4400 == #t~mem58;havoc #t~mem58; {27869#false} is VALID [2022-04-08 15:13:56,822 INFO L290 TraceCheckUtils]: 111: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,823 INFO L290 TraceCheckUtils]: 112: Hoare triple {27869#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; {27869#false} is VALID [2022-04-08 15:13:56,823 INFO L290 TraceCheckUtils]: 113: Hoare triple {27869#false} assume !(2 == ~blastFlag~0); {27869#false} is VALID [2022-04-08 15:13:56,823 INFO L290 TraceCheckUtils]: 114: Hoare triple {27869#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {27869#false} is VALID [2022-04-08 15:13:56,823 INFO L290 TraceCheckUtils]: 115: Hoare triple {27869#false} assume !(~ret~0 <= 0); {27869#false} is VALID [2022-04-08 15:13:56,823 INFO L290 TraceCheckUtils]: 116: Hoare triple {27869#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,823 INFO L290 TraceCheckUtils]: 117: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,823 INFO L290 TraceCheckUtils]: 118: Hoare triple {27869#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27869#false} is VALID [2022-04-08 15:13:56,824 INFO L290 TraceCheckUtils]: 119: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-08 15:13:56,824 INFO L290 TraceCheckUtils]: 120: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-08 15:13:56,824 INFO L290 TraceCheckUtils]: 121: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,824 INFO L290 TraceCheckUtils]: 122: Hoare triple {27869#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,824 INFO L290 TraceCheckUtils]: 123: Hoare triple {27869#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,824 INFO L290 TraceCheckUtils]: 124: Hoare triple {27869#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,824 INFO L290 TraceCheckUtils]: 125: Hoare triple {27869#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,824 INFO L290 TraceCheckUtils]: 126: Hoare triple {27869#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,825 INFO L290 TraceCheckUtils]: 127: Hoare triple {27869#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,825 INFO L290 TraceCheckUtils]: 128: Hoare triple {27869#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,825 INFO L290 TraceCheckUtils]: 129: Hoare triple {27869#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,825 INFO L290 TraceCheckUtils]: 130: Hoare triple {27869#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,825 INFO L290 TraceCheckUtils]: 131: Hoare triple {27869#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,825 INFO L290 TraceCheckUtils]: 132: Hoare triple {27869#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,825 INFO L290 TraceCheckUtils]: 133: Hoare triple {27869#false} assume 4416 == #t~mem60;havoc #t~mem60; {27869#false} is VALID [2022-04-08 15:13:56,825 INFO L290 TraceCheckUtils]: 134: Hoare triple {27869#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {27869#false} is VALID [2022-04-08 15:13:56,826 INFO L290 TraceCheckUtils]: 135: Hoare triple {27869#false} assume !(3 == ~blastFlag~0); {27869#false} is VALID [2022-04-08 15:13:56,826 INFO L290 TraceCheckUtils]: 136: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,826 INFO L290 TraceCheckUtils]: 137: Hoare triple {27869#false} assume !(0 == ~tmp___6~0); {27869#false} is VALID [2022-04-08 15:13:56,826 INFO L290 TraceCheckUtils]: 138: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,826 INFO L290 TraceCheckUtils]: 139: Hoare triple {27869#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27869#false} is VALID [2022-04-08 15:13:56,826 INFO L290 TraceCheckUtils]: 140: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-08 15:13:56,826 INFO L290 TraceCheckUtils]: 141: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-08 15:13:56,826 INFO L290 TraceCheckUtils]: 142: Hoare triple {27869#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); {27869#false} is VALID [2022-04-08 15:13:56,827 INFO L290 TraceCheckUtils]: 143: Hoare triple {27869#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,827 INFO L290 TraceCheckUtils]: 144: Hoare triple {27869#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,827 INFO L290 TraceCheckUtils]: 145: Hoare triple {27869#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,827 INFO L290 TraceCheckUtils]: 146: Hoare triple {27869#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,827 INFO L290 TraceCheckUtils]: 147: Hoare triple {27869#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,827 INFO L290 TraceCheckUtils]: 148: Hoare triple {27869#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,827 INFO L290 TraceCheckUtils]: 149: Hoare triple {27869#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,827 INFO L290 TraceCheckUtils]: 150: Hoare triple {27869#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,828 INFO L290 TraceCheckUtils]: 151: Hoare triple {27869#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,828 INFO L290 TraceCheckUtils]: 152: Hoare triple {27869#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,828 INFO L290 TraceCheckUtils]: 153: Hoare triple {27869#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,828 INFO L290 TraceCheckUtils]: 154: Hoare triple {27869#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,828 INFO L290 TraceCheckUtils]: 155: Hoare triple {27869#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-08 15:13:56,828 INFO L290 TraceCheckUtils]: 156: Hoare triple {27869#false} assume 4432 == #t~mem62;havoc #t~mem62; {27869#false} is VALID [2022-04-08 15:13:56,828 INFO L290 TraceCheckUtils]: 157: Hoare triple {27869#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {27869#false} is VALID [2022-04-08 15:13:56,828 INFO L290 TraceCheckUtils]: 158: Hoare triple {27869#false} assume 5 == ~blastFlag~0; {27869#false} is VALID [2022-04-08 15:13:56,829 INFO L290 TraceCheckUtils]: 159: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-08 15:13:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-04-08 15:13:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:56,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676157978] [2022-04-08 15:13:56,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676157978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:56,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:56,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:56,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:56,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [401391556] [2022-04-08 15:13:56,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [401391556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:56,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:56,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040364789] [2022-04-08 15:13:56,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:56,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 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 160 [2022-04-08 15:13:56,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:56,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:56,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:56,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:56,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:56,900 INFO L87 Difference]: Start difference. First operand 896 states and 1394 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:58,932 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-08 15:14:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:00,041 INFO L93 Difference]: Finished difference Result 2294 states and 3524 transitions. [2022-04-08 15:14:00,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:00,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 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 160 [2022-04-08 15:14:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:14:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:14:00,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 15:14:00,356 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-08 15:14:00,444 INFO L225 Difference]: With dead ends: 2294 [2022-04-08 15:14:00,444 INFO L226 Difference]: Without dead ends: 1414 [2022-04-08 15:14:00,446 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-08 15:14:00,446 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-08 15:14:00,446 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-08 15:14:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2022-04-08 15:14:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1001. [2022-04-08 15:14:00,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:00,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1414 states. Second operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:00,488 INFO L74 IsIncluded]: Start isIncluded. First operand 1414 states. Second operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:00,489 INFO L87 Difference]: Start difference. First operand 1414 states. Second operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:00,551 INFO L93 Difference]: Finished difference Result 1414 states and 2139 transitions. [2022-04-08 15:14:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2139 transitions. [2022-04-08 15:14:00,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:00,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:00,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 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 1414 states. [2022-04-08 15:14:00,555 INFO L87 Difference]: Start difference. First operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 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 1414 states. [2022-04-08 15:14:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:00,625 INFO L93 Difference]: Finished difference Result 1414 states and 2139 transitions. [2022-04-08 15:14:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2139 transitions. [2022-04-08 15:14:00,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:00,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:00,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:00,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1563 transitions. [2022-04-08 15:14:00,673 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1563 transitions. Word has length 160 [2022-04-08 15:14:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:00,673 INFO L478 AbstractCegarLoop]: Abstraction has 1001 states and 1563 transitions. [2022-04-08 15:14:00,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:00,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1001 states and 1563 transitions. [2022-04-08 15:14:01,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1563 edges. 1563 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1563 transitions. [2022-04-08 15:14:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-08 15:14:01,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:01,829 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:01,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 15:14:01,830 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1057182855, now seen corresponding path program 1 times [2022-04-08 15:14:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:01,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825160496] [2022-04-08 15:14:14,945 WARN L232 SmtUtils]: Spent 9.16s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:14:23,783 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1057182855, now seen corresponding path program 2 times [2022-04-08 15:14:23,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:23,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933789591] [2022-04-08 15:14:23,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:23,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {37305#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {37298#true} is VALID [2022-04-08 15:14:23,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {37298#true} assume true; {37298#true} is VALID [2022-04-08 15:14:23,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37298#true} {37298#true} #593#return; {37298#true} is VALID [2022-04-08 15:14:23,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {37298#true} call ULTIMATE.init(); {37305#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:14:23,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {37305#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {37298#true} is VALID [2022-04-08 15:14:23,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {37298#true} assume true; {37298#true} is VALID [2022-04-08 15:14:23,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37298#true} {37298#true} #593#return; {37298#true} is VALID [2022-04-08 15:14:23,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {37298#true} call #t~ret158 := main(); {37298#true} is VALID [2022-04-08 15:14:23,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {37298#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; {37298#true} is VALID [2022-04-08 15:14:23,960 INFO L272 TraceCheckUtils]: 6: Hoare triple {37298#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37298#true} is VALID [2022-04-08 15:14:23,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {37298#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; {37298#true} is VALID [2022-04-08 15:14:23,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {37298#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; {37298#true} is VALID [2022-04-08 15:14:23,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {37298#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37298#true} is VALID [2022-04-08 15:14:23,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-08 15:14:23,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {37298#true} assume 12292 == #t~mem49;havoc #t~mem49; {37298#true} is VALID [2022-04-08 15:14:23,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {37298#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; {37298#true} is VALID [2022-04-08 15:14:23,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {37298#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {37298#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {37298#true} is VALID [2022-04-08 15:14:23,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {37298#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {37298#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {37298#true} is VALID [2022-04-08 15:14:23,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {37298#true} assume !(0 == ~tmp___4~0); {37298#true} is VALID [2022-04-08 15:14:23,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {37298#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {37298#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {37298#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {37298#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {37298#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {37298#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {37298#true} assume 4368 == #t~mem54;havoc #t~mem54; {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {37298#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; {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {37298#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {37298#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; {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {37298#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {37298#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {37298#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {37298#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {37298#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {37298#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 47: Hoare triple {37298#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {37298#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {37298#true} assume 4384 == #t~mem56;havoc #t~mem56; {37298#true} is VALID [2022-04-08 15:14:23,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {37298#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {37298#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {37298#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {37298#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {37298#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {37298#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {37298#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {37298#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 62: Hoare triple {37298#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 63: Hoare triple {37298#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,978 INFO L290 TraceCheckUtils]: 64: Hoare triple {37298#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 65: Hoare triple {37298#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {37298#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 67: Hoare triple {37298#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {37298#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {37298#true} assume 4400 == #t~mem58;havoc #t~mem58; {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {37298#true} 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); {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 71: Hoare triple {37298#true} 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; {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 72: Hoare triple {37298#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 73: Hoare triple {37298#true} assume !(~ret~0 <= 0); {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 74: Hoare triple {37298#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 75: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 76: Hoare triple {37298#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 77: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-08 15:14:23,979 INFO L290 TraceCheckUtils]: 78: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 79: Hoare triple {37298#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); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 80: Hoare triple {37298#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 81: Hoare triple {37298#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 82: Hoare triple {37298#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 83: Hoare triple {37298#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 84: Hoare triple {37298#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 85: Hoare triple {37298#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 86: Hoare triple {37298#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 87: Hoare triple {37298#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 88: Hoare triple {37298#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 89: Hoare triple {37298#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 90: Hoare triple {37298#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 91: Hoare triple {37298#true} assume 4416 == #t~mem60;havoc #t~mem60; {37298#true} is VALID [2022-04-08 15:14:23,980 INFO L290 TraceCheckUtils]: 92: Hoare triple {37298#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37298#true} is VALID [2022-04-08 15:14:23,981 INFO L290 TraceCheckUtils]: 93: Hoare triple {37298#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37298#true} is VALID [2022-04-08 15:14:23,982 INFO L290 TraceCheckUtils]: 94: Hoare triple {37298#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,982 INFO L290 TraceCheckUtils]: 95: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,983 INFO L290 TraceCheckUtils]: 96: Hoare triple {37303#(not (= 4401 (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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,983 INFO L290 TraceCheckUtils]: 97: Hoare triple {37303#(not (= 4401 (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; {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,984 INFO L290 TraceCheckUtils]: 98: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,984 INFO L290 TraceCheckUtils]: 99: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,984 INFO L290 TraceCheckUtils]: 100: Hoare triple {37303#(not (= 4401 (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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,985 INFO L290 TraceCheckUtils]: 101: Hoare triple {37303#(not (= 4401 (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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,985 INFO L290 TraceCheckUtils]: 102: Hoare triple {37303#(not (= 4401 (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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,985 INFO L290 TraceCheckUtils]: 103: Hoare triple {37303#(not (= 4401 (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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,986 INFO L290 TraceCheckUtils]: 104: Hoare triple {37303#(not (= 4401 (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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,986 INFO L290 TraceCheckUtils]: 105: Hoare triple {37303#(not (= 4401 (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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,986 INFO L290 TraceCheckUtils]: 106: Hoare triple {37303#(not (= 4401 (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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,987 INFO L290 TraceCheckUtils]: 107: Hoare triple {37303#(not (= 4401 (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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,987 INFO L290 TraceCheckUtils]: 108: Hoare triple {37303#(not (= 4401 (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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,987 INFO L290 TraceCheckUtils]: 109: Hoare triple {37303#(not (= 4401 (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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:14:23,988 INFO L290 TraceCheckUtils]: 110: Hoare triple {37303#(not (= 4401 (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); {37304#(not (= |ssl3_connect_#t~mem59| 4401))} is VALID [2022-04-08 15:14:23,988 INFO L290 TraceCheckUtils]: 111: Hoare triple {37304#(not (= |ssl3_connect_#t~mem59| 4401))} assume 4401 == #t~mem59;havoc #t~mem59; {37299#false} is VALID [2022-04-08 15:14:23,988 INFO L290 TraceCheckUtils]: 112: Hoare triple {37299#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); {37299#false} is VALID [2022-04-08 15:14:23,988 INFO L290 TraceCheckUtils]: 113: Hoare triple {37299#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; {37299#false} is VALID [2022-04-08 15:14:23,988 INFO L290 TraceCheckUtils]: 114: Hoare triple {37299#false} assume !(2 == ~blastFlag~0); {37299#false} is VALID [2022-04-08 15:14:23,988 INFO L290 TraceCheckUtils]: 115: Hoare triple {37299#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {37299#false} is VALID [2022-04-08 15:14:23,988 INFO L290 TraceCheckUtils]: 116: Hoare triple {37299#false} assume !(~ret~0 <= 0); {37299#false} is VALID [2022-04-08 15:14:23,988 INFO L290 TraceCheckUtils]: 117: Hoare triple {37299#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,988 INFO L290 TraceCheckUtils]: 118: Hoare triple {37299#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); {37299#false} is VALID [2022-04-08 15:14:23,989 INFO L290 TraceCheckUtils]: 119: Hoare triple {37299#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37299#false} is VALID [2022-04-08 15:14:23,989 INFO L290 TraceCheckUtils]: 120: Hoare triple {37299#false} ~skip~0 := 0; {37299#false} is VALID [2022-04-08 15:14:23,989 INFO L290 TraceCheckUtils]: 121: Hoare triple {37299#false} assume !false; {37299#false} is VALID [2022-04-08 15:14:23,989 INFO L290 TraceCheckUtils]: 122: Hoare triple {37299#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); {37299#false} is VALID [2022-04-08 15:14:23,989 INFO L290 TraceCheckUtils]: 123: Hoare triple {37299#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,989 INFO L290 TraceCheckUtils]: 124: Hoare triple {37299#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,989 INFO L290 TraceCheckUtils]: 125: Hoare triple {37299#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,989 INFO L290 TraceCheckUtils]: 126: Hoare triple {37299#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,989 INFO L290 TraceCheckUtils]: 127: Hoare triple {37299#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,989 INFO L290 TraceCheckUtils]: 128: Hoare triple {37299#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,990 INFO L290 TraceCheckUtils]: 129: Hoare triple {37299#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,990 INFO L290 TraceCheckUtils]: 130: Hoare triple {37299#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,990 INFO L290 TraceCheckUtils]: 131: Hoare triple {37299#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,990 INFO L290 TraceCheckUtils]: 132: Hoare triple {37299#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,990 INFO L290 TraceCheckUtils]: 133: Hoare triple {37299#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,990 INFO L290 TraceCheckUtils]: 134: Hoare triple {37299#false} assume 4416 == #t~mem60;havoc #t~mem60; {37299#false} is VALID [2022-04-08 15:14:23,990 INFO L290 TraceCheckUtils]: 135: Hoare triple {37299#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37299#false} is VALID [2022-04-08 15:14:23,990 INFO L290 TraceCheckUtils]: 136: Hoare triple {37299#false} assume !(3 == ~blastFlag~0); {37299#false} is VALID [2022-04-08 15:14:23,990 INFO L290 TraceCheckUtils]: 137: Hoare triple {37299#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); {37299#false} is VALID [2022-04-08 15:14:23,990 INFO L290 TraceCheckUtils]: 138: Hoare triple {37299#false} assume !(0 == ~tmp___6~0); {37299#false} is VALID [2022-04-08 15:14:23,990 INFO L290 TraceCheckUtils]: 139: Hoare triple {37299#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); {37299#false} is VALID [2022-04-08 15:14:23,991 INFO L290 TraceCheckUtils]: 140: Hoare triple {37299#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37299#false} is VALID [2022-04-08 15:14:23,991 INFO L290 TraceCheckUtils]: 141: Hoare triple {37299#false} ~skip~0 := 0; {37299#false} is VALID [2022-04-08 15:14:23,991 INFO L290 TraceCheckUtils]: 142: Hoare triple {37299#false} assume !false; {37299#false} is VALID [2022-04-08 15:14:23,991 INFO L290 TraceCheckUtils]: 143: Hoare triple {37299#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); {37299#false} is VALID [2022-04-08 15:14:23,991 INFO L290 TraceCheckUtils]: 144: Hoare triple {37299#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,991 INFO L290 TraceCheckUtils]: 145: Hoare triple {37299#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,991 INFO L290 TraceCheckUtils]: 146: Hoare triple {37299#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,991 INFO L290 TraceCheckUtils]: 147: Hoare triple {37299#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,991 INFO L290 TraceCheckUtils]: 148: Hoare triple {37299#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,991 INFO L290 TraceCheckUtils]: 149: Hoare triple {37299#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,992 INFO L290 TraceCheckUtils]: 150: Hoare triple {37299#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,992 INFO L290 TraceCheckUtils]: 151: Hoare triple {37299#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,992 INFO L290 TraceCheckUtils]: 152: Hoare triple {37299#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,992 INFO L290 TraceCheckUtils]: 153: Hoare triple {37299#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,992 INFO L290 TraceCheckUtils]: 154: Hoare triple {37299#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,992 INFO L290 TraceCheckUtils]: 155: Hoare triple {37299#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,992 INFO L290 TraceCheckUtils]: 156: Hoare triple {37299#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-08 15:14:23,992 INFO L290 TraceCheckUtils]: 157: Hoare triple {37299#false} assume 4432 == #t~mem62;havoc #t~mem62; {37299#false} is VALID [2022-04-08 15:14:23,992 INFO L290 TraceCheckUtils]: 158: Hoare triple {37299#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {37299#false} is VALID [2022-04-08 15:14:23,992 INFO L290 TraceCheckUtils]: 159: Hoare triple {37299#false} assume 5 == ~blastFlag~0; {37299#false} is VALID [2022-04-08 15:14:23,993 INFO L290 TraceCheckUtils]: 160: Hoare triple {37299#false} assume !false; {37299#false} is VALID [2022-04-08 15:14:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-08 15:14:23,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:23,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933789591] [2022-04-08 15:14:23,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933789591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:23,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:23,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:23,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:23,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825160496] [2022-04-08 15:14:23,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825160496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:23,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:23,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:23,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761039667] [2022-04-08 15:14:23,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:23,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-08 15:14:23,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:23,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:24,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:24,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:24,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:24,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:24,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:24,080 INFO L87 Difference]: Start difference. First operand 1001 states and 1563 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:26,101 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-08 15:14:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:27,294 INFO L93 Difference]: Finished difference Result 2368 states and 3635 transitions. [2022-04-08 15:14:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:27,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-08 15:14:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 15:14:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 15:14:27,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-08 15:14:27,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:27,670 INFO L225 Difference]: With dead ends: 2368 [2022-04-08 15:14:27,671 INFO L226 Difference]: Without dead ends: 1383 [2022-04-08 15:14:27,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:14:27,672 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 109 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 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-08 15:14:27,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:14:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-04-08 15:14:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1001. [2022-04-08 15:14:27,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:27,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1383 states. Second operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,706 INFO L74 IsIncluded]: Start isIncluded. First operand 1383 states. Second operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,707 INFO L87 Difference]: Start difference. First operand 1383 states. Second operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:27,753 INFO L93 Difference]: Finished difference Result 1383 states and 2081 transitions. [2022-04-08 15:14:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2081 transitions. [2022-04-08 15:14:27,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:27,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:27,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1383 states. [2022-04-08 15:14:27,756 INFO L87 Difference]: Start difference. First operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1383 states. [2022-04-08 15:14:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:27,803 INFO L93 Difference]: Finished difference Result 1383 states and 2081 transitions. [2022-04-08 15:14:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2081 transitions. [2022-04-08 15:14:27,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:27,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:27,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:27,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1552 transitions. [2022-04-08 15:14:27,852 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1552 transitions. Word has length 161 [2022-04-08 15:14:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:27,852 INFO L478 AbstractCegarLoop]: Abstraction has 1001 states and 1552 transitions. [2022-04-08 15:14:27,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1001 states and 1552 transitions. [2022-04-08 15:14:29,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1552 edges. 1552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1552 transitions. [2022-04-08 15:14:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-08 15:14:29,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:29,040 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:14:29,040 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 15:14:29,040 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:29,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1464555500, now seen corresponding path program 1 times [2022-04-08 15:14:29,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:29,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [140436987] [2022-04-08 15:14:41,004 WARN L232 SmtUtils]: Spent 7.84s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:14:48,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:48,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1464555500, now seen corresponding path program 2 times [2022-04-08 15:14:48,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:48,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119314284] [2022-04-08 15:14:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:49,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {46821#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {46814#true} is VALID [2022-04-08 15:14:49,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {46814#true} assume true; {46814#true} is VALID [2022-04-08 15:14:49,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46814#true} {46814#true} #593#return; {46814#true} is VALID [2022-04-08 15:14:49,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {46814#true} call ULTIMATE.init(); {46821#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:14:49,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {46821#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {46814#true} is VALID [2022-04-08 15:14:49,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {46814#true} assume true; {46814#true} is VALID [2022-04-08 15:14:49,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46814#true} {46814#true} #593#return; {46814#true} is VALID [2022-04-08 15:14:49,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {46814#true} call #t~ret158 := main(); {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {46814#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; {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L272 TraceCheckUtils]: 6: Hoare triple {46814#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {46814#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; {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {46814#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; {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {46814#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {46814#true} assume 12292 == #t~mem49;havoc #t~mem49; {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {46814#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; {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {46814#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {46814#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {46814#true} is VALID [2022-04-08 15:14:49,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {46814#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {46814#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {46814#true} assume !(0 == ~tmp___4~0); {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {46814#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {46814#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {46814#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {46814#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {46814#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {46814#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {46814#true} assume 4368 == #t~mem54;havoc #t~mem54; {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {46814#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; {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {46814#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {46814#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; {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {46814#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {46814#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {46814#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {46814#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {46814#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {46814#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {46814#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {46814#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {46814#true} assume 4384 == #t~mem56;havoc #t~mem56; {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {46814#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {46814#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {46814#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {46814#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {46814#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 55: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {46814#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-08 15:14:49,182 INFO L290 TraceCheckUtils]: 59: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {46814#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {46814#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {46814#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {46814#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {46814#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {46814#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 66: Hoare triple {46814#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 67: Hoare triple {46814#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 68: Hoare triple {46814#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 69: Hoare triple {46814#true} assume 4400 == #t~mem58;havoc #t~mem58; {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 70: Hoare triple {46814#true} 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); {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 71: Hoare triple {46814#true} 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; {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 72: Hoare triple {46814#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {46814#true} is VALID [2022-04-08 15:14:49,183 INFO L290 TraceCheckUtils]: 73: Hoare triple {46814#true} assume !(~ret~0 <= 0); {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 74: Hoare triple {46814#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 75: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 76: Hoare triple {46814#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 77: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 78: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 79: Hoare triple {46814#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); {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 80: Hoare triple {46814#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 81: Hoare triple {46814#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 82: Hoare triple {46814#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 83: Hoare triple {46814#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 84: Hoare triple {46814#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 85: Hoare triple {46814#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 86: Hoare triple {46814#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,184 INFO L290 TraceCheckUtils]: 87: Hoare triple {46814#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,185 INFO L290 TraceCheckUtils]: 88: Hoare triple {46814#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,185 INFO L290 TraceCheckUtils]: 89: Hoare triple {46814#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,185 INFO L290 TraceCheckUtils]: 90: Hoare triple {46814#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-08 15:14:49,185 INFO L290 TraceCheckUtils]: 91: Hoare triple {46814#true} assume 4416 == #t~mem60;havoc #t~mem60; {46814#true} is VALID [2022-04-08 15:14:49,185 INFO L290 TraceCheckUtils]: 92: Hoare triple {46814#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {46814#true} is VALID [2022-04-08 15:14:49,185 INFO L290 TraceCheckUtils]: 93: Hoare triple {46814#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {46814#true} is VALID [2022-04-08 15:14:49,186 INFO L290 TraceCheckUtils]: 94: Hoare triple {46814#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,186 INFO L290 TraceCheckUtils]: 95: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(0 == ~tmp___6~0); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,186 INFO L290 TraceCheckUtils]: 96: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} 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); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,187 INFO L290 TraceCheckUtils]: 97: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,187 INFO L290 TraceCheckUtils]: 98: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} ~skip~0 := 0; {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,187 INFO L290 TraceCheckUtils]: 99: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !false; {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,187 INFO L290 TraceCheckUtils]: 100: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} 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); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,188 INFO L290 TraceCheckUtils]: 101: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,188 INFO L290 TraceCheckUtils]: 102: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,188 INFO L290 TraceCheckUtils]: 103: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,188 INFO L290 TraceCheckUtils]: 104: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,189 INFO L290 TraceCheckUtils]: 105: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,189 INFO L290 TraceCheckUtils]: 106: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:14:49,189 INFO L290 TraceCheckUtils]: 107: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46820#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 108: Hoare triple {46820#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 109: Hoare triple {46815#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 110: Hoare triple {46815#false} assume !(1 == ~blastFlag~0); {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 111: Hoare triple {46815#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 112: Hoare triple {46815#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 113: Hoare triple {46815#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 114: Hoare triple {46815#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); {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 115: Hoare triple {46815#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 116: Hoare triple {46815#false} ~skip~0 := 0; {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 117: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 118: Hoare triple {46815#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); {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 119: Hoare triple {46815#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,190 INFO L290 TraceCheckUtils]: 120: Hoare triple {46815#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 121: Hoare triple {46815#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 122: Hoare triple {46815#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 123: Hoare triple {46815#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 124: Hoare triple {46815#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 125: Hoare triple {46815#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 126: Hoare triple {46815#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 127: Hoare triple {46815#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 128: Hoare triple {46815#false} assume 4400 == #t~mem58;havoc #t~mem58; {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 129: Hoare triple {46815#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); {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 130: Hoare triple {46815#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; {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 131: Hoare triple {46815#false} assume !(2 == ~blastFlag~0); {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 132: Hoare triple {46815#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 133: Hoare triple {46815#false} assume !(~ret~0 <= 0); {46815#false} is VALID [2022-04-08 15:14:49,191 INFO L290 TraceCheckUtils]: 134: Hoare triple {46815#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 135: Hoare triple {46815#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); {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 136: Hoare triple {46815#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 137: Hoare triple {46815#false} ~skip~0 := 0; {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 138: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 139: Hoare triple {46815#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); {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 140: Hoare triple {46815#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 141: Hoare triple {46815#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 142: Hoare triple {46815#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 143: Hoare triple {46815#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 144: Hoare triple {46815#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 145: Hoare triple {46815#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 146: Hoare triple {46815#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 147: Hoare triple {46815#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,192 INFO L290 TraceCheckUtils]: 148: Hoare triple {46815#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 149: Hoare triple {46815#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 150: Hoare triple {46815#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 151: Hoare triple {46815#false} assume 4416 == #t~mem60;havoc #t~mem60; {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 152: Hoare triple {46815#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 153: Hoare triple {46815#false} assume !(3 == ~blastFlag~0); {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 154: Hoare triple {46815#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); {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 155: Hoare triple {46815#false} assume !(0 == ~tmp___6~0); {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 156: Hoare triple {46815#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); {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 157: Hoare triple {46815#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 158: Hoare triple {46815#false} ~skip~0 := 0; {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 159: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 160: Hoare triple {46815#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); {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 161: Hoare triple {46815#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,193 INFO L290 TraceCheckUtils]: 162: Hoare triple {46815#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 163: Hoare triple {46815#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 164: Hoare triple {46815#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 165: Hoare triple {46815#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 166: Hoare triple {46815#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 167: Hoare triple {46815#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 168: Hoare triple {46815#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 169: Hoare triple {46815#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 170: Hoare triple {46815#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 171: Hoare triple {46815#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 172: Hoare triple {46815#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 173: Hoare triple {46815#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 174: Hoare triple {46815#false} assume 4432 == #t~mem62;havoc #t~mem62; {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 175: Hoare triple {46815#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {46815#false} is VALID [2022-04-08 15:14:49,194 INFO L290 TraceCheckUtils]: 176: Hoare triple {46815#false} assume 5 == ~blastFlag~0; {46815#false} is VALID [2022-04-08 15:14:49,195 INFO L290 TraceCheckUtils]: 177: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-08 15:14:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-04-08 15:14:49,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:49,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119314284] [2022-04-08 15:14:49,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119314284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:49,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:49,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:49,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:49,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [140436987] [2022-04-08 15:14:49,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [140436987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:49,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:49,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:49,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278301638] [2022-04-08 15:14:49,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:49,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 178 [2022-04-08 15:14:49,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:49,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:49,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:49,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:49,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:49,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:49,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:49,272 INFO L87 Difference]: Start difference. First operand 1001 states and 1552 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:51,292 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-08 15:14:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:52,500 INFO L93 Difference]: Finished difference Result 2493 states and 3818 transitions. [2022-04-08 15:14:52,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:52,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 178 [2022-04-08 15:14:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 15:14:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 15:14:52,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-08 15:14:52,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:52,889 INFO L225 Difference]: With dead ends: 2493 [2022-04-08 15:14:52,889 INFO L226 Difference]: Without dead ends: 1508 [2022-04-08 15:14:52,891 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-08 15:14:52,891 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 109 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:52,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:14:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-04-08 15:14:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1091. [2022-04-08 15:14:52,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:52,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1508 states. Second operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:52,965 INFO L74 IsIncluded]: Start isIncluded. First operand 1508 states. Second operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:52,966 INFO L87 Difference]: Start difference. First operand 1508 states. Second operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:53,028 INFO L93 Difference]: Finished difference Result 1508 states and 2270 transitions. [2022-04-08 15:14:53,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2270 transitions. [2022-04-08 15:14:53,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:53,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:53,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1508 states. [2022-04-08 15:14:53,032 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1508 states. [2022-04-08 15:14:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:53,089 INFO L93 Difference]: Finished difference Result 1508 states and 2270 transitions. [2022-04-08 15:14:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2270 transitions. [2022-04-08 15:14:53,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:53,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:53,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:53,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1691 transitions. [2022-04-08 15:14:53,141 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1691 transitions. Word has length 178 [2022-04-08 15:14:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:53,141 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1691 transitions. [2022-04-08 15:14:53,142 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:53,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1691 transitions. [2022-04-08 15:14:54,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1691 edges. 1691 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1691 transitions. [2022-04-08 15:14:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-04-08 15:14:54,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:54,473 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:14:54,473 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 15:14:54,473 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1065449955, now seen corresponding path program 1 times [2022-04-08 15:14:54,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:54,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [764177600] [2022-04-08 15:15:06,211 WARN L232 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:15:15,497 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1065449955, now seen corresponding path program 2 times [2022-04-08 15:15:15,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:15,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340767069] [2022-04-08 15:15:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:15,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:15:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:15,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {57017#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {57010#true} is VALID [2022-04-08 15:15:15,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {57010#true} assume true; {57010#true} is VALID [2022-04-08 15:15:15,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57010#true} {57010#true} #593#return; {57010#true} is VALID [2022-04-08 15:15:15,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {57010#true} call ULTIMATE.init(); {57017#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:15:15,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {57017#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {57010#true} is VALID [2022-04-08 15:15:15,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {57010#true} assume true; {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57010#true} {57010#true} #593#return; {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {57010#true} call #t~ret158 := main(); {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {57010#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; {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L272 TraceCheckUtils]: 6: Hoare triple {57010#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {57010#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; {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {57010#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; {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {57010#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {57010#true} assume 12292 == #t~mem49;havoc #t~mem49; {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {57010#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; {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {57010#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {57010#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {57010#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {57010#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {57010#true} assume !(0 == ~tmp___4~0); {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {57010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {57010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {57010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {57010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {57010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {57010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {57010#true} assume 4368 == #t~mem54;havoc #t~mem54; {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {57010#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; {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {57010#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {57010#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; {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {57010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {57010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {57010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {57010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 45: Hoare triple {57010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {57010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {57010#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {57010#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {57010#true} assume 4384 == #t~mem56;havoc #t~mem56; {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {57010#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 51: Hoare triple {57010#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {57010#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {57010#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 54: Hoare triple {57010#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 55: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 56: Hoare triple {57010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 58: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-08 15:15:15,697 INFO L290 TraceCheckUtils]: 59: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,698 INFO L290 TraceCheckUtils]: 60: Hoare triple {57010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,698 INFO L290 TraceCheckUtils]: 61: Hoare triple {57010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,698 INFO L290 TraceCheckUtils]: 62: Hoare triple {57010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,698 INFO L290 TraceCheckUtils]: 63: Hoare triple {57010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,698 INFO L290 TraceCheckUtils]: 64: Hoare triple {57010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,698 INFO L290 TraceCheckUtils]: 65: Hoare triple {57010#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,698 INFO L290 TraceCheckUtils]: 66: Hoare triple {57010#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,698 INFO L290 TraceCheckUtils]: 67: Hoare triple {57010#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,702 INFO L290 TraceCheckUtils]: 68: Hoare triple {57010#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,702 INFO L290 TraceCheckUtils]: 69: Hoare triple {57010#true} assume 4400 == #t~mem58;havoc #t~mem58; {57010#true} is VALID [2022-04-08 15:15:15,702 INFO L290 TraceCheckUtils]: 70: Hoare triple {57010#true} 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); {57010#true} is VALID [2022-04-08 15:15:15,702 INFO L290 TraceCheckUtils]: 71: Hoare triple {57010#true} 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; {57010#true} is VALID [2022-04-08 15:15:15,702 INFO L290 TraceCheckUtils]: 72: Hoare triple {57010#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 73: Hoare triple {57010#true} assume !(~ret~0 <= 0); {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 74: Hoare triple {57010#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 75: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 76: Hoare triple {57010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 77: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 78: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 79: Hoare triple {57010#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); {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 80: Hoare triple {57010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 81: Hoare triple {57010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 82: Hoare triple {57010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 83: Hoare triple {57010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 84: Hoare triple {57010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 85: Hoare triple {57010#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,703 INFO L290 TraceCheckUtils]: 86: Hoare triple {57010#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,704 INFO L290 TraceCheckUtils]: 87: Hoare triple {57010#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,704 INFO L290 TraceCheckUtils]: 88: Hoare triple {57010#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,704 INFO L290 TraceCheckUtils]: 89: Hoare triple {57010#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,704 INFO L290 TraceCheckUtils]: 90: Hoare triple {57010#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-08 15:15:15,704 INFO L290 TraceCheckUtils]: 91: Hoare triple {57010#true} assume 4416 == #t~mem60;havoc #t~mem60; {57010#true} is VALID [2022-04-08 15:15:15,704 INFO L290 TraceCheckUtils]: 92: Hoare triple {57010#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {57010#true} is VALID [2022-04-08 15:15:15,704 INFO L290 TraceCheckUtils]: 93: Hoare triple {57010#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {57010#true} is VALID [2022-04-08 15:15:15,705 INFO L290 TraceCheckUtils]: 94: Hoare triple {57010#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,705 INFO L290 TraceCheckUtils]: 95: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,706 INFO L290 TraceCheckUtils]: 96: Hoare triple {57015#(= 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); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,706 INFO L290 TraceCheckUtils]: 97: Hoare triple {57015#(= 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; {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,706 INFO L290 TraceCheckUtils]: 98: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,707 INFO L290 TraceCheckUtils]: 99: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,707 INFO L290 TraceCheckUtils]: 100: Hoare triple {57015#(= 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); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,707 INFO L290 TraceCheckUtils]: 101: Hoare triple {57015#(= 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); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,708 INFO L290 TraceCheckUtils]: 102: Hoare triple {57015#(= 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); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,708 INFO L290 TraceCheckUtils]: 103: Hoare triple {57015#(= 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); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,708 INFO L290 TraceCheckUtils]: 104: Hoare triple {57015#(= 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); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,709 INFO L290 TraceCheckUtils]: 105: Hoare triple {57015#(= 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); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,709 INFO L290 TraceCheckUtils]: 106: Hoare triple {57015#(= 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); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,709 INFO L290 TraceCheckUtils]: 107: Hoare triple {57015#(= 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); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:15,710 INFO L290 TraceCheckUtils]: 108: Hoare triple {57015#(= 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); {57016#(= |ssl3_connect_#t~mem57| 4432)} is VALID [2022-04-08 15:15:15,710 INFO L290 TraceCheckUtils]: 109: Hoare triple {57016#(= |ssl3_connect_#t~mem57| 4432)} assume 4385 == #t~mem57;havoc #t~mem57; {57011#false} is VALID [2022-04-08 15:15:15,710 INFO L290 TraceCheckUtils]: 110: Hoare triple {57011#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {57011#false} is VALID [2022-04-08 15:15:15,710 INFO L290 TraceCheckUtils]: 111: Hoare triple {57011#false} assume !(1 == ~blastFlag~0); {57011#false} is VALID [2022-04-08 15:15:15,710 INFO L290 TraceCheckUtils]: 112: Hoare triple {57011#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,710 INFO L290 TraceCheckUtils]: 113: Hoare triple {57011#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,710 INFO L290 TraceCheckUtils]: 114: Hoare triple {57011#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,710 INFO L290 TraceCheckUtils]: 115: Hoare triple {57011#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); {57011#false} is VALID [2022-04-08 15:15:15,710 INFO L290 TraceCheckUtils]: 116: Hoare triple {57011#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57011#false} is VALID [2022-04-08 15:15:15,710 INFO L290 TraceCheckUtils]: 117: Hoare triple {57011#false} ~skip~0 := 0; {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 118: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 119: Hoare triple {57011#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); {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 120: Hoare triple {57011#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 121: Hoare triple {57011#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 122: Hoare triple {57011#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 123: Hoare triple {57011#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 124: Hoare triple {57011#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 125: Hoare triple {57011#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 126: Hoare triple {57011#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 127: Hoare triple {57011#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 128: Hoare triple {57011#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 129: Hoare triple {57011#false} assume 4400 == #t~mem58;havoc #t~mem58; {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 130: Hoare triple {57011#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); {57011#false} is VALID [2022-04-08 15:15:15,711 INFO L290 TraceCheckUtils]: 131: Hoare triple {57011#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; {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 132: Hoare triple {57011#false} assume !(2 == ~blastFlag~0); {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 133: Hoare triple {57011#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 134: Hoare triple {57011#false} assume !(~ret~0 <= 0); {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 135: Hoare triple {57011#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 136: Hoare triple {57011#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); {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 137: Hoare triple {57011#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 138: Hoare triple {57011#false} ~skip~0 := 0; {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 139: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 140: Hoare triple {57011#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); {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 141: Hoare triple {57011#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 142: Hoare triple {57011#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 143: Hoare triple {57011#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 144: Hoare triple {57011#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,712 INFO L290 TraceCheckUtils]: 145: Hoare triple {57011#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 146: Hoare triple {57011#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 147: Hoare triple {57011#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 148: Hoare triple {57011#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 149: Hoare triple {57011#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 150: Hoare triple {57011#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 151: Hoare triple {57011#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 152: Hoare triple {57011#false} assume 4416 == #t~mem60;havoc #t~mem60; {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 153: Hoare triple {57011#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 154: Hoare triple {57011#false} assume !(3 == ~blastFlag~0); {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 155: Hoare triple {57011#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); {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 156: Hoare triple {57011#false} assume !(0 == ~tmp___6~0); {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 157: Hoare triple {57011#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); {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 158: Hoare triple {57011#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57011#false} is VALID [2022-04-08 15:15:15,713 INFO L290 TraceCheckUtils]: 159: Hoare triple {57011#false} ~skip~0 := 0; {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 160: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 161: Hoare triple {57011#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); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 162: Hoare triple {57011#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 163: Hoare triple {57011#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 164: Hoare triple {57011#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 165: Hoare triple {57011#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 166: Hoare triple {57011#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 167: Hoare triple {57011#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 168: Hoare triple {57011#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 169: Hoare triple {57011#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 170: Hoare triple {57011#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 171: Hoare triple {57011#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 172: Hoare triple {57011#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 173: Hoare triple {57011#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,714 INFO L290 TraceCheckUtils]: 174: Hoare triple {57011#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-08 15:15:15,715 INFO L290 TraceCheckUtils]: 175: Hoare triple {57011#false} assume 4432 == #t~mem62;havoc #t~mem62; {57011#false} is VALID [2022-04-08 15:15:15,715 INFO L290 TraceCheckUtils]: 176: Hoare triple {57011#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {57011#false} is VALID [2022-04-08 15:15:15,715 INFO L290 TraceCheckUtils]: 177: Hoare triple {57011#false} assume 5 == ~blastFlag~0; {57011#false} is VALID [2022-04-08 15:15:15,715 INFO L290 TraceCheckUtils]: 178: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-08 15:15:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-04-08 15:15:15,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:15:15,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340767069] [2022-04-08 15:15:15,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340767069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:15,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:15,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:15,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:15:15,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [764177600] [2022-04-08 15:15:15,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [764177600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:15,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:15,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:15,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163662398] [2022-04-08 15:15:15,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:15:15,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 179 [2022-04-08 15:15:15,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:15:15,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:15,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:15,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:15:15,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:15,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:15:15,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:15:15,795 INFO L87 Difference]: Start difference. First operand 1091 states and 1691 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:17,815 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-08 15:15:19,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:19,275 INFO L93 Difference]: Finished difference Result 2452 states and 3760 transitions. [2022-04-08 15:15:19,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:15:19,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 179 [2022-04-08 15:15:19,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-08 15:15:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-08 15:15:19,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 456 transitions. [2022-04-08 15:15:19,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:19,631 INFO L225 Difference]: With dead ends: 2452 [2022-04-08 15:15:19,631 INFO L226 Difference]: Without dead ends: 1377 [2022-04-08 15:15:19,632 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-08 15:15:19,632 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 86 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:19,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 541 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 511 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:15:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2022-04-08 15:15:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1091. [2022-04-08 15:15:19,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:19,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1377 states. Second operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:19,675 INFO L74 IsIncluded]: Start isIncluded. First operand 1377 states. Second operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:19,677 INFO L87 Difference]: Start difference. First operand 1377 states. Second operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:19,723 INFO L93 Difference]: Finished difference Result 1377 states and 2084 transitions. [2022-04-08 15:15:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2084 transitions. [2022-04-08 15:15:19,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:19,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:19,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 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 1377 states. [2022-04-08 15:15:19,731 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 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 1377 states. [2022-04-08 15:15:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:19,778 INFO L93 Difference]: Finished difference Result 1377 states and 2084 transitions. [2022-04-08 15:15:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2084 transitions. [2022-04-08 15:15:19,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:19,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:19,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:19,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1686 transitions. [2022-04-08 15:15:19,822 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1686 transitions. Word has length 179 [2022-04-08 15:15:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:19,823 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1686 transitions. [2022-04-08 15:15:19,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:19,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1686 transitions. [2022-04-08 15:15:21,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1686 edges. 1686 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1686 transitions. [2022-04-08 15:15:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-08 15:15:21,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:21,186 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:15:21,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 15:15:21,187 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:21,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash 624136773, now seen corresponding path program 3 times [2022-04-08 15:15:21,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:21,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1475503252] [2022-04-08 15:15:32,415 WARN L232 SmtUtils]: Spent 10.54s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:15:41,242 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:41,242 INFO L85 PathProgramCache]: Analyzing trace with hash 624136773, now seen corresponding path program 4 times [2022-04-08 15:15:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:41,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450036584] [2022-04-08 15:15:41,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:41,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:41,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:15:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:41,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {66869#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {66862#true} is VALID [2022-04-08 15:15:41,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {66862#true} assume true; {66862#true} is VALID [2022-04-08 15:15:41,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66862#true} {66862#true} #593#return; {66862#true} is VALID [2022-04-08 15:15:41,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {66862#true} call ULTIMATE.init(); {66869#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:15:41,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {66869#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {66862#true} is VALID [2022-04-08 15:15:41,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {66862#true} assume true; {66862#true} is VALID [2022-04-08 15:15:41,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66862#true} {66862#true} #593#return; {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {66862#true} call #t~ret158 := main(); {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {66862#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; {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L272 TraceCheckUtils]: 6: Hoare triple {66862#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {66862#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; {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {66862#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; {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {66862#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {66862#true} assume 12292 == #t~mem49;havoc #t~mem49; {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {66862#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; {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {66862#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {66862#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {66862#true} is VALID [2022-04-08 15:15:41,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {66862#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {66862#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {66862#true} assume !(0 == ~tmp___4~0); {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {66862#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {66862#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {66862#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {66862#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {66862#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {66862#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {66862#true} assume 4368 == #t~mem54;havoc #t~mem54; {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {66862#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; {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {66862#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {66862#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; {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {66862#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 42: Hoare triple {66862#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {66862#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {66862#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {66862#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {66862#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 47: Hoare triple {66862#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 48: Hoare triple {66862#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {66862#true} assume 4384 == #t~mem56;havoc #t~mem56; {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {66862#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {66862#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {66862#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {66862#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {66862#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 55: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {66862#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {66862#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {66862#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {66862#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 63: Hoare triple {66862#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 64: Hoare triple {66862#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {66862#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 66: Hoare triple {66862#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 67: Hoare triple {66862#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 68: Hoare triple {66862#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 69: Hoare triple {66862#true} assume 4400 == #t~mem58;havoc #t~mem58; {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 70: Hoare triple {66862#true} 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); {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 71: Hoare triple {66862#true} 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; {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {66862#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 73: Hoare triple {66862#true} assume !(~ret~0 <= 0); {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 74: Hoare triple {66862#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,454 INFO L290 TraceCheckUtils]: 75: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 76: Hoare triple {66862#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 77: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 78: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 79: Hoare triple {66862#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); {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 80: Hoare triple {66862#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 81: Hoare triple {66862#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 82: Hoare triple {66862#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 83: Hoare triple {66862#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 84: Hoare triple {66862#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 85: Hoare triple {66862#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 86: Hoare triple {66862#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 87: Hoare triple {66862#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 88: Hoare triple {66862#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,455 INFO L290 TraceCheckUtils]: 89: Hoare triple {66862#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,456 INFO L290 TraceCheckUtils]: 90: Hoare triple {66862#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-08 15:15:41,456 INFO L290 TraceCheckUtils]: 91: Hoare triple {66862#true} assume 4416 == #t~mem60;havoc #t~mem60; {66862#true} is VALID [2022-04-08 15:15:41,456 INFO L290 TraceCheckUtils]: 92: Hoare triple {66862#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {66862#true} is VALID [2022-04-08 15:15:41,465 INFO L290 TraceCheckUtils]: 93: Hoare triple {66862#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {66862#true} is VALID [2022-04-08 15:15:41,466 INFO L290 TraceCheckUtils]: 94: Hoare triple {66862#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:41,467 INFO L290 TraceCheckUtils]: 95: Hoare triple {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:41,467 INFO L290 TraceCheckUtils]: 96: Hoare triple {66867#(not (= 12292 (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); {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:41,467 INFO L290 TraceCheckUtils]: 97: Hoare triple {66867#(not (= 12292 (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; {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:41,467 INFO L290 TraceCheckUtils]: 98: Hoare triple {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:41,468 INFO L290 TraceCheckUtils]: 99: Hoare triple {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:41,468 INFO L290 TraceCheckUtils]: 100: Hoare triple {66867#(not (= 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); {66868#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-08 15:15:41,468 INFO L290 TraceCheckUtils]: 101: Hoare triple {66868#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {66863#false} is VALID [2022-04-08 15:15:41,468 INFO L290 TraceCheckUtils]: 102: Hoare triple {66863#false} 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; {66863#false} is VALID [2022-04-08 15:15:41,468 INFO L290 TraceCheckUtils]: 103: Hoare triple {66863#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,468 INFO L290 TraceCheckUtils]: 104: Hoare triple {66863#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 105: Hoare triple {66863#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 106: Hoare triple {66863#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 107: Hoare triple {66863#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 108: Hoare triple {66863#false} assume !(0 == ~tmp___4~0); {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 109: Hoare triple {66863#false} 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); {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 110: Hoare triple {66863#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); {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 111: Hoare triple {66863#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 112: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 113: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 114: Hoare triple {66863#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); {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 115: Hoare triple {66863#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 116: Hoare triple {66863#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 117: Hoare triple {66863#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,469 INFO L290 TraceCheckUtils]: 118: Hoare triple {66863#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 119: Hoare triple {66863#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 120: Hoare triple {66863#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 121: Hoare triple {66863#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 122: Hoare triple {66863#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 123: Hoare triple {66863#false} assume 4385 == #t~mem57;havoc #t~mem57; {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 124: Hoare triple {66863#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 125: Hoare triple {66863#false} assume !(1 == ~blastFlag~0); {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 126: Hoare triple {66863#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 127: Hoare triple {66863#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 128: Hoare triple {66863#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 129: Hoare triple {66863#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); {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 130: Hoare triple {66863#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 131: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-08 15:15:41,470 INFO L290 TraceCheckUtils]: 132: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 133: Hoare triple {66863#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); {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 134: Hoare triple {66863#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 135: Hoare triple {66863#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 136: Hoare triple {66863#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 137: Hoare triple {66863#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 138: Hoare triple {66863#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 139: Hoare triple {66863#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 140: Hoare triple {66863#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 141: Hoare triple {66863#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 142: Hoare triple {66863#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 143: Hoare triple {66863#false} assume 4400 == #t~mem58;havoc #t~mem58; {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 144: Hoare triple {66863#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); {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 145: Hoare triple {66863#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; {66863#false} is VALID [2022-04-08 15:15:41,471 INFO L290 TraceCheckUtils]: 146: Hoare triple {66863#false} assume !(2 == ~blastFlag~0); {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 147: Hoare triple {66863#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 148: Hoare triple {66863#false} assume !(~ret~0 <= 0); {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 149: Hoare triple {66863#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 150: Hoare triple {66863#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); {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 151: Hoare triple {66863#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 152: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 153: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 154: Hoare triple {66863#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); {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 155: Hoare triple {66863#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 156: Hoare triple {66863#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 157: Hoare triple {66863#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 158: Hoare triple {66863#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 159: Hoare triple {66863#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 160: Hoare triple {66863#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,472 INFO L290 TraceCheckUtils]: 161: Hoare triple {66863#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 162: Hoare triple {66863#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 163: Hoare triple {66863#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 164: Hoare triple {66863#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 165: Hoare triple {66863#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 166: Hoare triple {66863#false} assume 4416 == #t~mem60;havoc #t~mem60; {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 167: Hoare triple {66863#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 168: Hoare triple {66863#false} assume !(3 == ~blastFlag~0); {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 169: Hoare triple {66863#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); {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 170: Hoare triple {66863#false} assume !(0 == ~tmp___6~0); {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 171: Hoare triple {66863#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); {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 172: Hoare triple {66863#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 173: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 174: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-08 15:15:41,473 INFO L290 TraceCheckUtils]: 175: Hoare triple {66863#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); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 176: Hoare triple {66863#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 177: Hoare triple {66863#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 178: Hoare triple {66863#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 179: Hoare triple {66863#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 180: Hoare triple {66863#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 181: Hoare triple {66863#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 182: Hoare triple {66863#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 183: Hoare triple {66863#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 184: Hoare triple {66863#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 185: Hoare triple {66863#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 186: Hoare triple {66863#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 187: Hoare triple {66863#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 188: Hoare triple {66863#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-08 15:15:41,474 INFO L290 TraceCheckUtils]: 189: Hoare triple {66863#false} assume 4432 == #t~mem62;havoc #t~mem62; {66863#false} is VALID [2022-04-08 15:15:41,475 INFO L290 TraceCheckUtils]: 190: Hoare triple {66863#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {66863#false} is VALID [2022-04-08 15:15:41,475 INFO L290 TraceCheckUtils]: 191: Hoare triple {66863#false} assume 5 == ~blastFlag~0; {66863#false} is VALID [2022-04-08 15:15:41,475 INFO L290 TraceCheckUtils]: 192: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-08 15:15:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-04-08 15:15:41,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:15:41,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450036584] [2022-04-08 15:15:41,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450036584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:41,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:41,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:41,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:15:41,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1475503252] [2022-04-08 15:15:41,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1475503252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:41,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:41,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:41,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195675319] [2022-04-08 15:15:41,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:15:41,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 193 [2022-04-08 15:15:41,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:15:41,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:41,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:41,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:15:41,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:41,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:15:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:15:41,555 INFO L87 Difference]: Start difference. First operand 1091 states and 1686 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:43,574 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-08 15:15:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:44,755 INFO L93 Difference]: Finished difference Result 2542 states and 3875 transitions. [2022-04-08 15:15:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:15:44,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 193 [2022-04-08 15:15:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 15:15:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 15:15:44,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-08 15:15:45,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:45,146 INFO L225 Difference]: With dead ends: 2542 [2022-04-08 15:15:45,146 INFO L226 Difference]: Without dead ends: 1467 [2022-04-08 15:15:45,147 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-08 15:15:45,148 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 110 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:45,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:15:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-04-08 15:15:45,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1091. [2022-04-08 15:15:45,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:45,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1467 states. Second operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:45,207 INFO L74 IsIncluded]: Start isIncluded. First operand 1467 states. Second operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:45,208 INFO L87 Difference]: Start difference. First operand 1467 states. Second operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:45,258 INFO L93 Difference]: Finished difference Result 1467 states and 2188 transitions. [2022-04-08 15:15:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2188 transitions. [2022-04-08 15:15:45,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:45,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:45,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 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 1467 states. [2022-04-08 15:15:45,262 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 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 1467 states. [2022-04-08 15:15:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:45,313 INFO L93 Difference]: Finished difference Result 1467 states and 2188 transitions. [2022-04-08 15:15:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2188 transitions. [2022-04-08 15:15:45,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:45,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:45,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:45,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1665 transitions. [2022-04-08 15:15:45,360 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1665 transitions. Word has length 193 [2022-04-08 15:15:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:45,361 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1665 transitions. [2022-04-08 15:15:45,361 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:45,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1665 transitions. [2022-04-08 15:15:46,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1665 transitions. [2022-04-08 15:15:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-08 15:15:46,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:46,720 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:15:46,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 15:15:46,721 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 1 times [2022-04-08 15:15:46,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:46,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1273257216] [2022-04-08 15:16:00,104 WARN L232 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:16:07,652 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:16:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 2 times [2022-04-08 15:16:07,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:16:07,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322358192] [2022-04-08 15:16:07,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:16:07,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:16:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:16:07,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:16:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:16:07,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {77081#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {77074#true} is VALID [2022-04-08 15:16:07,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {77074#true} assume true; {77074#true} is VALID [2022-04-08 15:16:07,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77074#true} {77074#true} #593#return; {77074#true} is VALID [2022-04-08 15:16:07,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {77074#true} call ULTIMATE.init(); {77081#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:16:07,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {77081#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {77074#true} is VALID [2022-04-08 15:16:07,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {77074#true} assume true; {77074#true} is VALID [2022-04-08 15:16:07,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77074#true} {77074#true} #593#return; {77074#true} is VALID [2022-04-08 15:16:07,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {77074#true} call #t~ret158 := main(); {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {77074#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; {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {77074#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {77074#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; {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {77074#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; {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {77074#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {77074#true} assume 12292 == #t~mem49;havoc #t~mem49; {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {77074#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; {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {77074#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {77074#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {77074#true} is VALID [2022-04-08 15:16:07,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {77074#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {77074#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {77074#true} assume !(0 == ~tmp___4~0); {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {77074#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {77074#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {77074#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {77074#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {77074#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {77074#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {77074#true} assume 4368 == #t~mem54;havoc #t~mem54; {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {77074#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; {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {77074#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {77074#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; {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {77074#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {77074#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {77074#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {77074#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {77074#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,816 INFO L290 TraceCheckUtils]: 46: Hoare triple {77074#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {77074#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {77074#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {77074#true} assume 4384 == #t~mem56;havoc #t~mem56; {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {77074#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {77074#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {77074#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {77074#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 54: Hoare triple {77074#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 55: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 56: Hoare triple {77074#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,817 INFO L290 TraceCheckUtils]: 60: Hoare triple {77074#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {77074#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {77074#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 63: Hoare triple {77074#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 64: Hoare triple {77074#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 65: Hoare triple {77074#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 66: Hoare triple {77074#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 67: Hoare triple {77074#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 68: Hoare triple {77074#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 69: Hoare triple {77074#true} assume 4400 == #t~mem58;havoc #t~mem58; {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 70: Hoare triple {77074#true} 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); {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 71: Hoare triple {77074#true} 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; {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 72: Hoare triple {77074#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 73: Hoare triple {77074#true} assume !(~ret~0 <= 0); {77074#true} is VALID [2022-04-08 15:16:07,818 INFO L290 TraceCheckUtils]: 74: Hoare triple {77074#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 75: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 76: Hoare triple {77074#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 77: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 78: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 79: Hoare triple {77074#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); {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 80: Hoare triple {77074#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 81: Hoare triple {77074#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 82: Hoare triple {77074#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 83: Hoare triple {77074#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 84: Hoare triple {77074#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 85: Hoare triple {77074#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 86: Hoare triple {77074#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 87: Hoare triple {77074#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,819 INFO L290 TraceCheckUtils]: 88: Hoare triple {77074#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,820 INFO L290 TraceCheckUtils]: 89: Hoare triple {77074#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,820 INFO L290 TraceCheckUtils]: 90: Hoare triple {77074#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-08 15:16:07,820 INFO L290 TraceCheckUtils]: 91: Hoare triple {77074#true} assume 4416 == #t~mem60;havoc #t~mem60; {77074#true} is VALID [2022-04-08 15:16:07,820 INFO L290 TraceCheckUtils]: 92: Hoare triple {77074#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {77074#true} is VALID [2022-04-08 15:16:07,820 INFO L290 TraceCheckUtils]: 93: Hoare triple {77074#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {77074#true} is VALID [2022-04-08 15:16:07,821 INFO L290 TraceCheckUtils]: 94: Hoare triple {77074#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:07,821 INFO L290 TraceCheckUtils]: 95: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:07,821 INFO L290 TraceCheckUtils]: 96: Hoare triple {77079#(= 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); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:07,822 INFO L290 TraceCheckUtils]: 97: Hoare triple {77079#(= 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; {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:07,822 INFO L290 TraceCheckUtils]: 98: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:07,822 INFO L290 TraceCheckUtils]: 99: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:07,823 INFO L290 TraceCheckUtils]: 100: Hoare triple {77079#(= 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); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:07,823 INFO L290 TraceCheckUtils]: 101: Hoare triple {77079#(= 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); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:07,823 INFO L290 TraceCheckUtils]: 102: Hoare triple {77079#(= 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); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:07,824 INFO L290 TraceCheckUtils]: 103: Hoare triple {77079#(= 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); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:07,824 INFO L290 TraceCheckUtils]: 104: Hoare triple {77079#(= 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); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:07,836 INFO L290 TraceCheckUtils]: 105: Hoare triple {77079#(= 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); {77080#(= |ssl3_connect_#t~mem54| 4432)} is VALID [2022-04-08 15:16:07,837 INFO L290 TraceCheckUtils]: 106: Hoare triple {77080#(= |ssl3_connect_#t~mem54| 4432)} assume 4368 == #t~mem54;havoc #t~mem54; {77075#false} is VALID [2022-04-08 15:16:07,837 INFO L290 TraceCheckUtils]: 107: Hoare triple {77075#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {77075#false} is VALID [2022-04-08 15:16:07,837 INFO L290 TraceCheckUtils]: 108: Hoare triple {77075#false} assume !(0 == ~blastFlag~0); {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 109: Hoare triple {77075#false} 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); {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 110: Hoare triple {77075#false} 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; {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 111: Hoare triple {77075#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); {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 112: Hoare triple {77075#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 113: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 114: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 115: Hoare triple {77075#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); {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 116: Hoare triple {77075#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 117: Hoare triple {77075#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 118: Hoare triple {77075#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 119: Hoare triple {77075#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 120: Hoare triple {77075#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 121: Hoare triple {77075#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,838 INFO L290 TraceCheckUtils]: 122: Hoare triple {77075#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 123: Hoare triple {77075#false} assume 4384 == #t~mem56;havoc #t~mem56; {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 124: Hoare triple {77075#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 125: Hoare triple {77075#false} assume !(1 == ~blastFlag~0); {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 126: Hoare triple {77075#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 127: Hoare triple {77075#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 128: Hoare triple {77075#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 129: Hoare triple {77075#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); {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 130: Hoare triple {77075#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 131: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 132: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 133: Hoare triple {77075#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); {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 134: Hoare triple {77075#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 135: Hoare triple {77075#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,839 INFO L290 TraceCheckUtils]: 136: Hoare triple {77075#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 137: Hoare triple {77075#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 138: Hoare triple {77075#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 139: Hoare triple {77075#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 140: Hoare triple {77075#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 141: Hoare triple {77075#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 142: Hoare triple {77075#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 143: Hoare triple {77075#false} assume 4400 == #t~mem58;havoc #t~mem58; {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 144: Hoare triple {77075#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); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 145: Hoare triple {77075#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; {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 146: Hoare triple {77075#false} assume !(2 == ~blastFlag~0); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 147: Hoare triple {77075#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 148: Hoare triple {77075#false} assume !(~ret~0 <= 0); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 149: Hoare triple {77075#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 150: Hoare triple {77075#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); {77075#false} is VALID [2022-04-08 15:16:07,840 INFO L290 TraceCheckUtils]: 151: Hoare triple {77075#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 152: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 153: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 154: Hoare triple {77075#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); {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 155: Hoare triple {77075#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 156: Hoare triple {77075#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 157: Hoare triple {77075#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 158: Hoare triple {77075#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 159: Hoare triple {77075#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 160: Hoare triple {77075#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 161: Hoare triple {77075#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 162: Hoare triple {77075#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 163: Hoare triple {77075#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 164: Hoare triple {77075#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,841 INFO L290 TraceCheckUtils]: 165: Hoare triple {77075#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 166: Hoare triple {77075#false} assume 4416 == #t~mem60;havoc #t~mem60; {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 167: Hoare triple {77075#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 168: Hoare triple {77075#false} assume !(3 == ~blastFlag~0); {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 169: Hoare triple {77075#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); {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 170: Hoare triple {77075#false} assume !(0 == ~tmp___6~0); {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 171: Hoare triple {77075#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); {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 172: Hoare triple {77075#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 173: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 174: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 175: Hoare triple {77075#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); {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 176: Hoare triple {77075#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 177: Hoare triple {77075#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 178: Hoare triple {77075#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,842 INFO L290 TraceCheckUtils]: 179: Hoare triple {77075#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 180: Hoare triple {77075#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 181: Hoare triple {77075#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 182: Hoare triple {77075#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 183: Hoare triple {77075#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 184: Hoare triple {77075#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 185: Hoare triple {77075#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 186: Hoare triple {77075#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 187: Hoare triple {77075#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 188: Hoare triple {77075#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 189: Hoare triple {77075#false} assume 4432 == #t~mem62;havoc #t~mem62; {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 190: Hoare triple {77075#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 191: Hoare triple {77075#false} assume 5 == ~blastFlag~0; {77075#false} is VALID [2022-04-08 15:16:07,843 INFO L290 TraceCheckUtils]: 192: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-08 15:16:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-08 15:16:07,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:16:07,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322358192] [2022-04-08 15:16:07,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322358192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:16:07,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:16:07,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:16:07,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:16:07,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1273257216] [2022-04-08 15:16:07,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1273257216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:16:07,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:16:07,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:16:07,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436412887] [2022-04-08 15:16:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:16:07,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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 193 [2022-04-08 15:16:07,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:16:07,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:07,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:07,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:16:07,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:16:07,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:16:07,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:16:07,926 INFO L87 Difference]: Start difference. First operand 1091 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:09,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-08 15:16:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:11,329 INFO L93 Difference]: Finished difference Result 2278 states and 3446 transitions. [2022-04-08 15:16:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:16:11,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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 193 [2022-04-08 15:16:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:16:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-08 15:16:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-08 15:16:11,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-08 15:16:11,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:11,675 INFO L225 Difference]: With dead ends: 2278 [2022-04-08 15:16:11,675 INFO L226 Difference]: Without dead ends: 1372 [2022-04-08 15:16:11,677 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-08 15:16:11,677 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 87 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:16:11,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 537 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 505 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:16:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-04-08 15:16:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1091. [2022-04-08 15:16:11,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:16:11,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:11,725 INFO L74 IsIncluded]: Start isIncluded. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:11,725 INFO L87 Difference]: Start difference. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:11,771 INFO L93 Difference]: Finished difference Result 1372 states and 2053 transitions. [2022-04-08 15:16:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2053 transitions. [2022-04-08 15:16:11,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:16:11,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:16:11,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 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 1372 states. [2022-04-08 15:16:11,774 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 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 1372 states. [2022-04-08 15:16:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:11,819 INFO L93 Difference]: Finished difference Result 1372 states and 2053 transitions. [2022-04-08 15:16:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2053 transitions. [2022-04-08 15:16:11,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:16:11,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:16:11,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:16:11,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:16:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1660 transitions. [2022-04-08 15:16:11,883 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1660 transitions. Word has length 193 [2022-04-08 15:16:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:16:11,884 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1660 transitions. [2022-04-08 15:16:11,884 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:11,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1660 transitions. [2022-04-08 15:16:13,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1660 edges. 1660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1660 transitions. [2022-04-08 15:16:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-08 15:16:13,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:16:13,243 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:16:13,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 15:16:13,243 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:16:13,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:16:13,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1223374947, now seen corresponding path program 1 times [2022-04-08 15:16:13,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:16:13,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1648647122] [2022-04-08 15:16:26,967 WARN L232 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:16:33,901 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:16:33,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1223374947, now seen corresponding path program 2 times [2022-04-08 15:16:33,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:16:33,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982029930] [2022-04-08 15:16:33,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:16:33,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:16:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:16:34,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:16:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:16:34,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {86575#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {86568#true} is VALID [2022-04-08 15:16:34,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {86568#true} assume true; {86568#true} is VALID [2022-04-08 15:16:34,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86568#true} {86568#true} #593#return; {86568#true} is VALID [2022-04-08 15:16:34,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {86568#true} call ULTIMATE.init(); {86575#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:16:34,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {86575#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {86568#true} is VALID [2022-04-08 15:16:34,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {86568#true} assume true; {86568#true} is VALID [2022-04-08 15:16:34,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86568#true} {86568#true} #593#return; {86568#true} is VALID [2022-04-08 15:16:34,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {86568#true} call #t~ret158 := main(); {86568#true} is VALID [2022-04-08 15:16:34,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {86568#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; {86568#true} is VALID [2022-04-08 15:16:34,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {86568#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {86568#true} is VALID [2022-04-08 15:16:34,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {86568#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; {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {86568#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; {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {86568#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {86568#true} assume 12292 == #t~mem49;havoc #t~mem49; {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {86568#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; {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {86568#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {86568#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {86568#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {86568#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {86568#true} assume !(0 == ~tmp___4~0); {86568#true} is VALID [2022-04-08 15:16:34,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {86568#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {86568#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {86568#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {86568#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {86568#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {86568#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {86568#true} assume 4368 == #t~mem54;havoc #t~mem54; {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {86568#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; {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {86568#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {86568#true} is VALID [2022-04-08 15:16:34,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {86568#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; {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {86568#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {86568#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 43: Hoare triple {86568#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {86568#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {86568#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {86568#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {86568#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {86568#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {86568#true} assume 4384 == #t~mem56;havoc #t~mem56; {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 50: Hoare triple {86568#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 51: Hoare triple {86568#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 52: Hoare triple {86568#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 53: Hoare triple {86568#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 54: Hoare triple {86568#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {86568#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 60: Hoare triple {86568#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {86568#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {86568#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,069 INFO L290 TraceCheckUtils]: 63: Hoare triple {86568#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {86568#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 65: Hoare triple {86568#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 66: Hoare triple {86568#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 67: Hoare triple {86568#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 68: Hoare triple {86568#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 69: Hoare triple {86568#true} assume 4400 == #t~mem58;havoc #t~mem58; {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 70: Hoare triple {86568#true} 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); {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 71: Hoare triple {86568#true} 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; {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 72: Hoare triple {86568#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 73: Hoare triple {86568#true} assume !(~ret~0 <= 0); {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 74: Hoare triple {86568#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 75: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 76: Hoare triple {86568#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 77: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-08 15:16:34,070 INFO L290 TraceCheckUtils]: 78: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 79: Hoare triple {86568#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); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 80: Hoare triple {86568#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 81: Hoare triple {86568#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 82: Hoare triple {86568#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 83: Hoare triple {86568#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 84: Hoare triple {86568#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 85: Hoare triple {86568#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 86: Hoare triple {86568#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 87: Hoare triple {86568#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 88: Hoare triple {86568#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 89: Hoare triple {86568#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 90: Hoare triple {86568#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 91: Hoare triple {86568#true} assume 4416 == #t~mem60;havoc #t~mem60; {86568#true} is VALID [2022-04-08 15:16:34,071 INFO L290 TraceCheckUtils]: 92: Hoare triple {86568#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {86568#true} is VALID [2022-04-08 15:16:34,072 INFO L290 TraceCheckUtils]: 93: Hoare triple {86568#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {86568#true} is VALID [2022-04-08 15:16:34,072 INFO L290 TraceCheckUtils]: 94: Hoare triple {86568#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:34,073 INFO L290 TraceCheckUtils]: 95: Hoare triple {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:34,073 INFO L290 TraceCheckUtils]: 96: Hoare triple {86573#(= 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); {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:34,073 INFO L290 TraceCheckUtils]: 97: Hoare triple {86573#(= 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; {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:34,074 INFO L290 TraceCheckUtils]: 98: Hoare triple {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:34,074 INFO L290 TraceCheckUtils]: 99: Hoare triple {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:34,074 INFO L290 TraceCheckUtils]: 100: Hoare triple {86573#(= 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); {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:16:34,075 INFO L290 TraceCheckUtils]: 101: Hoare triple {86573#(= 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); {86574#(= |ssl3_connect_#t~mem50| 4432)} is VALID [2022-04-08 15:16:34,075 INFO L290 TraceCheckUtils]: 102: Hoare triple {86574#(= |ssl3_connect_#t~mem50| 4432)} assume 16384 == #t~mem50;havoc #t~mem50; {86569#false} is VALID [2022-04-08 15:16:34,075 INFO L290 TraceCheckUtils]: 103: Hoare triple {86569#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,075 INFO L290 TraceCheckUtils]: 104: Hoare triple {86569#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {86569#false} is VALID [2022-04-08 15:16:34,075 INFO L290 TraceCheckUtils]: 105: Hoare triple {86569#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,075 INFO L290 TraceCheckUtils]: 106: Hoare triple {86569#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {86569#false} is VALID [2022-04-08 15:16:34,075 INFO L290 TraceCheckUtils]: 107: Hoare triple {86569#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {86569#false} is VALID [2022-04-08 15:16:34,075 INFO L290 TraceCheckUtils]: 108: Hoare triple {86569#false} assume !(0 == ~tmp___4~0); {86569#false} is VALID [2022-04-08 15:16:34,075 INFO L290 TraceCheckUtils]: 109: Hoare triple {86569#false} 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); {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 110: Hoare triple {86569#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); {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 111: Hoare triple {86569#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 112: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 113: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 114: Hoare triple {86569#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); {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 115: Hoare triple {86569#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 116: Hoare triple {86569#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 117: Hoare triple {86569#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 118: Hoare triple {86569#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 119: Hoare triple {86569#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 120: Hoare triple {86569#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 121: Hoare triple {86569#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,076 INFO L290 TraceCheckUtils]: 122: Hoare triple {86569#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 123: Hoare triple {86569#false} assume 4385 == #t~mem57;havoc #t~mem57; {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 124: Hoare triple {86569#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 125: Hoare triple {86569#false} assume !(1 == ~blastFlag~0); {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 126: Hoare triple {86569#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 127: Hoare triple {86569#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 128: Hoare triple {86569#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 129: Hoare triple {86569#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); {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 130: Hoare triple {86569#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 131: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 132: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 133: Hoare triple {86569#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); {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 134: Hoare triple {86569#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 135: Hoare triple {86569#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,077 INFO L290 TraceCheckUtils]: 136: Hoare triple {86569#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 137: Hoare triple {86569#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 138: Hoare triple {86569#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 139: Hoare triple {86569#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 140: Hoare triple {86569#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 141: Hoare triple {86569#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 142: Hoare triple {86569#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 143: Hoare triple {86569#false} assume 4400 == #t~mem58;havoc #t~mem58; {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 144: Hoare triple {86569#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); {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 145: Hoare triple {86569#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; {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 146: Hoare triple {86569#false} assume !(2 == ~blastFlag~0); {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 147: Hoare triple {86569#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 148: Hoare triple {86569#false} assume !(~ret~0 <= 0); {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 149: Hoare triple {86569#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,078 INFO L290 TraceCheckUtils]: 150: Hoare triple {86569#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); {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 151: Hoare triple {86569#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 152: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 153: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 154: Hoare triple {86569#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); {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 155: Hoare triple {86569#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 156: Hoare triple {86569#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 157: Hoare triple {86569#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 158: Hoare triple {86569#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 159: Hoare triple {86569#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 160: Hoare triple {86569#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 161: Hoare triple {86569#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 162: Hoare triple {86569#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 163: Hoare triple {86569#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,079 INFO L290 TraceCheckUtils]: 164: Hoare triple {86569#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 165: Hoare triple {86569#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 166: Hoare triple {86569#false} assume 4416 == #t~mem60;havoc #t~mem60; {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 167: Hoare triple {86569#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 168: Hoare triple {86569#false} assume !(3 == ~blastFlag~0); {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 169: Hoare triple {86569#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); {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 170: Hoare triple {86569#false} assume !(0 == ~tmp___6~0); {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 171: Hoare triple {86569#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); {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 172: Hoare triple {86569#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 173: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 174: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 175: Hoare triple {86569#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); {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 176: Hoare triple {86569#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 177: Hoare triple {86569#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 178: Hoare triple {86569#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,080 INFO L290 TraceCheckUtils]: 179: Hoare triple {86569#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 180: Hoare triple {86569#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 181: Hoare triple {86569#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 182: Hoare triple {86569#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 183: Hoare triple {86569#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 184: Hoare triple {86569#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 185: Hoare triple {86569#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 186: Hoare triple {86569#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 187: Hoare triple {86569#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 188: Hoare triple {86569#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 189: Hoare triple {86569#false} assume 4432 == #t~mem62;havoc #t~mem62; {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 190: Hoare triple {86569#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 191: Hoare triple {86569#false} assume 5 == ~blastFlag~0; {86569#false} is VALID [2022-04-08 15:16:34,081 INFO L290 TraceCheckUtils]: 192: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-08 15:16:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-04-08 15:16:34,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:16:34,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982029930] [2022-04-08 15:16:34,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982029930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:16:34,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:16:34,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:16:34,082 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:16:34,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1648647122] [2022-04-08 15:16:34,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1648647122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:16:34,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:16:34,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:16:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915403553] [2022-04-08 15:16:34,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:16:34,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 193 [2022-04-08 15:16:34,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:16:34,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:34,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:34,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:16:34,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:16:34,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:16:34,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:16:34,164 INFO L87 Difference]: Start difference. First operand 1091 states and 1660 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:36,185 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-08 15:16:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:37,630 INFO L93 Difference]: Finished difference Result 2447 states and 3693 transitions. [2022-04-08 15:16:37,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:16:37,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 193 [2022-04-08 15:16:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:16:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-08 15:16:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-08 15:16:37,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-08 15:16:37,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:37,989 INFO L225 Difference]: With dead ends: 2447 [2022-04-08 15:16:37,989 INFO L226 Difference]: Without dead ends: 1372 [2022-04-08 15:16:37,991 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-08 15:16:37,991 INFO L913 BasicCegarLoop]: 223 mSDtfsCounter, 90 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:16:37,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 535 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 504 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:16:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-04-08 15:16:38,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1091. [2022-04-08 15:16:38,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:16:38,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:38,041 INFO L74 IsIncluded]: Start isIncluded. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:38,042 INFO L87 Difference]: Start difference. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:38,086 INFO L93 Difference]: Finished difference Result 1372 states and 2048 transitions. [2022-04-08 15:16:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2048 transitions. [2022-04-08 15:16:38,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:16:38,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:16:38,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 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 1372 states. [2022-04-08 15:16:38,090 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 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 1372 states. [2022-04-08 15:16:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:38,135 INFO L93 Difference]: Finished difference Result 1372 states and 2048 transitions. [2022-04-08 15:16:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2048 transitions. [2022-04-08 15:16:38,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:16:38,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:16:38,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:16:38,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:16:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1655 transitions. [2022-04-08 15:16:38,190 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1655 transitions. Word has length 193 [2022-04-08 15:16:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:16:38,191 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1655 transitions. [2022-04-08 15:16:38,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:38,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1655 transitions. [2022-04-08 15:16:39,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1655 edges. 1655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1655 transitions. [2022-04-08 15:16:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-08 15:16:39,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:16:39,574 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:16:39,574 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 15:16:39,575 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:16:39,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:16:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1166019930, now seen corresponding path program 1 times [2022-04-08 15:16:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:16:39,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1414808715] [2022-04-08 15:16:51,290 WARN L232 SmtUtils]: Spent 11.03s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:17:03,371 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:17:03,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1166019930, now seen corresponding path program 2 times [2022-04-08 15:17:03,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:17:03,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276617948] [2022-04-08 15:17:03,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:17:03,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:17:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:17:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:17:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:17:03,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {96407#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {96400#true} is VALID [2022-04-08 15:17:03,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {96400#true} assume true; {96400#true} is VALID [2022-04-08 15:17:03,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96400#true} {96400#true} #593#return; {96400#true} is VALID [2022-04-08 15:17:03,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {96400#true} call ULTIMATE.init(); {96407#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:17:03,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {96407#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {96400#true} is VALID [2022-04-08 15:17:03,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {96400#true} assume true; {96400#true} is VALID [2022-04-08 15:17:03,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96400#true} {96400#true} #593#return; {96400#true} is VALID [2022-04-08 15:17:03,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {96400#true} call #t~ret158 := main(); {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {96400#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; {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L272 TraceCheckUtils]: 6: Hoare triple {96400#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {96400#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; {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {96400#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; {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {96400#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {96400#true} assume 12292 == #t~mem49;havoc #t~mem49; {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {96400#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; {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {96400#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {96400#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {96400#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {96400#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {96400#true} assume !(0 == ~tmp___4~0); {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {96400#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {96400#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {96400#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {96400#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {96400#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {96400#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {96400#true} assume 4368 == #t~mem54;havoc #t~mem54; {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {96400#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; {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {96400#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {96400#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; {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {96400#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 39: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {96400#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {96400#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {96400#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {96400#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {96400#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {96400#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {96400#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 49: Hoare triple {96400#true} assume 4384 == #t~mem56;havoc #t~mem56; {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 50: Hoare triple {96400#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 51: Hoare triple {96400#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 52: Hoare triple {96400#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 53: Hoare triple {96400#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 54: Hoare triple {96400#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 55: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {96400#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 58: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {96400#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {96400#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {96400#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {96400#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 64: Hoare triple {96400#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 65: Hoare triple {96400#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {96400#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 67: Hoare triple {96400#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 68: Hoare triple {96400#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 69: Hoare triple {96400#true} assume 4400 == #t~mem58;havoc #t~mem58; {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 70: Hoare triple {96400#true} 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); {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 71: Hoare triple {96400#true} 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; {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 72: Hoare triple {96400#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 73: Hoare triple {96400#true} assume !(~ret~0 <= 0); {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 74: Hoare triple {96400#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,533 INFO L290 TraceCheckUtils]: 75: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 76: Hoare triple {96400#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 77: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 78: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 79: Hoare triple {96400#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); {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 80: Hoare triple {96400#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 81: Hoare triple {96400#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 82: Hoare triple {96400#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 83: Hoare triple {96400#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 84: Hoare triple {96400#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 85: Hoare triple {96400#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 86: Hoare triple {96400#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 87: Hoare triple {96400#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 88: Hoare triple {96400#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,534 INFO L290 TraceCheckUtils]: 89: Hoare triple {96400#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,535 INFO L290 TraceCheckUtils]: 90: Hoare triple {96400#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-08 15:17:03,535 INFO L290 TraceCheckUtils]: 91: Hoare triple {96400#true} assume 4416 == #t~mem60;havoc #t~mem60; {96400#true} is VALID [2022-04-08 15:17:03,535 INFO L290 TraceCheckUtils]: 92: Hoare triple {96400#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {96400#true} is VALID [2022-04-08 15:17:03,535 INFO L290 TraceCheckUtils]: 93: Hoare triple {96400#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {96400#true} is VALID [2022-04-08 15:17:03,536 INFO L290 TraceCheckUtils]: 94: Hoare triple {96400#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:03,536 INFO L290 TraceCheckUtils]: 95: Hoare triple {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:03,536 INFO L290 TraceCheckUtils]: 96: Hoare triple {96405#(= 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); {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:03,537 INFO L290 TraceCheckUtils]: 97: Hoare triple {96405#(= 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; {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:03,537 INFO L290 TraceCheckUtils]: 98: Hoare triple {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:03,537 INFO L290 TraceCheckUtils]: 99: Hoare triple {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:03,538 INFO L290 TraceCheckUtils]: 100: Hoare triple {96405#(= 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); {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:03,538 INFO L290 TraceCheckUtils]: 101: Hoare triple {96405#(= 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); {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:03,538 INFO L290 TraceCheckUtils]: 102: Hoare triple {96405#(= 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); {96406#(= |ssl3_connect_#t~mem51| 4432)} is VALID [2022-04-08 15:17:03,538 INFO L290 TraceCheckUtils]: 103: Hoare triple {96406#(= |ssl3_connect_#t~mem51| 4432)} assume 4096 == #t~mem51;havoc #t~mem51; {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 104: Hoare triple {96401#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 105: Hoare triple {96401#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 106: Hoare triple {96401#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 107: Hoare triple {96401#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 108: Hoare triple {96401#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 109: Hoare triple {96401#false} assume !(0 == ~tmp___4~0); {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 110: Hoare triple {96401#false} 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); {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 111: Hoare triple {96401#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); {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 112: Hoare triple {96401#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 113: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 114: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 115: Hoare triple {96401#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); {96401#false} is VALID [2022-04-08 15:17:03,539 INFO L290 TraceCheckUtils]: 116: Hoare triple {96401#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 117: Hoare triple {96401#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 118: Hoare triple {96401#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 119: Hoare triple {96401#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 120: Hoare triple {96401#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 121: Hoare triple {96401#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 122: Hoare triple {96401#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 123: Hoare triple {96401#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 124: Hoare triple {96401#false} assume 4385 == #t~mem57;havoc #t~mem57; {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 125: Hoare triple {96401#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 126: Hoare triple {96401#false} assume !(1 == ~blastFlag~0); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 127: Hoare triple {96401#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 128: Hoare triple {96401#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 129: Hoare triple {96401#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 130: Hoare triple {96401#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); {96401#false} is VALID [2022-04-08 15:17:03,540 INFO L290 TraceCheckUtils]: 131: Hoare triple {96401#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 132: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 133: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 134: Hoare triple {96401#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); {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 135: Hoare triple {96401#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 136: Hoare triple {96401#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 137: Hoare triple {96401#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 138: Hoare triple {96401#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 139: Hoare triple {96401#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 140: Hoare triple {96401#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 141: Hoare triple {96401#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 142: Hoare triple {96401#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 143: Hoare triple {96401#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 144: Hoare triple {96401#false} assume 4400 == #t~mem58;havoc #t~mem58; {96401#false} is VALID [2022-04-08 15:17:03,541 INFO L290 TraceCheckUtils]: 145: Hoare triple {96401#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); {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 146: Hoare triple {96401#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; {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 147: Hoare triple {96401#false} assume !(2 == ~blastFlag~0); {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 148: Hoare triple {96401#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 149: Hoare triple {96401#false} assume !(~ret~0 <= 0); {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 150: Hoare triple {96401#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 151: Hoare triple {96401#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); {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 152: Hoare triple {96401#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 153: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 154: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 155: Hoare triple {96401#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); {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 156: Hoare triple {96401#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 157: Hoare triple {96401#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 158: Hoare triple {96401#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,542 INFO L290 TraceCheckUtils]: 159: Hoare triple {96401#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 160: Hoare triple {96401#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 161: Hoare triple {96401#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 162: Hoare triple {96401#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 163: Hoare triple {96401#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 164: Hoare triple {96401#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 165: Hoare triple {96401#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 166: Hoare triple {96401#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 167: Hoare triple {96401#false} assume 4416 == #t~mem60;havoc #t~mem60; {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 168: Hoare triple {96401#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 169: Hoare triple {96401#false} assume !(3 == ~blastFlag~0); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 170: Hoare triple {96401#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); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 171: Hoare triple {96401#false} assume !(0 == ~tmp___6~0); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 172: Hoare triple {96401#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); {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 173: Hoare triple {96401#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96401#false} is VALID [2022-04-08 15:17:03,543 INFO L290 TraceCheckUtils]: 174: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 175: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 176: Hoare triple {96401#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); {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 177: Hoare triple {96401#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 178: Hoare triple {96401#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 179: Hoare triple {96401#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 180: Hoare triple {96401#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 181: Hoare triple {96401#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 182: Hoare triple {96401#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 183: Hoare triple {96401#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 184: Hoare triple {96401#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 185: Hoare triple {96401#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,544 INFO L290 TraceCheckUtils]: 186: Hoare triple {96401#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,546 INFO L290 TraceCheckUtils]: 187: Hoare triple {96401#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,546 INFO L290 TraceCheckUtils]: 188: Hoare triple {96401#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,546 INFO L290 TraceCheckUtils]: 189: Hoare triple {96401#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-08 15:17:03,546 INFO L290 TraceCheckUtils]: 190: Hoare triple {96401#false} assume 4432 == #t~mem62;havoc #t~mem62; {96401#false} is VALID [2022-04-08 15:17:03,546 INFO L290 TraceCheckUtils]: 191: Hoare triple {96401#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {96401#false} is VALID [2022-04-08 15:17:03,546 INFO L290 TraceCheckUtils]: 192: Hoare triple {96401#false} assume 5 == ~blastFlag~0; {96401#false} is VALID [2022-04-08 15:17:03,546 INFO L290 TraceCheckUtils]: 193: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-08 15:17:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-04-08 15:17:03,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:17:03,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276617948] [2022-04-08 15:17:03,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276617948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:17:03,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:17:03,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:17:03,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:17:03,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1414808715] [2022-04-08 15:17:03,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1414808715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:17:03,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:17:03,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:17:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701655811] [2022-04-08 15:17:03,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:17:03,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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 194 [2022-04-08 15:17:03,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:17:03,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:03,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:17:03,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:17:03,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:17:03,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:17:03,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:17:03,630 INFO L87 Difference]: Start difference. First operand 1091 states and 1655 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:05,649 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-08 15:17:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:07,106 INFO L93 Difference]: Finished difference Result 2447 states and 3683 transitions. [2022-04-08 15:17:07,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:17:07,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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 194 [2022-04-08 15:17:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:17:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-08 15:17:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-08 15:17:07,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-08 15:17:07,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:17:07,477 INFO L225 Difference]: With dead ends: 2447 [2022-04-08 15:17:07,477 INFO L226 Difference]: Without dead ends: 1372 [2022-04-08 15:17:07,478 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-08 15:17:07,478 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 88 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:17:07,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 533 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 503 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:17:07,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-04-08 15:17:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1091. [2022-04-08 15:17:07,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:17:07,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:07,529 INFO L74 IsIncluded]: Start isIncluded. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:07,530 INFO L87 Difference]: Start difference. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:07,574 INFO L93 Difference]: Finished difference Result 1372 states and 2043 transitions. [2022-04-08 15:17:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2043 transitions. [2022-04-08 15:17:07,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:17:07,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:17:07,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 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 1372 states. [2022-04-08 15:17:07,577 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 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 1372 states. [2022-04-08 15:17:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:07,622 INFO L93 Difference]: Finished difference Result 1372 states and 2043 transitions. [2022-04-08 15:17:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2043 transitions. [2022-04-08 15:17:07,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:17:07,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:17:07,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:17:07,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:17:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1650 transitions. [2022-04-08 15:17:07,675 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1650 transitions. Word has length 194 [2022-04-08 15:17:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:17:07,675 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1650 transitions. [2022-04-08 15:17:07,675 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:07,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1650 transitions. [2022-04-08 15:17:09,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1650 edges. 1650 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:17:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1650 transitions. [2022-04-08 15:17:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-08 15:17:09,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:17:09,050 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:17:09,050 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 15:17:09,050 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:17:09,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:17:09,050 INFO L85 PathProgramCache]: Analyzing trace with hash 164938377, now seen corresponding path program 1 times [2022-04-08 15:17:09,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:17:09,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1800235725] [2022-04-08 15:17:21,563 WARN L232 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:17:29,405 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:17:29,406 INFO L85 PathProgramCache]: Analyzing trace with hash 164938377, now seen corresponding path program 2 times [2022-04-08 15:17:29,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:17:29,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388941131] [2022-04-08 15:17:29,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:17:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:17:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:17:29,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:17:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:17:29,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {106239#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {106232#true} is VALID [2022-04-08 15:17:29,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {106232#true} assume true; {106232#true} is VALID [2022-04-08 15:17:29,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106232#true} {106232#true} #593#return; {106232#true} is VALID [2022-04-08 15:17:29,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {106232#true} call ULTIMATE.init(); {106239#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:17:29,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {106239#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {106232#true} is VALID [2022-04-08 15:17:29,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {106232#true} assume true; {106232#true} is VALID [2022-04-08 15:17:29,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106232#true} {106232#true} #593#return; {106232#true} is VALID [2022-04-08 15:17:29,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {106232#true} call #t~ret158 := main(); {106232#true} is VALID [2022-04-08 15:17:29,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {106232#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; {106232#true} is VALID [2022-04-08 15:17:29,564 INFO L272 TraceCheckUtils]: 6: Hoare triple {106232#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {106232#true} is VALID [2022-04-08 15:17:29,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {106232#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; {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {106232#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; {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {106232#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {106232#true} assume 12292 == #t~mem49;havoc #t~mem49; {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {106232#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; {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {106232#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {106232#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {106232#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {106232#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {106232#true} assume !(0 == ~tmp___4~0); {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {106232#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {106232#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {106232#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {106232#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {106232#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {106232#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {106232#true} assume 4368 == #t~mem54;havoc #t~mem54; {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {106232#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; {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {106232#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {106232#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; {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {106232#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 40: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {106232#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {106232#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 44: Hoare triple {106232#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {106232#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {106232#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {106232#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {106232#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {106232#true} assume 4384 == #t~mem56;havoc #t~mem56; {106232#true} is VALID [2022-04-08 15:17:29,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {106232#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {106232#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {106232#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {106232#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 54: Hoare triple {106232#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 55: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {106232#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 57: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 58: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 59: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 60: Hoare triple {106232#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 61: Hoare triple {106232#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 62: Hoare triple {106232#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 63: Hoare triple {106232#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,568 INFO L290 TraceCheckUtils]: 64: Hoare triple {106232#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 65: Hoare triple {106232#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 66: Hoare triple {106232#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 67: Hoare triple {106232#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 68: Hoare triple {106232#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 69: Hoare triple {106232#true} assume 4400 == #t~mem58;havoc #t~mem58; {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 70: Hoare triple {106232#true} 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); {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 71: Hoare triple {106232#true} 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; {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {106232#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 73: Hoare triple {106232#true} assume !(~ret~0 <= 0); {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 74: Hoare triple {106232#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 75: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 76: Hoare triple {106232#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 77: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 78: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-08 15:17:29,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {106232#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); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 80: Hoare triple {106232#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 81: Hoare triple {106232#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 82: Hoare triple {106232#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 83: Hoare triple {106232#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 84: Hoare triple {106232#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 85: Hoare triple {106232#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 86: Hoare triple {106232#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 87: Hoare triple {106232#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 88: Hoare triple {106232#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 89: Hoare triple {106232#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 90: Hoare triple {106232#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 91: Hoare triple {106232#true} assume 4416 == #t~mem60;havoc #t~mem60; {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 92: Hoare triple {106232#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {106232#true} is VALID [2022-04-08 15:17:29,570 INFO L290 TraceCheckUtils]: 93: Hoare triple {106232#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {106232#true} is VALID [2022-04-08 15:17:29,571 INFO L290 TraceCheckUtils]: 94: Hoare triple {106232#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,572 INFO L290 TraceCheckUtils]: 95: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,572 INFO L290 TraceCheckUtils]: 96: Hoare triple {106237#(not (= 4369 (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); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,572 INFO L290 TraceCheckUtils]: 97: Hoare triple {106237#(not (= 4369 (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; {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,573 INFO L290 TraceCheckUtils]: 98: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,573 INFO L290 TraceCheckUtils]: 99: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,573 INFO L290 TraceCheckUtils]: 100: Hoare triple {106237#(not (= 4369 (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); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,573 INFO L290 TraceCheckUtils]: 101: Hoare triple {106237#(not (= 4369 (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); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,574 INFO L290 TraceCheckUtils]: 102: Hoare triple {106237#(not (= 4369 (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); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,574 INFO L290 TraceCheckUtils]: 103: Hoare triple {106237#(not (= 4369 (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); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,574 INFO L290 TraceCheckUtils]: 104: Hoare triple {106237#(not (= 4369 (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); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,575 INFO L290 TraceCheckUtils]: 105: Hoare triple {106237#(not (= 4369 (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); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:17:29,575 INFO L290 TraceCheckUtils]: 106: Hoare triple {106237#(not (= 4369 (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); {106238#(not (= 4369 |ssl3_connect_#t~mem55|))} is VALID [2022-04-08 15:17:29,575 INFO L290 TraceCheckUtils]: 107: Hoare triple {106238#(not (= 4369 |ssl3_connect_#t~mem55|))} assume 4369 == #t~mem55;havoc #t~mem55; {106233#false} is VALID [2022-04-08 15:17:29,575 INFO L290 TraceCheckUtils]: 108: Hoare triple {106233#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {106233#false} is VALID [2022-04-08 15:17:29,575 INFO L290 TraceCheckUtils]: 109: Hoare triple {106233#false} assume !(0 == ~blastFlag~0); {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 110: Hoare triple {106233#false} 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); {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 111: Hoare triple {106233#false} 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; {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 112: Hoare triple {106233#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); {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 113: Hoare triple {106233#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 114: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 115: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 116: Hoare triple {106233#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); {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 117: Hoare triple {106233#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 118: Hoare triple {106233#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 119: Hoare triple {106233#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 120: Hoare triple {106233#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 121: Hoare triple {106233#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 122: Hoare triple {106233#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 123: Hoare triple {106233#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,576 INFO L290 TraceCheckUtils]: 124: Hoare triple {106233#false} assume 4384 == #t~mem56;havoc #t~mem56; {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 125: Hoare triple {106233#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 126: Hoare triple {106233#false} assume !(1 == ~blastFlag~0); {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 127: Hoare triple {106233#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 128: Hoare triple {106233#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 129: Hoare triple {106233#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 130: Hoare triple {106233#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); {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 131: Hoare triple {106233#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 132: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 133: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 134: Hoare triple {106233#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); {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 135: Hoare triple {106233#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 136: Hoare triple {106233#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 137: Hoare triple {106233#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,577 INFO L290 TraceCheckUtils]: 138: Hoare triple {106233#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 139: Hoare triple {106233#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 140: Hoare triple {106233#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 141: Hoare triple {106233#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 142: Hoare triple {106233#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 143: Hoare triple {106233#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 144: Hoare triple {106233#false} assume 4400 == #t~mem58;havoc #t~mem58; {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 145: Hoare triple {106233#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); {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 146: Hoare triple {106233#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; {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 147: Hoare triple {106233#false} assume !(2 == ~blastFlag~0); {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 148: Hoare triple {106233#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 149: Hoare triple {106233#false} assume !(~ret~0 <= 0); {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 150: Hoare triple {106233#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 151: Hoare triple {106233#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); {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 152: Hoare triple {106233#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106233#false} is VALID [2022-04-08 15:17:29,578 INFO L290 TraceCheckUtils]: 153: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 154: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 155: Hoare triple {106233#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); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 156: Hoare triple {106233#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 157: Hoare triple {106233#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 158: Hoare triple {106233#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 159: Hoare triple {106233#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 160: Hoare triple {106233#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 161: Hoare triple {106233#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 162: Hoare triple {106233#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 163: Hoare triple {106233#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 164: Hoare triple {106233#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 165: Hoare triple {106233#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 166: Hoare triple {106233#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,579 INFO L290 TraceCheckUtils]: 167: Hoare triple {106233#false} assume 4416 == #t~mem60;havoc #t~mem60; {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 168: Hoare triple {106233#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 169: Hoare triple {106233#false} assume !(3 == ~blastFlag~0); {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 170: Hoare triple {106233#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); {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 171: Hoare triple {106233#false} assume !(0 == ~tmp___6~0); {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 172: Hoare triple {106233#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); {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 173: Hoare triple {106233#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 174: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 175: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 176: Hoare triple {106233#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); {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 177: Hoare triple {106233#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 178: Hoare triple {106233#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 179: Hoare triple {106233#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 180: Hoare triple {106233#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,580 INFO L290 TraceCheckUtils]: 181: Hoare triple {106233#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 182: Hoare triple {106233#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 183: Hoare triple {106233#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 184: Hoare triple {106233#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 185: Hoare triple {106233#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 186: Hoare triple {106233#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 187: Hoare triple {106233#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 188: Hoare triple {106233#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 189: Hoare triple {106233#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 190: Hoare triple {106233#false} assume 4432 == #t~mem62;havoc #t~mem62; {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 191: Hoare triple {106233#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 192: Hoare triple {106233#false} assume 5 == ~blastFlag~0; {106233#false} is VALID [2022-04-08 15:17:29,581 INFO L290 TraceCheckUtils]: 193: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-08 15:17:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-08 15:17:29,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:17:29,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388941131] [2022-04-08 15:17:29,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388941131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:17:29,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:17:29,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:17:29,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:17:29,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1800235725] [2022-04-08 15:17:29,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1800235725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:17:29,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:17:29,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:17:29,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609549814] [2022-04-08 15:17:29,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:17:29,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 194 [2022-04-08 15:17:29,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:17:29,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:29,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:17:29,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:17:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:17:29,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:17:29,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:17:29,664 INFO L87 Difference]: Start difference. First operand 1091 states and 1650 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:31,683 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-08 15:17:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:33,100 INFO L93 Difference]: Finished difference Result 2524 states and 3784 transitions. [2022-04-08 15:17:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:17:33,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 194 [2022-04-08 15:17:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:17:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 15:17:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 15:17:33,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-08 15:17:33,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:17:33,503 INFO L225 Difference]: With dead ends: 2524 [2022-04-08 15:17:33,503 INFO L226 Difference]: Without dead ends: 1618 [2022-04-08 15:17:33,504 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-08 15:17:33,504 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 112 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:17:33,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 484 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 491 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:17:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2022-04-08 15:17:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1193. [2022-04-08 15:17:33,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:17:33,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1618 states. Second operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:33,577 INFO L74 IsIncluded]: Start isIncluded. First operand 1618 states. Second operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:33,578 INFO L87 Difference]: Start difference. First operand 1618 states. Second operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:33,648 INFO L93 Difference]: Finished difference Result 1618 states and 2387 transitions. [2022-04-08 15:17:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2387 transitions. [2022-04-08 15:17:33,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:17:33,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:17:33,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 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 1618 states. [2022-04-08 15:17:33,652 INFO L87 Difference]: Start difference. First operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 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 1618 states. [2022-04-08 15:17:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:33,725 INFO L93 Difference]: Finished difference Result 1618 states and 2387 transitions. [2022-04-08 15:17:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2387 transitions. [2022-04-08 15:17:33,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:17:33,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:17:33,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:17:33,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:17:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1797 transitions. [2022-04-08 15:17:33,782 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1797 transitions. Word has length 194 [2022-04-08 15:17:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:17:33,782 INFO L478 AbstractCegarLoop]: Abstraction has 1193 states and 1797 transitions. [2022-04-08 15:17:33,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:33,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1193 states and 1797 transitions. [2022-04-08 15:17:35,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1797 edges. 1797 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:17:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1797 transitions. [2022-04-08 15:17:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-08 15:17:35,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:17:35,367 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:17:35,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 15:17:35,367 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:17:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:17:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1168473336, now seen corresponding path program 1 times [2022-04-08 15:17:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:17:35,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [607774923] [2022-04-08 15:17:47,799 WARN L232 SmtUtils]: Spent 6.93s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:17:54,614 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:17:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1168473336, now seen corresponding path program 2 times [2022-04-08 15:17:54,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:17:54,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822309426] [2022-04-08 15:17:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:17:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:17:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:17:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:17:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:17:54,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {116921#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {116914#true} is VALID [2022-04-08 15:17:54,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {116914#true} assume true; {116914#true} is VALID [2022-04-08 15:17:54,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116914#true} {116914#true} #593#return; {116914#true} is VALID [2022-04-08 15:17:54,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {116914#true} call ULTIMATE.init(); {116921#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:17:54,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {116921#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {116914#true} is VALID [2022-04-08 15:17:54,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {116914#true} assume true; {116914#true} is VALID [2022-04-08 15:17:54,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116914#true} {116914#true} #593#return; {116914#true} is VALID [2022-04-08 15:17:54,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {116914#true} call #t~ret158 := main(); {116914#true} is VALID [2022-04-08 15:17:54,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {116914#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; {116914#true} is VALID [2022-04-08 15:17:54,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {116914#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {116914#true} is VALID [2022-04-08 15:17:54,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {116914#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; {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {116914#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; {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {116914#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {116914#true} assume 12292 == #t~mem49;havoc #t~mem49; {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {116914#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; {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {116914#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {116914#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {116914#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {116914#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {116914#true} assume !(0 == ~tmp___4~0); {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {116914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {116914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {116914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {116914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {116914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {116914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {116914#true} assume 4368 == #t~mem54;havoc #t~mem54; {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {116914#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; {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {116914#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {116914#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; {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {116914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {116914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {116914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {116914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {116914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {116914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {116914#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {116914#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {116914#true} assume 4384 == #t~mem56;havoc #t~mem56; {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {116914#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {116914#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {116914#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {116914#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {116914#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {116914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 60: Hoare triple {116914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 61: Hoare triple {116914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 62: Hoare triple {116914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,773 INFO L290 TraceCheckUtils]: 63: Hoare triple {116914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {116914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 65: Hoare triple {116914#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 66: Hoare triple {116914#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {116914#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {116914#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 69: Hoare triple {116914#true} assume 4400 == #t~mem58;havoc #t~mem58; {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 70: Hoare triple {116914#true} 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); {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 71: Hoare triple {116914#true} 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; {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 72: Hoare triple {116914#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 73: Hoare triple {116914#true} assume !(~ret~0 <= 0); {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 74: Hoare triple {116914#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 75: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 76: Hoare triple {116914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116914#true} is VALID [2022-04-08 15:17:54,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 79: Hoare triple {116914#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); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 80: Hoare triple {116914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 81: Hoare triple {116914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 82: Hoare triple {116914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 83: Hoare triple {116914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 84: Hoare triple {116914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 85: Hoare triple {116914#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 86: Hoare triple {116914#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 87: Hoare triple {116914#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 88: Hoare triple {116914#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 89: Hoare triple {116914#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 90: Hoare triple {116914#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-08 15:17:54,775 INFO L290 TraceCheckUtils]: 91: Hoare triple {116914#true} assume 4416 == #t~mem60;havoc #t~mem60; {116914#true} is VALID [2022-04-08 15:17:54,776 INFO L290 TraceCheckUtils]: 92: Hoare triple {116914#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {116914#true} is VALID [2022-04-08 15:17:54,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {116914#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116914#true} is VALID [2022-04-08 15:17:54,776 INFO L290 TraceCheckUtils]: 94: Hoare triple {116914#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:54,777 INFO L290 TraceCheckUtils]: 95: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:54,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {116919#(= 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); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:54,777 INFO L290 TraceCheckUtils]: 97: Hoare triple {116919#(= 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; {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:54,778 INFO L290 TraceCheckUtils]: 98: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:54,778 INFO L290 TraceCheckUtils]: 99: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:54,778 INFO L290 TraceCheckUtils]: 100: Hoare triple {116919#(= 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); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:54,779 INFO L290 TraceCheckUtils]: 101: Hoare triple {116919#(= 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); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:54,779 INFO L290 TraceCheckUtils]: 102: Hoare triple {116919#(= 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); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:54,779 INFO L290 TraceCheckUtils]: 103: Hoare triple {116919#(= 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); {116920#(= |ssl3_connect_#t~mem52| 4432)} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 104: Hoare triple {116920#(= |ssl3_connect_#t~mem52| 4432)} assume 20480 == #t~mem52;havoc #t~mem52; {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 105: Hoare triple {116915#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 106: Hoare triple {116915#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 107: Hoare triple {116915#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 108: Hoare triple {116915#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 109: Hoare triple {116915#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 110: Hoare triple {116915#false} assume !(0 == ~tmp___4~0); {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 111: Hoare triple {116915#false} 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); {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 112: Hoare triple {116915#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); {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 113: Hoare triple {116915#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 114: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 115: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 116: Hoare triple {116915#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); {116915#false} is VALID [2022-04-08 15:17:54,780 INFO L290 TraceCheckUtils]: 117: Hoare triple {116915#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 118: Hoare triple {116915#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 119: Hoare triple {116915#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 120: Hoare triple {116915#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 121: Hoare triple {116915#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 122: Hoare triple {116915#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 123: Hoare triple {116915#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 124: Hoare triple {116915#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 125: Hoare triple {116915#false} assume 4385 == #t~mem57;havoc #t~mem57; {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 126: Hoare triple {116915#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 127: Hoare triple {116915#false} assume !(1 == ~blastFlag~0); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 128: Hoare triple {116915#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 129: Hoare triple {116915#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 130: Hoare triple {116915#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,781 INFO L290 TraceCheckUtils]: 131: Hoare triple {116915#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); {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 132: Hoare triple {116915#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 133: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 134: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 135: Hoare triple {116915#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); {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 136: Hoare triple {116915#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 137: Hoare triple {116915#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 138: Hoare triple {116915#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 139: Hoare triple {116915#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 140: Hoare triple {116915#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 141: Hoare triple {116915#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 142: Hoare triple {116915#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 143: Hoare triple {116915#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 144: Hoare triple {116915#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,782 INFO L290 TraceCheckUtils]: 145: Hoare triple {116915#false} assume 4400 == #t~mem58;havoc #t~mem58; {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 146: Hoare triple {116915#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); {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 147: Hoare triple {116915#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; {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 148: Hoare triple {116915#false} assume !(2 == ~blastFlag~0); {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 149: Hoare triple {116915#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 150: Hoare triple {116915#false} assume !(~ret~0 <= 0); {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 151: Hoare triple {116915#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 152: Hoare triple {116915#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); {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 153: Hoare triple {116915#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 154: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 155: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 156: Hoare triple {116915#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); {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 157: Hoare triple {116915#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 158: Hoare triple {116915#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,783 INFO L290 TraceCheckUtils]: 159: Hoare triple {116915#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 160: Hoare triple {116915#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 161: Hoare triple {116915#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 162: Hoare triple {116915#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 163: Hoare triple {116915#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 164: Hoare triple {116915#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 165: Hoare triple {116915#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 166: Hoare triple {116915#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 167: Hoare triple {116915#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 168: Hoare triple {116915#false} assume 4416 == #t~mem60;havoc #t~mem60; {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 169: Hoare triple {116915#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 170: Hoare triple {116915#false} assume !(3 == ~blastFlag~0); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 171: Hoare triple {116915#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); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 172: Hoare triple {116915#false} assume !(0 == ~tmp___6~0); {116915#false} is VALID [2022-04-08 15:17:54,784 INFO L290 TraceCheckUtils]: 173: Hoare triple {116915#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); {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 174: Hoare triple {116915#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 175: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 176: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 177: Hoare triple {116915#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); {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 178: Hoare triple {116915#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 179: Hoare triple {116915#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 180: Hoare triple {116915#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 181: Hoare triple {116915#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 182: Hoare triple {116915#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 183: Hoare triple {116915#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 184: Hoare triple {116915#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 185: Hoare triple {116915#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 186: Hoare triple {116915#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,785 INFO L290 TraceCheckUtils]: 187: Hoare triple {116915#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,786 INFO L290 TraceCheckUtils]: 188: Hoare triple {116915#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,786 INFO L290 TraceCheckUtils]: 189: Hoare triple {116915#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,786 INFO L290 TraceCheckUtils]: 190: Hoare triple {116915#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-08 15:17:54,786 INFO L290 TraceCheckUtils]: 191: Hoare triple {116915#false} assume 4432 == #t~mem62;havoc #t~mem62; {116915#false} is VALID [2022-04-08 15:17:54,786 INFO L290 TraceCheckUtils]: 192: Hoare triple {116915#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116915#false} is VALID [2022-04-08 15:17:54,786 INFO L290 TraceCheckUtils]: 193: Hoare triple {116915#false} assume 5 == ~blastFlag~0; {116915#false} is VALID [2022-04-08 15:17:54,786 INFO L290 TraceCheckUtils]: 194: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-08 15:17:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-04-08 15:17:54,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:17:54,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822309426] [2022-04-08 15:17:54,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822309426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:17:54,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:17:54,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:17:54,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:17:54,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [607774923] [2022-04-08 15:17:54,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [607774923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:17:54,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:17:54,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:17:54,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638217498] [2022-04-08 15:17:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:17:54,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 195 [2022-04-08 15:17:54,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:17:54,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:54,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:17:54,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:17:54,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:17:54,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:17:54,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:17:54,855 INFO L87 Difference]: Start difference. First operand 1193 states and 1797 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:56,874 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-08 15:17:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:58,314 INFO L93 Difference]: Finished difference Result 2637 states and 3952 transitions. [2022-04-08 15:17:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:17:58,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 195 [2022-04-08 15:17:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:17:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-08 15:17:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-08 15:17:58,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-08 15:17:58,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:17:58,671 INFO L225 Difference]: With dead ends: 2637 [2022-04-08 15:17:58,671 INFO L226 Difference]: Without dead ends: 1460 [2022-04-08 15:17:58,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:17:58,673 INFO L913 BasicCegarLoop]: 218 mSDtfsCounter, 83 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:17:58,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 525 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 492 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:17:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2022-04-08 15:17:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1193. [2022-04-08 15:17:58,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:17:58,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1460 states. Second operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:58,746 INFO L74 IsIncluded]: Start isIncluded. First operand 1460 states. Second operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:58,747 INFO L87 Difference]: Start difference. First operand 1460 states. Second operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:58,796 INFO L93 Difference]: Finished difference Result 1460 states and 2170 transitions. [2022-04-08 15:17:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2170 transitions. [2022-04-08 15:17:58,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:17:58,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:17:58,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 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 1460 states. [2022-04-08 15:17:58,798 INFO L87 Difference]: Start difference. First operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 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 1460 states. [2022-04-08 15:17:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:58,848 INFO L93 Difference]: Finished difference Result 1460 states and 2170 transitions. [2022-04-08 15:17:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2170 transitions. [2022-04-08 15:17:58,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:17:58,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:17:58,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:17:58,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:17:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1792 transitions. [2022-04-08 15:17:58,899 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1792 transitions. Word has length 195 [2022-04-08 15:17:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:17:58,899 INFO L478 AbstractCegarLoop]: Abstraction has 1193 states and 1792 transitions. [2022-04-08 15:17:58,899 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:58,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1193 states and 1792 transitions. [2022-04-08 15:18:00,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1792 edges. 1792 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:18:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1792 transitions. [2022-04-08 15:18:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-08 15:18:00,470 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:18:00,470 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:18:00,470 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 15:18:00,470 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:18:00,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:18:00,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1079808289, now seen corresponding path program 1 times [2022-04-08 15:18:00,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:18:00,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1844353349] [2022-04-08 15:18:13,890 WARN L232 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:18:20,862 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:18:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1079808289, now seen corresponding path program 2 times [2022-04-08 15:18:20,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:18:20,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613756361] [2022-04-08 15:18:20,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:18:20,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:18:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:18:21,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:18:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:18:21,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {127513#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {127506#true} is VALID [2022-04-08 15:18:21,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {127506#true} assume true; {127506#true} is VALID [2022-04-08 15:18:21,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127506#true} {127506#true} #593#return; {127506#true} is VALID [2022-04-08 15:18:21,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {127506#true} call ULTIMATE.init(); {127513#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:18:21,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {127513#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {127506#true} is VALID [2022-04-08 15:18:21,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {127506#true} assume true; {127506#true} is VALID [2022-04-08 15:18:21,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127506#true} {127506#true} #593#return; {127506#true} is VALID [2022-04-08 15:18:21,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {127506#true} call #t~ret158 := main(); {127506#true} is VALID [2022-04-08 15:18:21,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {127506#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; {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {127506#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {127506#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; {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {127506#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; {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {127506#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {127506#true} assume 12292 == #t~mem49;havoc #t~mem49; {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {127506#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; {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {127506#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {127506#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {127506#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {127506#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {127506#true} assume !(0 == ~tmp___4~0); {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {127506#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {127506#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {127506#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {127506#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {127506#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {127506#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {127506#true} assume 4368 == #t~mem54;havoc #t~mem54; {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {127506#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; {127506#true} is VALID [2022-04-08 15:18:21,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {127506#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {127506#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; {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {127506#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {127506#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {127506#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {127506#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {127506#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 46: Hoare triple {127506#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 47: Hoare triple {127506#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {127506#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {127506#true} assume 4384 == #t~mem56;havoc #t~mem56; {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 50: Hoare triple {127506#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 51: Hoare triple {127506#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 52: Hoare triple {127506#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 53: Hoare triple {127506#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 54: Hoare triple {127506#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {127506#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 57: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 58: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 59: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {127506#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {127506#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {127506#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {127506#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 64: Hoare triple {127506#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 65: Hoare triple {127506#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 66: Hoare triple {127506#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 67: Hoare triple {127506#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {127506#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {127506#true} assume 4400 == #t~mem58;havoc #t~mem58; {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 70: Hoare triple {127506#true} 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); {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 71: Hoare triple {127506#true} 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; {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 72: Hoare triple {127506#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 73: Hoare triple {127506#true} assume !(~ret~0 <= 0); {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 74: Hoare triple {127506#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 75: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 76: Hoare triple {127506#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127506#true} is VALID [2022-04-08 15:18:21,019 INFO L290 TraceCheckUtils]: 77: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 78: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 79: Hoare triple {127506#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); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 80: Hoare triple {127506#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 81: Hoare triple {127506#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 82: Hoare triple {127506#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 83: Hoare triple {127506#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 84: Hoare triple {127506#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 85: Hoare triple {127506#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 86: Hoare triple {127506#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 87: Hoare triple {127506#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 88: Hoare triple {127506#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 89: Hoare triple {127506#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 90: Hoare triple {127506#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-08 15:18:21,020 INFO L290 TraceCheckUtils]: 91: Hoare triple {127506#true} assume 4416 == #t~mem60;havoc #t~mem60; {127506#true} is VALID [2022-04-08 15:18:21,021 INFO L290 TraceCheckUtils]: 92: Hoare triple {127506#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {127506#true} is VALID [2022-04-08 15:18:21,021 INFO L290 TraceCheckUtils]: 93: Hoare triple {127506#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {127506#true} is VALID [2022-04-08 15:18:21,021 INFO L290 TraceCheckUtils]: 94: Hoare triple {127506#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:18:21,022 INFO L290 TraceCheckUtils]: 95: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:18:21,022 INFO L290 TraceCheckUtils]: 96: Hoare triple {127511#(= 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); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:18:21,022 INFO L290 TraceCheckUtils]: 97: Hoare triple {127511#(= 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; {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:18:21,023 INFO L290 TraceCheckUtils]: 98: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:18:21,023 INFO L290 TraceCheckUtils]: 99: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:18:21,023 INFO L290 TraceCheckUtils]: 100: Hoare triple {127511#(= 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); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:18:21,024 INFO L290 TraceCheckUtils]: 101: Hoare triple {127511#(= 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); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:18:21,024 INFO L290 TraceCheckUtils]: 102: Hoare triple {127511#(= 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); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:18:21,024 INFO L290 TraceCheckUtils]: 103: Hoare triple {127511#(= 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); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:18:21,025 INFO L290 TraceCheckUtils]: 104: Hoare triple {127511#(= 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); {127512#(= |ssl3_connect_#t~mem53| 4432)} is VALID [2022-04-08 15:18:21,025 INFO L290 TraceCheckUtils]: 105: Hoare triple {127512#(= |ssl3_connect_#t~mem53| 4432)} assume 4099 == #t~mem53;havoc #t~mem53; {127507#false} is VALID [2022-04-08 15:18:21,025 INFO L290 TraceCheckUtils]: 106: Hoare triple {127507#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,025 INFO L290 TraceCheckUtils]: 107: Hoare triple {127507#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {127507#false} is VALID [2022-04-08 15:18:21,025 INFO L290 TraceCheckUtils]: 108: Hoare triple {127507#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,025 INFO L290 TraceCheckUtils]: 109: Hoare triple {127507#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {127507#false} is VALID [2022-04-08 15:18:21,025 INFO L290 TraceCheckUtils]: 110: Hoare triple {127507#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 111: Hoare triple {127507#false} assume !(0 == ~tmp___4~0); {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 112: Hoare triple {127507#false} 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); {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 113: Hoare triple {127507#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); {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 114: Hoare triple {127507#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 115: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 116: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 117: Hoare triple {127507#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); {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 118: Hoare triple {127507#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 119: Hoare triple {127507#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 120: Hoare triple {127507#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 121: Hoare triple {127507#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 122: Hoare triple {127507#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 123: Hoare triple {127507#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 124: Hoare triple {127507#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,026 INFO L290 TraceCheckUtils]: 125: Hoare triple {127507#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 126: Hoare triple {127507#false} assume 4385 == #t~mem57;havoc #t~mem57; {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 127: Hoare triple {127507#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 128: Hoare triple {127507#false} assume !(1 == ~blastFlag~0); {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 129: Hoare triple {127507#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 130: Hoare triple {127507#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 131: Hoare triple {127507#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 132: Hoare triple {127507#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); {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 133: Hoare triple {127507#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 134: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 135: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 136: Hoare triple {127507#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); {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 137: Hoare triple {127507#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 138: Hoare triple {127507#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 139: Hoare triple {127507#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,027 INFO L290 TraceCheckUtils]: 140: Hoare triple {127507#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 141: Hoare triple {127507#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 142: Hoare triple {127507#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 143: Hoare triple {127507#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 144: Hoare triple {127507#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 145: Hoare triple {127507#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 146: Hoare triple {127507#false} assume 4400 == #t~mem58;havoc #t~mem58; {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 147: Hoare triple {127507#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); {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 148: Hoare triple {127507#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; {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 149: Hoare triple {127507#false} assume !(2 == ~blastFlag~0); {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 150: Hoare triple {127507#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 151: Hoare triple {127507#false} assume !(~ret~0 <= 0); {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 152: Hoare triple {127507#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 153: Hoare triple {127507#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); {127507#false} is VALID [2022-04-08 15:18:21,028 INFO L290 TraceCheckUtils]: 154: Hoare triple {127507#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 155: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 156: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 157: Hoare triple {127507#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); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 158: Hoare triple {127507#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 159: Hoare triple {127507#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 160: Hoare triple {127507#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 161: Hoare triple {127507#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 162: Hoare triple {127507#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 163: Hoare triple {127507#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 164: Hoare triple {127507#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 165: Hoare triple {127507#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 166: Hoare triple {127507#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 167: Hoare triple {127507#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 168: Hoare triple {127507#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,029 INFO L290 TraceCheckUtils]: 169: Hoare triple {127507#false} assume 4416 == #t~mem60;havoc #t~mem60; {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 170: Hoare triple {127507#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 171: Hoare triple {127507#false} assume !(3 == ~blastFlag~0); {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 172: Hoare triple {127507#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); {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 173: Hoare triple {127507#false} assume !(0 == ~tmp___6~0); {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 174: Hoare triple {127507#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); {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 175: Hoare triple {127507#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 176: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 177: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 178: Hoare triple {127507#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); {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 179: Hoare triple {127507#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 180: Hoare triple {127507#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 181: Hoare triple {127507#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 182: Hoare triple {127507#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 183: Hoare triple {127507#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,030 INFO L290 TraceCheckUtils]: 184: Hoare triple {127507#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,031 INFO L290 TraceCheckUtils]: 185: Hoare triple {127507#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,031 INFO L290 TraceCheckUtils]: 186: Hoare triple {127507#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,031 INFO L290 TraceCheckUtils]: 187: Hoare triple {127507#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,031 INFO L290 TraceCheckUtils]: 188: Hoare triple {127507#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,031 INFO L290 TraceCheckUtils]: 189: Hoare triple {127507#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,031 INFO L290 TraceCheckUtils]: 190: Hoare triple {127507#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,031 INFO L290 TraceCheckUtils]: 191: Hoare triple {127507#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-08 15:18:21,031 INFO L290 TraceCheckUtils]: 192: Hoare triple {127507#false} assume 4432 == #t~mem62;havoc #t~mem62; {127507#false} is VALID [2022-04-08 15:18:21,031 INFO L290 TraceCheckUtils]: 193: Hoare triple {127507#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {127507#false} is VALID [2022-04-08 15:18:21,031 INFO L290 TraceCheckUtils]: 194: Hoare triple {127507#false} assume 5 == ~blastFlag~0; {127507#false} is VALID [2022-04-08 15:18:21,031 INFO L290 TraceCheckUtils]: 195: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-08 15:18:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-04-08 15:18:21,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:18:21,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613756361] [2022-04-08 15:18:21,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613756361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:18:21,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:18:21,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:18:21,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:18:21,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1844353349] [2022-04-08 15:18:21,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1844353349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:18:21,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:18:21,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:18:21,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920220372] [2022-04-08 15:18:21,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:18:21,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 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 196 [2022-04-08 15:18:21,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:18:21,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:21,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:18:21,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:18:21,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:18:21,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:18:21,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:18:21,109 INFO L87 Difference]: Start difference. First operand 1193 states and 1792 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:23,135 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-08 15:18:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:18:24,504 INFO L93 Difference]: Finished difference Result 2592 states and 3887 transitions. [2022-04-08 15:18:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:18:24,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 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 196 [2022-04-08 15:18:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:18:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-08 15:18:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-08 15:18:24,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 433 transitions. [2022-04-08 15:18:24,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:18:24,862 INFO L225 Difference]: With dead ends: 2592 [2022-04-08 15:18:24,862 INFO L226 Difference]: Without dead ends: 1415 [2022-04-08 15:18:24,864 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-08 15:18:24,864 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 74 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:18:24,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 511 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:18:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2022-04-08 15:18:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1193. [2022-04-08 15:18:24,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:18:24,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1415 states. Second operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:24,930 INFO L74 IsIncluded]: Start isIncluded. First operand 1415 states. Second operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:24,931 INFO L87 Difference]: Start difference. First operand 1415 states. Second operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:18:24,988 INFO L93 Difference]: Finished difference Result 1415 states and 2110 transitions. [2022-04-08 15:18:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2110 transitions. [2022-04-08 15:18:24,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:18:24,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:18:24,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 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 1415 states. [2022-04-08 15:18:24,991 INFO L87 Difference]: Start difference. First operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 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 1415 states. [2022-04-08 15:18:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:18:25,039 INFO L93 Difference]: Finished difference Result 1415 states and 2110 transitions. [2022-04-08 15:18:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2110 transitions. [2022-04-08 15:18:25,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:18:25,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:18:25,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:18:25,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:18:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1787 transitions. [2022-04-08 15:18:25,090 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1787 transitions. Word has length 196 [2022-04-08 15:18:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:18:25,090 INFO L478 AbstractCegarLoop]: Abstraction has 1193 states and 1787 transitions. [2022-04-08 15:18:25,090 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:25,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1193 states and 1787 transitions. [2022-04-08 15:18:26,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1787 edges. 1787 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:18:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1787 transitions. [2022-04-08 15:18:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-08 15:18:26,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:18:26,664 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:18:26,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 15:18:26,664 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:18:26,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:18:26,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2125464036, now seen corresponding path program 1 times [2022-04-08 15:18:26,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:18:26,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1180423666] [2022-04-08 15:18:43,004 WARN L232 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:18:52,345 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:18:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2125464036, now seen corresponding path program 2 times [2022-04-08 15:18:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:18:52,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422641655] [2022-04-08 15:18:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:18:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:18:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:18:52,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:18:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:18:52,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {137925#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {137918#true} is VALID [2022-04-08 15:18:52,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {137918#true} assume true; {137918#true} is VALID [2022-04-08 15:18:52,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137918#true} {137918#true} #593#return; {137918#true} is VALID [2022-04-08 15:18:52,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {137918#true} call ULTIMATE.init(); {137925#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:18:52,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {137925#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {137918#true} is VALID [2022-04-08 15:18:52,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {137918#true} assume true; {137918#true} is VALID [2022-04-08 15:18:52,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137918#true} {137918#true} #593#return; {137918#true} is VALID [2022-04-08 15:18:52,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {137918#true} call #t~ret158 := main(); {137918#true} is VALID [2022-04-08 15:18:52,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {137918#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; {137918#true} is VALID [2022-04-08 15:18:52,533 INFO L272 TraceCheckUtils]: 6: Hoare triple {137918#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {137918#true} is VALID [2022-04-08 15:18:52,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {137918#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; {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {137918#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; {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {137918#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {137918#true} assume 12292 == #t~mem49;havoc #t~mem49; {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {137918#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; {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {137918#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {137918#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {137918#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {137918#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {137918#true} assume !(0 == ~tmp___4~0); {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {137918#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {137918#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {137918#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {137918#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {137918#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {137918#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {137918#true} assume 4368 == #t~mem54;havoc #t~mem54; {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {137918#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; {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {137918#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {137918#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; {137918#true} is VALID [2022-04-08 15:18:52,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {137918#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {137918#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 43: Hoare triple {137918#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {137918#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {137918#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 46: Hoare triple {137918#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 47: Hoare triple {137918#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 48: Hoare triple {137918#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {137918#true} assume 4384 == #t~mem56;havoc #t~mem56; {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {137918#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {137918#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {137918#true} is VALID [2022-04-08 15:18:52,536 INFO L290 TraceCheckUtils]: 52: Hoare triple {137918#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {137918#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {137918#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 55: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 56: Hoare triple {137918#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 57: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 59: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 60: Hoare triple {137918#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 61: Hoare triple {137918#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 62: Hoare triple {137918#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 63: Hoare triple {137918#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 64: Hoare triple {137918#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 65: Hoare triple {137918#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,537 INFO L290 TraceCheckUtils]: 66: Hoare triple {137918#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 67: Hoare triple {137918#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 68: Hoare triple {137918#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 69: Hoare triple {137918#true} assume 4400 == #t~mem58;havoc #t~mem58; {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 70: Hoare triple {137918#true} 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); {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 71: Hoare triple {137918#true} 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; {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 72: Hoare triple {137918#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 73: Hoare triple {137918#true} assume !(~ret~0 <= 0); {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 74: Hoare triple {137918#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 75: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 76: Hoare triple {137918#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 78: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 79: Hoare triple {137918#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); {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 80: Hoare triple {137918#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,538 INFO L290 TraceCheckUtils]: 81: Hoare triple {137918#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 82: Hoare triple {137918#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 83: Hoare triple {137918#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 84: Hoare triple {137918#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 85: Hoare triple {137918#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 86: Hoare triple {137918#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 87: Hoare triple {137918#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 88: Hoare triple {137918#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 89: Hoare triple {137918#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 90: Hoare triple {137918#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 91: Hoare triple {137918#true} assume 4416 == #t~mem60;havoc #t~mem60; {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 92: Hoare triple {137918#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {137918#true} is VALID [2022-04-08 15:18:52,539 INFO L290 TraceCheckUtils]: 93: Hoare triple {137918#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {137918#true} is VALID [2022-04-08 15:18:52,540 INFO L290 TraceCheckUtils]: 94: Hoare triple {137918#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,540 INFO L290 TraceCheckUtils]: 95: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,541 INFO L290 TraceCheckUtils]: 96: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,541 INFO L290 TraceCheckUtils]: 97: Hoare triple {137923#(not (= 4512 (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; {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,541 INFO L290 TraceCheckUtils]: 98: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,542 INFO L290 TraceCheckUtils]: 99: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,542 INFO L290 TraceCheckUtils]: 100: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,542 INFO L290 TraceCheckUtils]: 101: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,543 INFO L290 TraceCheckUtils]: 102: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,543 INFO L290 TraceCheckUtils]: 103: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,543 INFO L290 TraceCheckUtils]: 104: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,544 INFO L290 TraceCheckUtils]: 105: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,544 INFO L290 TraceCheckUtils]: 106: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,544 INFO L290 TraceCheckUtils]: 107: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,544 INFO L290 TraceCheckUtils]: 108: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,545 INFO L290 TraceCheckUtils]: 109: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,545 INFO L290 TraceCheckUtils]: 110: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,545 INFO L290 TraceCheckUtils]: 111: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,546 INFO L290 TraceCheckUtils]: 112: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,546 INFO L290 TraceCheckUtils]: 113: Hoare triple {137923#(not (= 4512 (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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,546 INFO L290 TraceCheckUtils]: 114: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,547 INFO L290 TraceCheckUtils]: 115: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,547 INFO L290 TraceCheckUtils]: 116: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,547 INFO L290 TraceCheckUtils]: 117: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4449 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,548 INFO L290 TraceCheckUtils]: 118: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4464 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,548 INFO L290 TraceCheckUtils]: 119: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4465 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,548 INFO L290 TraceCheckUtils]: 120: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4466 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,549 INFO L290 TraceCheckUtils]: 121: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4467 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,549 INFO L290 TraceCheckUtils]: 122: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4480 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,549 INFO L290 TraceCheckUtils]: 123: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4481 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,549 INFO L290 TraceCheckUtils]: 124: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4496 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:18:52,550 INFO L290 TraceCheckUtils]: 125: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4497 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137924#(not (= |ssl3_connect_#t~mem74| 4512))} is VALID [2022-04-08 15:18:52,550 INFO L290 TraceCheckUtils]: 126: Hoare triple {137924#(not (= |ssl3_connect_#t~mem74| 4512))} assume 4512 == #t~mem74;havoc #t~mem74; {137919#false} is VALID [2022-04-08 15:18:52,550 INFO L290 TraceCheckUtils]: 127: Hoare triple {137919#false} assume -2147483648 <= #t~nondet113 && #t~nondet113 <= 2147483647;~ret~0 := #t~nondet113;havoc #t~nondet113; {137919#false} is VALID [2022-04-08 15:18:52,550 INFO L290 TraceCheckUtils]: 128: Hoare triple {137919#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem116.base, #t~mem116.offset := read~$Pointer$(#t~mem115.base, 888 + #t~mem115.offset, 8);call write~$Pointer$(#t~mem116.base, #t~mem116.offset, #t~mem114.base, 192 + #t~mem114.offset, 8);havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;havoc #t~mem116.base, #t~mem116.offset;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 967 + #t~mem117.offset, 8); {137919#false} is VALID [2022-04-08 15:18:52,551 INFO L290 TraceCheckUtils]: 129: Hoare triple {137919#false} assume 0 == (#t~mem118.base + #t~mem118.offset) % 18446744073709551616;havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset;call #t~mem119.base, #t~mem119.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem119.base, 188 + #t~mem119.offset, 4);havoc #t~mem119.base, #t~mem119.offset; {137919#false} is VALID [2022-04-08 15:18:52,551 INFO L290 TraceCheckUtils]: 130: Hoare triple {137919#false} assume !(0 == ~tmp___7~0); {137919#false} is VALID [2022-04-08 15:18:52,551 INFO L290 TraceCheckUtils]: 131: Hoare triple {137919#false} assume !(0 == ~tmp___8~0); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 132: Hoare triple {137919#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); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 133: Hoare triple {137919#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 134: Hoare triple {137919#false} ~skip~0 := 0; {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 135: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 136: Hoare triple {137919#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); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 137: Hoare triple {137919#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 138: Hoare triple {137919#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 139: Hoare triple {137919#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 140: Hoare triple {137919#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 141: Hoare triple {137919#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 142: Hoare triple {137919#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 143: Hoare triple {137919#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 144: Hoare triple {137919#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 145: Hoare triple {137919#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,552 INFO L290 TraceCheckUtils]: 146: Hoare triple {137919#false} assume 4400 == #t~mem58;havoc #t~mem58; {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 147: Hoare triple {137919#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); {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 148: Hoare triple {137919#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; {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 149: Hoare triple {137919#false} assume !(2 == ~blastFlag~0); {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 150: Hoare triple {137919#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 151: Hoare triple {137919#false} assume !(~ret~0 <= 0); {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 152: Hoare triple {137919#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 153: Hoare triple {137919#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); {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 154: Hoare triple {137919#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 155: Hoare triple {137919#false} ~skip~0 := 0; {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 156: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 157: Hoare triple {137919#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); {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 158: Hoare triple {137919#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 159: Hoare triple {137919#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,553 INFO L290 TraceCheckUtils]: 160: Hoare triple {137919#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 161: Hoare triple {137919#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 162: Hoare triple {137919#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 163: Hoare triple {137919#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 164: Hoare triple {137919#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 165: Hoare triple {137919#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 166: Hoare triple {137919#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 167: Hoare triple {137919#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 168: Hoare triple {137919#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 169: Hoare triple {137919#false} assume 4416 == #t~mem60;havoc #t~mem60; {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 170: Hoare triple {137919#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 171: Hoare triple {137919#false} assume !(3 == ~blastFlag~0); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 172: Hoare triple {137919#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); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 173: Hoare triple {137919#false} assume !(0 == ~tmp___6~0); {137919#false} is VALID [2022-04-08 15:18:52,554 INFO L290 TraceCheckUtils]: 174: Hoare triple {137919#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); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 175: Hoare triple {137919#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 176: Hoare triple {137919#false} ~skip~0 := 0; {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 177: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 178: Hoare triple {137919#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); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 179: Hoare triple {137919#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 180: Hoare triple {137919#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 181: Hoare triple {137919#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 182: Hoare triple {137919#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 183: Hoare triple {137919#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 184: Hoare triple {137919#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 185: Hoare triple {137919#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 186: Hoare triple {137919#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 187: Hoare triple {137919#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 188: Hoare triple {137919#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,555 INFO L290 TraceCheckUtils]: 189: Hoare triple {137919#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,556 INFO L290 TraceCheckUtils]: 190: Hoare triple {137919#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,556 INFO L290 TraceCheckUtils]: 191: Hoare triple {137919#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-08 15:18:52,556 INFO L290 TraceCheckUtils]: 192: Hoare triple {137919#false} assume 4432 == #t~mem62;havoc #t~mem62; {137919#false} is VALID [2022-04-08 15:18:52,556 INFO L290 TraceCheckUtils]: 193: Hoare triple {137919#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {137919#false} is VALID [2022-04-08 15:18:52,556 INFO L290 TraceCheckUtils]: 194: Hoare triple {137919#false} assume 5 == ~blastFlag~0; {137919#false} is VALID [2022-04-08 15:18:52,556 INFO L290 TraceCheckUtils]: 195: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-08 15:18:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-04-08 15:18:52,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:18:52,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422641655] [2022-04-08 15:18:52,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422641655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:18:52,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:18:52,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:18:52,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:18:52,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1180423666] [2022-04-08 15:18:52,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1180423666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:18:52,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:18:52,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:18:52,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257557091] [2022-04-08 15:18:52,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:18:52,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 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 196 [2022-04-08 15:18:52,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:18:52,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:52,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:18:52,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:18:52,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:18:52,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:18:52,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:18:52,647 INFO L87 Difference]: Start difference. First operand 1193 states and 1787 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:54,666 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-08 15:18:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:18:55,973 INFO L93 Difference]: Finished difference Result 2909 states and 4318 transitions. [2022-04-08 15:18:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:18:55,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 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 196 [2022-04-08 15:18:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:18:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:18:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:18:55,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 15:18:56,284 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-08 15:18:56,405 INFO L225 Difference]: With dead ends: 2909 [2022-04-08 15:18:56,405 INFO L226 Difference]: Without dead ends: 1732 [2022-04-08 15:18:56,410 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-08 15:18:56,411 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 93 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:18:56,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 282 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 389 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:18:56,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2022-04-08 15:18:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1421. [2022-04-08 15:18:56,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:18:56,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1732 states. Second operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:56,497 INFO L74 IsIncluded]: Start isIncluded. First operand 1732 states. Second operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:56,497 INFO L87 Difference]: Start difference. First operand 1732 states. Second operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:18:56,572 INFO L93 Difference]: Finished difference Result 1732 states and 2545 transitions. [2022-04-08 15:18:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2545 transitions. [2022-04-08 15:18:56,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:18:56,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:18:56,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 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 1732 states. [2022-04-08 15:18:56,575 INFO L87 Difference]: Start difference. First operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 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 1732 states. [2022-04-08 15:18:56,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:18:56,651 INFO L93 Difference]: Finished difference Result 1732 states and 2545 transitions. [2022-04-08 15:18:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2545 transitions. [2022-04-08 15:18:56,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:18:56,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:18:56,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:18:56,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:18:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2153 transitions. [2022-04-08 15:18:56,727 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2153 transitions. Word has length 196 [2022-04-08 15:18:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:18:56,728 INFO L478 AbstractCegarLoop]: Abstraction has 1421 states and 2153 transitions. [2022-04-08 15:18:56,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:18:56,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1421 states and 2153 transitions. [2022-04-08 15:18:58,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2153 edges. 2153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:18:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2153 transitions. [2022-04-08 15:18:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-08 15:18:58,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:18:58,712 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:18:58,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 15:18:58,712 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:18:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:18:58,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1893395013, now seen corresponding path program 1 times [2022-04-08 15:18:58,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:18:58,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1714572619] [2022-04-08 15:19:10,505 WARN L232 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:19:19,180 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:19:19,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1893395013, now seen corresponding path program 2 times [2022-04-08 15:19:19,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:19:19,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649765901] [2022-04-08 15:19:19,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:19:19,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:19:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:19:19,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:19:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:19:19,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {150061#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {150054#true} is VALID [2022-04-08 15:19:19,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {150054#true} assume true; {150054#true} is VALID [2022-04-08 15:19:19,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150054#true} {150054#true} #593#return; {150054#true} is VALID [2022-04-08 15:19:19,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {150054#true} call ULTIMATE.init(); {150061#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:19:19,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {150061#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {150054#true} assume true; {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150054#true} {150054#true} #593#return; {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {150054#true} call #t~ret158 := main(); {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {150054#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; {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L272 TraceCheckUtils]: 6: Hoare triple {150054#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {150054#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; {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {150054#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; {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {150054#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {150054#true} assume 12292 == #t~mem49;havoc #t~mem49; {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {150054#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; {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {150054#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {150054#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {150054#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {150054#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {150054#true} assume !(0 == ~tmp___4~0); {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {150054#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {150054#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {150054#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {150054#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {150054#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {150054#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {150054#true} assume 4368 == #t~mem54;havoc #t~mem54; {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {150054#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; {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {150054#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {150054#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; {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {150054#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {150054#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {150054#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {150054#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {150054#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {150054#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {150054#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 48: Hoare triple {150054#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {150054#true} assume 4384 == #t~mem56;havoc #t~mem56; {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {150054#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {150054#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 52: Hoare triple {150054#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {150054#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 54: Hoare triple {150054#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {150054#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 57: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 58: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 59: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 60: Hoare triple {150054#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 61: Hoare triple {150054#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 62: Hoare triple {150054#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 63: Hoare triple {150054#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 64: Hoare triple {150054#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 65: Hoare triple {150054#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 66: Hoare triple {150054#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 67: Hoare triple {150054#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {150054#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {150054#true} assume 4400 == #t~mem58;havoc #t~mem58; {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {150054#true} 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); {150054#true} is VALID [2022-04-08 15:19:19,331 INFO L290 TraceCheckUtils]: 71: Hoare triple {150054#true} 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; {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 72: Hoare triple {150054#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 73: Hoare triple {150054#true} assume !(~ret~0 <= 0); {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 74: Hoare triple {150054#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 75: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {150054#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 77: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 78: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 79: Hoare triple {150054#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); {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 80: Hoare triple {150054#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 81: Hoare triple {150054#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 82: Hoare triple {150054#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 83: Hoare triple {150054#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 84: Hoare triple {150054#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,332 INFO L290 TraceCheckUtils]: 85: Hoare triple {150054#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,333 INFO L290 TraceCheckUtils]: 86: Hoare triple {150054#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,333 INFO L290 TraceCheckUtils]: 87: Hoare triple {150054#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,333 INFO L290 TraceCheckUtils]: 88: Hoare triple {150054#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,333 INFO L290 TraceCheckUtils]: 89: Hoare triple {150054#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,333 INFO L290 TraceCheckUtils]: 90: Hoare triple {150054#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-08 15:19:19,333 INFO L290 TraceCheckUtils]: 91: Hoare triple {150054#true} assume 4416 == #t~mem60;havoc #t~mem60; {150054#true} is VALID [2022-04-08 15:19:19,333 INFO L290 TraceCheckUtils]: 92: Hoare triple {150054#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {150054#true} is VALID [2022-04-08 15:19:19,333 INFO L290 TraceCheckUtils]: 93: Hoare triple {150054#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {150054#true} is VALID [2022-04-08 15:19:19,334 INFO L290 TraceCheckUtils]: 94: Hoare triple {150054#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,334 INFO L290 TraceCheckUtils]: 95: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,335 INFO L290 TraceCheckUtils]: 96: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,335 INFO L290 TraceCheckUtils]: 97: Hoare triple {150059#(= 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; {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,335 INFO L290 TraceCheckUtils]: 98: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,335 INFO L290 TraceCheckUtils]: 99: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,336 INFO L290 TraceCheckUtils]: 100: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,336 INFO L290 TraceCheckUtils]: 101: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,336 INFO L290 TraceCheckUtils]: 102: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,337 INFO L290 TraceCheckUtils]: 103: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,337 INFO L290 TraceCheckUtils]: 104: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,337 INFO L290 TraceCheckUtils]: 105: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,338 INFO L290 TraceCheckUtils]: 106: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,338 INFO L290 TraceCheckUtils]: 107: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,338 INFO L290 TraceCheckUtils]: 108: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,339 INFO L290 TraceCheckUtils]: 109: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,339 INFO L290 TraceCheckUtils]: 110: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,339 INFO L290 TraceCheckUtils]: 111: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,340 INFO L290 TraceCheckUtils]: 112: Hoare triple {150059#(= 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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:19:19,340 INFO L290 TraceCheckUtils]: 113: Hoare triple {150059#(= 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); {150060#(= |ssl3_connect_#t~mem62| 4432)} is VALID [2022-04-08 15:19:19,340 INFO L290 TraceCheckUtils]: 114: Hoare triple {150060#(= |ssl3_connect_#t~mem62| 4432)} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,340 INFO L290 TraceCheckUtils]: 115: Hoare triple {150055#false} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,340 INFO L290 TraceCheckUtils]: 116: Hoare triple {150055#false} assume !(4448 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 117: Hoare triple {150055#false} assume !(4449 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 118: Hoare triple {150055#false} assume !(4464 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 119: Hoare triple {150055#false} assume !(4465 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 120: Hoare triple {150055#false} assume !(4466 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 121: Hoare triple {150055#false} assume !(4467 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 122: Hoare triple {150055#false} assume !(4480 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 123: Hoare triple {150055#false} assume !(4481 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 124: Hoare triple {150055#false} assume !(4496 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 125: Hoare triple {150055#false} assume !(4497 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 126: Hoare triple {150055#false} assume !(4512 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 127: Hoare triple {150055#false} assume 4513 == #t~mem75;havoc #t~mem75; {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 128: Hoare triple {150055#false} assume -2147483648 <= #t~nondet113 && #t~nondet113 <= 2147483647;~ret~0 := #t~nondet113;havoc #t~nondet113; {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 129: Hoare triple {150055#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem116.base, #t~mem116.offset := read~$Pointer$(#t~mem115.base, 888 + #t~mem115.offset, 8);call write~$Pointer$(#t~mem116.base, #t~mem116.offset, #t~mem114.base, 192 + #t~mem114.offset, 8);havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;havoc #t~mem116.base, #t~mem116.offset;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 967 + #t~mem117.offset, 8); {150055#false} is VALID [2022-04-08 15:19:19,341 INFO L290 TraceCheckUtils]: 130: Hoare triple {150055#false} assume 0 == (#t~mem118.base + #t~mem118.offset) % 18446744073709551616;havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset;call #t~mem119.base, #t~mem119.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem119.base, 188 + #t~mem119.offset, 4);havoc #t~mem119.base, #t~mem119.offset; {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 131: Hoare triple {150055#false} assume !(0 == ~tmp___7~0); {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 132: Hoare triple {150055#false} assume !(0 == ~tmp___8~0); {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 133: Hoare triple {150055#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); {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 134: Hoare triple {150055#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 135: Hoare triple {150055#false} ~skip~0 := 0; {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 136: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 137: Hoare triple {150055#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); {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 138: Hoare triple {150055#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 139: Hoare triple {150055#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 140: Hoare triple {150055#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 141: Hoare triple {150055#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 142: Hoare triple {150055#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 143: Hoare triple {150055#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,342 INFO L290 TraceCheckUtils]: 144: Hoare triple {150055#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 145: Hoare triple {150055#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 146: Hoare triple {150055#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 147: Hoare triple {150055#false} assume 4400 == #t~mem58;havoc #t~mem58; {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 148: Hoare triple {150055#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); {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 149: Hoare triple {150055#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; {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 150: Hoare triple {150055#false} assume !(2 == ~blastFlag~0); {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 151: Hoare triple {150055#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 152: Hoare triple {150055#false} assume !(~ret~0 <= 0); {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 153: Hoare triple {150055#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 154: Hoare triple {150055#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); {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 155: Hoare triple {150055#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 156: Hoare triple {150055#false} ~skip~0 := 0; {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 157: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-08 15:19:19,343 INFO L290 TraceCheckUtils]: 158: Hoare triple {150055#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); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 159: Hoare triple {150055#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 160: Hoare triple {150055#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 161: Hoare triple {150055#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 162: Hoare triple {150055#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 163: Hoare triple {150055#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 164: Hoare triple {150055#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 165: Hoare triple {150055#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 166: Hoare triple {150055#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 167: Hoare triple {150055#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 168: Hoare triple {150055#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 169: Hoare triple {150055#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 170: Hoare triple {150055#false} assume 4416 == #t~mem60;havoc #t~mem60; {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 171: Hoare triple {150055#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {150055#false} is VALID [2022-04-08 15:19:19,344 INFO L290 TraceCheckUtils]: 172: Hoare triple {150055#false} assume !(3 == ~blastFlag~0); {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 173: Hoare triple {150055#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); {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 174: Hoare triple {150055#false} assume !(0 == ~tmp___6~0); {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 175: Hoare triple {150055#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); {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 176: Hoare triple {150055#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 177: Hoare triple {150055#false} ~skip~0 := 0; {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 178: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 179: Hoare triple {150055#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); {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 180: Hoare triple {150055#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 181: Hoare triple {150055#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 182: Hoare triple {150055#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 183: Hoare triple {150055#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 184: Hoare triple {150055#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 185: Hoare triple {150055#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,345 INFO L290 TraceCheckUtils]: 186: Hoare triple {150055#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,346 INFO L290 TraceCheckUtils]: 187: Hoare triple {150055#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,346 INFO L290 TraceCheckUtils]: 188: Hoare triple {150055#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,346 INFO L290 TraceCheckUtils]: 189: Hoare triple {150055#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,346 INFO L290 TraceCheckUtils]: 190: Hoare triple {150055#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,346 INFO L290 TraceCheckUtils]: 191: Hoare triple {150055#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,346 INFO L290 TraceCheckUtils]: 192: Hoare triple {150055#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-08 15:19:19,346 INFO L290 TraceCheckUtils]: 193: Hoare triple {150055#false} assume 4432 == #t~mem62;havoc #t~mem62; {150055#false} is VALID [2022-04-08 15:19:19,346 INFO L290 TraceCheckUtils]: 194: Hoare triple {150055#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {150055#false} is VALID [2022-04-08 15:19:19,346 INFO L290 TraceCheckUtils]: 195: Hoare triple {150055#false} assume 5 == ~blastFlag~0; {150055#false} is VALID [2022-04-08 15:19:19,346 INFO L290 TraceCheckUtils]: 196: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-08 15:19:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-04-08 15:19:19,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:19:19,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649765901] [2022-04-08 15:19:19,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649765901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:19:19,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:19:19,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:19:19,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:19:19,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1714572619] [2022-04-08 15:19:19,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1714572619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:19:19,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:19:19,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:19:19,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124694972] [2022-04-08 15:19:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:19:19,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 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 197 [2022-04-08 15:19:19,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:19:19,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:19,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:19:19,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:19:19,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:19:19,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:19:19,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:19:19,429 INFO L87 Difference]: Start difference. First operand 1421 states and 2153 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:21,447 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-08 15:19:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:19:22,586 INFO L93 Difference]: Finished difference Result 2858 states and 4319 transitions. [2022-04-08 15:19:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:19:22,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 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 197 [2022-04-08 15:19:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:19:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-04-08 15:19:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-04-08 15:19:22,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 374 transitions. [2022-04-08 15:19:22,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:19:22,884 INFO L225 Difference]: With dead ends: 2858 [2022-04-08 15:19:22,884 INFO L226 Difference]: Without dead ends: 1453 [2022-04-08 15:19:22,886 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-08 15:19:22,886 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 19 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:19:22,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 460 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 332 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:19:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-04-08 15:19:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1421. [2022-04-08 15:19:22,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:19:22,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1453 states. Second operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:22,978 INFO L74 IsIncluded]: Start isIncluded. First operand 1453 states. Second operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:22,979 INFO L87 Difference]: Start difference. First operand 1453 states. Second operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:19:23,028 INFO L93 Difference]: Finished difference Result 1453 states and 2181 transitions. [2022-04-08 15:19:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2181 transitions. [2022-04-08 15:19:23,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:19:23,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:19:23,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 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 1453 states. [2022-04-08 15:19:23,031 INFO L87 Difference]: Start difference. First operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 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 1453 states. [2022-04-08 15:19:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:19:23,082 INFO L93 Difference]: Finished difference Result 1453 states and 2181 transitions. [2022-04-08 15:19:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2181 transitions. [2022-04-08 15:19:23,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:19:23,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:19:23,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:19:23,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:19:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2148 transitions. [2022-04-08 15:19:23,163 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2148 transitions. Word has length 197 [2022-04-08 15:19:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:19:23,163 INFO L478 AbstractCegarLoop]: Abstraction has 1421 states and 2148 transitions. [2022-04-08 15:19:23,163 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:23,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1421 states and 2148 transitions. [2022-04-08 15:19:25,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2148 edges. 2148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:19:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2148 transitions. [2022-04-08 15:19:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-04-08 15:19:25,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:19:25,202 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:19:25,202 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 15:19:25,202 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:19:25,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:19:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1803608870, now seen corresponding path program 1 times [2022-04-08 15:19:25,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:19:25,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720436764] [2022-04-08 15:19:38,868 WARN L232 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:19:45,742 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:19:45,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1803608870, now seen corresponding path program 2 times [2022-04-08 15:19:45,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:19:45,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293864242] [2022-04-08 15:19:45,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:19:45,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:19:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:19:45,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:19:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:19:45,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {161537#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {161530#true} is VALID [2022-04-08 15:19:45,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {161530#true} assume true; {161530#true} is VALID [2022-04-08 15:19:45,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161530#true} {161530#true} #593#return; {161530#true} is VALID [2022-04-08 15:19:45,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {161530#true} call ULTIMATE.init(); {161537#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:19:45,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {161537#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {161530#true} is VALID [2022-04-08 15:19:45,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {161530#true} assume true; {161530#true} is VALID [2022-04-08 15:19:45,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161530#true} {161530#true} #593#return; {161530#true} is VALID [2022-04-08 15:19:45,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {161530#true} call #t~ret158 := main(); {161530#true} is VALID [2022-04-08 15:19:45,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {161530#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; {161530#true} is VALID [2022-04-08 15:19:45,959 INFO L272 TraceCheckUtils]: 6: Hoare triple {161530#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {161530#true} is VALID [2022-04-08 15:19:45,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {161530#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; {161530#true} is VALID [2022-04-08 15:19:45,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {161530#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; {161530#true} is VALID [2022-04-08 15:19:45,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {161530#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {161530#true} assume 12292 == #t~mem49;havoc #t~mem49; {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {161530#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; {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {161530#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {161530#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {161530#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {161530#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {161530#true} assume !(0 == ~tmp___4~0); {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {161530#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-08 15:19:45,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {161530#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {161530#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {161530#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {161530#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {161530#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {161530#true} assume 4368 == #t~mem54;havoc #t~mem54; {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {161530#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; {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {161530#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {161530#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; {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {161530#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 39: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-08 15:19:45,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {161530#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {161530#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {161530#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {161530#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {161530#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {161530#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {161530#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {161530#true} assume 4384 == #t~mem56;havoc #t~mem56; {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {161530#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {161530#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 52: Hoare triple {161530#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 53: Hoare triple {161530#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,962 INFO L290 TraceCheckUtils]: 54: Hoare triple {161530#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {161530#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 59: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 60: Hoare triple {161530#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {161530#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 62: Hoare triple {161530#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 63: Hoare triple {161530#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 64: Hoare triple {161530#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 65: Hoare triple {161530#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 66: Hoare triple {161530#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 67: Hoare triple {161530#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 68: Hoare triple {161530#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,963 INFO L290 TraceCheckUtils]: 69: Hoare triple {161530#true} assume 4400 == #t~mem58;havoc #t~mem58; {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 70: Hoare triple {161530#true} 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); {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 71: Hoare triple {161530#true} 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; {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 72: Hoare triple {161530#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 73: Hoare triple {161530#true} assume !(~ret~0 <= 0); {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 74: Hoare triple {161530#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 75: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 76: Hoare triple {161530#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 77: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 78: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 79: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 80: Hoare triple {161530#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 81: Hoare triple {161530#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 82: Hoare triple {161530#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 83: Hoare triple {161530#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,964 INFO L290 TraceCheckUtils]: 84: Hoare triple {161530#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 85: Hoare triple {161530#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 86: Hoare triple {161530#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 87: Hoare triple {161530#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 88: Hoare triple {161530#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 89: Hoare triple {161530#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 90: Hoare triple {161530#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 91: Hoare triple {161530#true} assume 4416 == #t~mem60;havoc #t~mem60; {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 92: Hoare triple {161530#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 93: Hoare triple {161530#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 94: Hoare triple {161530#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 95: Hoare triple {161530#true} assume !(0 == ~tmp___6~0); {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 96: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 97: Hoare triple {161530#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161530#true} is VALID [2022-04-08 15:19:45,965 INFO L290 TraceCheckUtils]: 98: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 99: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 100: Hoare triple {161530#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); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 101: Hoare triple {161530#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 102: Hoare triple {161530#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 103: Hoare triple {161530#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 104: Hoare triple {161530#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 105: Hoare triple {161530#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 106: Hoare triple {161530#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 107: Hoare triple {161530#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 108: Hoare triple {161530#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 109: Hoare triple {161530#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 110: Hoare triple {161530#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 111: Hoare triple {161530#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 112: Hoare triple {161530#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,966 INFO L290 TraceCheckUtils]: 113: Hoare triple {161530#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-08 15:19:45,967 INFO L290 TraceCheckUtils]: 114: Hoare triple {161530#true} assume 4432 == #t~mem62;havoc #t~mem62; {161530#true} is VALID [2022-04-08 15:19:45,967 INFO L290 TraceCheckUtils]: 115: Hoare triple {161530#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {161530#true} is VALID [2022-04-08 15:19:45,967 INFO L290 TraceCheckUtils]: 116: Hoare triple {161530#true} assume !(5 == ~blastFlag~0); {161530#true} is VALID [2022-04-08 15:19:45,968 INFO L290 TraceCheckUtils]: 117: Hoare triple {161530#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,968 INFO L290 TraceCheckUtils]: 118: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} 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); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,969 INFO L290 TraceCheckUtils]: 119: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,969 INFO L290 TraceCheckUtils]: 120: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} ~skip~0 := 0; {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,969 INFO L290 TraceCheckUtils]: 121: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !false; {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,969 INFO L290 TraceCheckUtils]: 122: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} 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); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,970 INFO L290 TraceCheckUtils]: 123: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,970 INFO L290 TraceCheckUtils]: 124: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,970 INFO L290 TraceCheckUtils]: 125: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,970 INFO L290 TraceCheckUtils]: 126: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,971 INFO L290 TraceCheckUtils]: 127: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,971 INFO L290 TraceCheckUtils]: 128: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,971 INFO L290 TraceCheckUtils]: 129: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:19:45,971 INFO L290 TraceCheckUtils]: 130: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161536#(= |ssl3_connect_#t~mem57| 4448)} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 131: Hoare triple {161536#(= |ssl3_connect_#t~mem57| 4448)} assume 4385 == #t~mem57;havoc #t~mem57; {161531#false} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 132: Hoare triple {161531#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {161531#false} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 133: Hoare triple {161531#false} assume !(1 == ~blastFlag~0); {161531#false} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 134: Hoare triple {161531#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 135: Hoare triple {161531#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 136: Hoare triple {161531#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 137: Hoare triple {161531#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); {161531#false} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 138: Hoare triple {161531#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161531#false} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 139: Hoare triple {161531#false} ~skip~0 := 0; {161531#false} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 140: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 141: Hoare triple {161531#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); {161531#false} is VALID [2022-04-08 15:19:45,972 INFO L290 TraceCheckUtils]: 142: Hoare triple {161531#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 143: Hoare triple {161531#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 144: Hoare triple {161531#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 145: Hoare triple {161531#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 146: Hoare triple {161531#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 147: Hoare triple {161531#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 148: Hoare triple {161531#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 149: Hoare triple {161531#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 150: Hoare triple {161531#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 151: Hoare triple {161531#false} assume 4400 == #t~mem58;havoc #t~mem58; {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 152: Hoare triple {161531#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); {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 153: Hoare triple {161531#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; {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 154: Hoare triple {161531#false} assume !(2 == ~blastFlag~0); {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 155: Hoare triple {161531#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {161531#false} is VALID [2022-04-08 15:19:45,973 INFO L290 TraceCheckUtils]: 156: Hoare triple {161531#false} assume !(~ret~0 <= 0); {161531#false} is VALID [2022-04-08 15:19:45,974 INFO L290 TraceCheckUtils]: 157: Hoare triple {161531#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,974 INFO L290 TraceCheckUtils]: 158: Hoare triple {161531#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); {161531#false} is VALID [2022-04-08 15:19:45,974 INFO L290 TraceCheckUtils]: 159: Hoare triple {161531#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161531#false} is VALID [2022-04-08 15:19:45,974 INFO L290 TraceCheckUtils]: 160: Hoare triple {161531#false} ~skip~0 := 0; {161531#false} is VALID [2022-04-08 15:19:45,974 INFO L290 TraceCheckUtils]: 161: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-08 15:19:45,974 INFO L290 TraceCheckUtils]: 162: Hoare triple {161531#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); {161531#false} is VALID [2022-04-08 15:19:45,974 INFO L290 TraceCheckUtils]: 163: Hoare triple {161531#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,974 INFO L290 TraceCheckUtils]: 164: Hoare triple {161531#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,980 INFO L290 TraceCheckUtils]: 165: Hoare triple {161531#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,980 INFO L290 TraceCheckUtils]: 166: Hoare triple {161531#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,980 INFO L290 TraceCheckUtils]: 167: Hoare triple {161531#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,980 INFO L290 TraceCheckUtils]: 168: Hoare triple {161531#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,980 INFO L290 TraceCheckUtils]: 169: Hoare triple {161531#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,980 INFO L290 TraceCheckUtils]: 170: Hoare triple {161531#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,980 INFO L290 TraceCheckUtils]: 171: Hoare triple {161531#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 172: Hoare triple {161531#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 173: Hoare triple {161531#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 174: Hoare triple {161531#false} assume 4416 == #t~mem60;havoc #t~mem60; {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 175: Hoare triple {161531#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 176: Hoare triple {161531#false} assume !(3 == ~blastFlag~0); {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 177: Hoare triple {161531#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); {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 178: Hoare triple {161531#false} assume !(0 == ~tmp___6~0); {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 179: Hoare triple {161531#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); {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 180: Hoare triple {161531#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 181: Hoare triple {161531#false} ~skip~0 := 0; {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 182: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 183: Hoare triple {161531#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); {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 184: Hoare triple {161531#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 185: Hoare triple {161531#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,981 INFO L290 TraceCheckUtils]: 186: Hoare triple {161531#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 187: Hoare triple {161531#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 188: Hoare triple {161531#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 189: Hoare triple {161531#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 190: Hoare triple {161531#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 191: Hoare triple {161531#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 192: Hoare triple {161531#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 193: Hoare triple {161531#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 194: Hoare triple {161531#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 195: Hoare triple {161531#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 196: Hoare triple {161531#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 197: Hoare triple {161531#false} assume 4432 == #t~mem62;havoc #t~mem62; {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 198: Hoare triple {161531#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 199: Hoare triple {161531#false} assume 5 == ~blastFlag~0; {161531#false} is VALID [2022-04-08 15:19:45,982 INFO L290 TraceCheckUtils]: 200: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-08 15:19:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-04-08 15:19:45,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:19:45,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293864242] [2022-04-08 15:19:45,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293864242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:19:45,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:19:45,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:19:45,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:19:45,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720436764] [2022-04-08 15:19:45,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720436764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:19:45,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:19:45,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:19:45,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539044200] [2022-04-08 15:19:45,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:19:45,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 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 201 [2022-04-08 15:19:45,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:19:45,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:46,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:19:46,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:19:46,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:19:46,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:19:46,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:19:46,066 INFO L87 Difference]: Start difference. First operand 1421 states and 2148 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:48,086 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-08 15:19:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:19:49,766 INFO L93 Difference]: Finished difference Result 3286 states and 4942 transitions. [2022-04-08 15:19:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:19:49,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 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 201 [2022-04-08 15:19:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:19:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-08 15:19:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-08 15:19:49,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-04-08 15:19:50,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:19:50,171 INFO L225 Difference]: With dead ends: 3286 [2022-04-08 15:19:50,171 INFO L226 Difference]: Without dead ends: 1881 [2022-04-08 15:19:50,173 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-08 15:19:50,173 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 78 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:19:50,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 538 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 503 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:19:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2022-04-08 15:19:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1535. [2022-04-08 15:19:50,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:19:50,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1881 states. Second operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:50,272 INFO L74 IsIncluded]: Start isIncluded. First operand 1881 states. Second operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:50,273 INFO L87 Difference]: Start difference. First operand 1881 states. Second operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:19:50,358 INFO L93 Difference]: Finished difference Result 1881 states and 2808 transitions. [2022-04-08 15:19:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2808 transitions. [2022-04-08 15:19:50,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:19:50,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:19:50,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 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 1881 states. [2022-04-08 15:19:50,362 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 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 1881 states. [2022-04-08 15:19:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:19:50,449 INFO L93 Difference]: Finished difference Result 1881 states and 2808 transitions. [2022-04-08 15:19:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2808 transitions. [2022-04-08 15:19:50,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:19:50,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:19:50,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:19:50,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:19:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2322 transitions. [2022-04-08 15:19:50,537 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2322 transitions. Word has length 201 [2022-04-08 15:19:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:19:50,537 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2322 transitions. [2022-04-08 15:19:50,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:19:50,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2322 transitions. [2022-04-08 15:19:52,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2322 edges. 2322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:19:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2322 transitions. [2022-04-08 15:19:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-04-08 15:19:52,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:19:52,759 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:19:52,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 15:19:52,759 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:19:52,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:19:52,760 INFO L85 PathProgramCache]: Analyzing trace with hash 255429711, now seen corresponding path program 1 times [2022-04-08 15:19:52,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:19:52,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [989017686] [2022-04-08 15:20:19,576 WARN L232 SmtUtils]: Spent 20.49s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:20:29,020 WARN L232 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:20:31,320 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:20:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash 255429711, now seen corresponding path program 2 times [2022-04-08 15:20:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:20:31,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292850639] [2022-04-08 15:20:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:20:31,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:20:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:20:31,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:20:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:20:31,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {174953#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {174946#true} is VALID [2022-04-08 15:20:31,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {174946#true} assume true; {174946#true} is VALID [2022-04-08 15:20:31,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {174946#true} {174946#true} #593#return; {174946#true} is VALID [2022-04-08 15:20:31,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {174946#true} call ULTIMATE.init(); {174953#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:20:31,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {174953#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {174946#true} is VALID [2022-04-08 15:20:31,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {174946#true} assume true; {174946#true} is VALID [2022-04-08 15:20:31,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174946#true} {174946#true} #593#return; {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {174946#true} call #t~ret158 := main(); {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {174946#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; {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {174946#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {174946#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; {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {174946#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; {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {174946#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {174946#true} assume 12292 == #t~mem49;havoc #t~mem49; {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {174946#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; {174946#true} is VALID [2022-04-08 15:20:31,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {174946#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {174946#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {174946#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {174946#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {174946#true} assume !(0 == ~tmp___4~0); {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {174946#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {174946#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {174946#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {174946#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {174946#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {174946#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {174946#true} assume 4368 == #t~mem54;havoc #t~mem54; {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {174946#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; {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {174946#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {174946#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; {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {174946#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {174946#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {174946#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 44: Hoare triple {174946#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {174946#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {174946#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {174946#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {174946#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {174946#true} assume 4384 == #t~mem56;havoc #t~mem56; {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {174946#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 51: Hoare triple {174946#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {174946#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {174946#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {174946#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {174946#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-08 15:20:31,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 59: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {174946#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 61: Hoare triple {174946#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {174946#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {174946#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {174946#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {174946#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {174946#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {174946#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {174946#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {174946#true} assume 4400 == #t~mem58;havoc #t~mem58; {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {174946#true} 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); {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {174946#true} 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; {174946#true} is VALID [2022-04-08 15:20:31,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {174946#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 73: Hoare triple {174946#true} assume !(~ret~0 <= 0); {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {174946#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {174946#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 79: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 80: Hoare triple {174946#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 81: Hoare triple {174946#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 82: Hoare triple {174946#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 83: Hoare triple {174946#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 84: Hoare triple {174946#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 85: Hoare triple {174946#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 86: Hoare triple {174946#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,525 INFO L290 TraceCheckUtils]: 87: Hoare triple {174946#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 88: Hoare triple {174946#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 89: Hoare triple {174946#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {174946#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 91: Hoare triple {174946#true} assume 4416 == #t~mem60;havoc #t~mem60; {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 92: Hoare triple {174946#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {174946#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 94: Hoare triple {174946#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 95: Hoare triple {174946#true} assume !(0 == ~tmp___6~0); {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 96: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 97: Hoare triple {174946#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 98: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 99: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 100: Hoare triple {174946#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); {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 101: Hoare triple {174946#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,526 INFO L290 TraceCheckUtils]: 102: Hoare triple {174946#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 103: Hoare triple {174946#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 104: Hoare triple {174946#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 105: Hoare triple {174946#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 106: Hoare triple {174946#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 107: Hoare triple {174946#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 108: Hoare triple {174946#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 109: Hoare triple {174946#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 110: Hoare triple {174946#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 111: Hoare triple {174946#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 112: Hoare triple {174946#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 113: Hoare triple {174946#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 114: Hoare triple {174946#true} assume 4432 == #t~mem62;havoc #t~mem62; {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 115: Hoare triple {174946#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {174946#true} is VALID [2022-04-08 15:20:31,527 INFO L290 TraceCheckUtils]: 116: Hoare triple {174946#true} assume !(5 == ~blastFlag~0); {174946#true} is VALID [2022-04-08 15:20:31,528 INFO L290 TraceCheckUtils]: 117: Hoare triple {174946#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:20:31,529 INFO L290 TraceCheckUtils]: 118: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} 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); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:20:31,529 INFO L290 TraceCheckUtils]: 119: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:20:31,529 INFO L290 TraceCheckUtils]: 120: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} ~skip~0 := 0; {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:20:31,529 INFO L290 TraceCheckUtils]: 121: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !false; {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:20:31,530 INFO L290 TraceCheckUtils]: 122: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} 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); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:20:31,530 INFO L290 TraceCheckUtils]: 123: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:20:31,530 INFO L290 TraceCheckUtils]: 124: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:20:31,530 INFO L290 TraceCheckUtils]: 125: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:20:31,531 INFO L290 TraceCheckUtils]: 126: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:20:31,531 INFO L290 TraceCheckUtils]: 127: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174952#(not (= |ssl3_connect_#t~mem54| 4368))} is VALID [2022-04-08 15:20:31,531 INFO L290 TraceCheckUtils]: 128: Hoare triple {174952#(not (= |ssl3_connect_#t~mem54| 4368))} assume 4368 == #t~mem54;havoc #t~mem54; {174947#false} is VALID [2022-04-08 15:20:31,531 INFO L290 TraceCheckUtils]: 129: Hoare triple {174947#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {174947#false} is VALID [2022-04-08 15:20:31,531 INFO L290 TraceCheckUtils]: 130: Hoare triple {174947#false} assume !(0 == ~blastFlag~0); {174947#false} is VALID [2022-04-08 15:20:31,531 INFO L290 TraceCheckUtils]: 131: Hoare triple {174947#false} 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); {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 132: Hoare triple {174947#false} 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; {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 133: Hoare triple {174947#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); {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 134: Hoare triple {174947#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 135: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 136: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 137: Hoare triple {174947#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); {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 138: Hoare triple {174947#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 139: Hoare triple {174947#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 140: Hoare triple {174947#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 141: Hoare triple {174947#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 142: Hoare triple {174947#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 143: Hoare triple {174947#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 144: Hoare triple {174947#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,532 INFO L290 TraceCheckUtils]: 145: Hoare triple {174947#false} assume 4384 == #t~mem56;havoc #t~mem56; {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 146: Hoare triple {174947#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 147: Hoare triple {174947#false} assume !(1 == ~blastFlag~0); {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 148: Hoare triple {174947#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 149: Hoare triple {174947#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 150: Hoare triple {174947#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 151: Hoare triple {174947#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); {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 152: Hoare triple {174947#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 153: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 154: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 155: Hoare triple {174947#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); {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 156: Hoare triple {174947#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 157: Hoare triple {174947#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 158: Hoare triple {174947#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 159: Hoare triple {174947#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,533 INFO L290 TraceCheckUtils]: 160: Hoare triple {174947#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 161: Hoare triple {174947#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 162: Hoare triple {174947#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 163: Hoare triple {174947#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 164: Hoare triple {174947#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 165: Hoare triple {174947#false} assume 4400 == #t~mem58;havoc #t~mem58; {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 166: Hoare triple {174947#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); {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 167: Hoare triple {174947#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; {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 168: Hoare triple {174947#false} assume !(2 == ~blastFlag~0); {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 169: Hoare triple {174947#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 170: Hoare triple {174947#false} assume !(~ret~0 <= 0); {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 171: Hoare triple {174947#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 172: Hoare triple {174947#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); {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 173: Hoare triple {174947#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174947#false} is VALID [2022-04-08 15:20:31,534 INFO L290 TraceCheckUtils]: 174: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 175: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 176: Hoare triple {174947#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); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 177: Hoare triple {174947#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 178: Hoare triple {174947#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 179: Hoare triple {174947#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 180: Hoare triple {174947#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 181: Hoare triple {174947#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 182: Hoare triple {174947#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 183: Hoare triple {174947#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 184: Hoare triple {174947#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 185: Hoare triple {174947#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 186: Hoare triple {174947#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 187: Hoare triple {174947#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 188: Hoare triple {174947#false} assume 4416 == #t~mem60;havoc #t~mem60; {174947#false} is VALID [2022-04-08 15:20:31,535 INFO L290 TraceCheckUtils]: 189: Hoare triple {174947#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 190: Hoare triple {174947#false} assume !(3 == ~blastFlag~0); {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 191: Hoare triple {174947#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); {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 192: Hoare triple {174947#false} assume !(0 == ~tmp___6~0); {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 193: Hoare triple {174947#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); {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 194: Hoare triple {174947#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 195: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 196: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 197: Hoare triple {174947#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); {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 198: Hoare triple {174947#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 199: Hoare triple {174947#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 200: Hoare triple {174947#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 201: Hoare triple {174947#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 202: Hoare triple {174947#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,536 INFO L290 TraceCheckUtils]: 203: Hoare triple {174947#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,537 INFO L290 TraceCheckUtils]: 204: Hoare triple {174947#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,537 INFO L290 TraceCheckUtils]: 205: Hoare triple {174947#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,537 INFO L290 TraceCheckUtils]: 206: Hoare triple {174947#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,537 INFO L290 TraceCheckUtils]: 207: Hoare triple {174947#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,537 INFO L290 TraceCheckUtils]: 208: Hoare triple {174947#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,537 INFO L290 TraceCheckUtils]: 209: Hoare triple {174947#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,537 INFO L290 TraceCheckUtils]: 210: Hoare triple {174947#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-08 15:20:31,537 INFO L290 TraceCheckUtils]: 211: Hoare triple {174947#false} assume 4432 == #t~mem62;havoc #t~mem62; {174947#false} is VALID [2022-04-08 15:20:31,537 INFO L290 TraceCheckUtils]: 212: Hoare triple {174947#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {174947#false} is VALID [2022-04-08 15:20:31,537 INFO L290 TraceCheckUtils]: 213: Hoare triple {174947#false} assume 5 == ~blastFlag~0; {174947#false} is VALID [2022-04-08 15:20:31,537 INFO L290 TraceCheckUtils]: 214: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-08 15:20:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-08 15:20:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:20:31,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292850639] [2022-04-08 15:20:31,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292850639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:20:31,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:20:31,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:20:31,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:20:31,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [989017686] [2022-04-08 15:20:31,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [989017686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:20:31,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:20:31,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:20:31,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074320349] [2022-04-08 15:20:31,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:20:31,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 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 215 [2022-04-08 15:20:31,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:20:31,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:20:31,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:20:31,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:20:31,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:20:31,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:20:31,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:20:31,619 INFO L87 Difference]: Start difference. First operand 1535 states and 2322 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:20:33,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:20:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:20:35,360 INFO L93 Difference]: Finished difference Result 3285 states and 4956 transitions. [2022-04-08 15:20:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:20:35,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 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 215 [2022-04-08 15:20:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:20:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:20:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-08 15:20:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:20:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-08 15:20:35,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 468 transitions. [2022-04-08 15:20:35,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:20:35,845 INFO L225 Difference]: With dead ends: 3285 [2022-04-08 15:20:35,846 INFO L226 Difference]: Without dead ends: 2009 [2022-04-08 15:20:35,847 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-08 15:20:35,847 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 111 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:20:35,847 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 478 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:20:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2022-04-08 15:20:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1535. [2022-04-08 15:20:35,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:20:35,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2009 states. Second operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:20:35,956 INFO L74 IsIncluded]: Start isIncluded. First operand 2009 states. Second operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:20:35,957 INFO L87 Difference]: Start difference. First operand 2009 states. Second operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:20:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:20:36,091 INFO L93 Difference]: Finished difference Result 2009 states and 2992 transitions. [2022-04-08 15:20:36,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2992 transitions. [2022-04-08 15:20:36,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:20:36,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:20:36,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 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 2009 states. [2022-04-08 15:20:36,096 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 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 2009 states. [2022-04-08 15:20:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:20:36,203 INFO L93 Difference]: Finished difference Result 2009 states and 2992 transitions. [2022-04-08 15:20:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2992 transitions. [2022-04-08 15:20:36,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:20:36,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:20:36,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:20:36,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:20:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:20:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2294 transitions. [2022-04-08 15:20:36,291 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2294 transitions. Word has length 215 [2022-04-08 15:20:36,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:20:36,291 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2294 transitions. [2022-04-08 15:20:36,291 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:20:36,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2294 transitions. [2022-04-08 15:20:38,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2294 edges. 2294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:20:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2294 transitions. [2022-04-08 15:20:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-04-08 15:20:38,593 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:20:38,593 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:20:38,593 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 15:20:38,593 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:20:38,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:20:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash 69910624, now seen corresponding path program 1 times [2022-04-08 15:20:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:20:38,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [798063059] [2022-04-08 15:20:51,492 WARN L232 SmtUtils]: Spent 7.03s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:20:58,435 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:20:58,436 INFO L85 PathProgramCache]: Analyzing trace with hash 69910624, now seen corresponding path program 2 times [2022-04-08 15:20:58,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:20:58,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467993868] [2022-04-08 15:20:58,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:20:58,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:20:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:20:58,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:20:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:20:58,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {188623#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {188616#true} is VALID [2022-04-08 15:20:58,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {188616#true} assume true; {188616#true} is VALID [2022-04-08 15:20:58,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {188616#true} {188616#true} #593#return; {188616#true} is VALID [2022-04-08 15:20:58,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {188616#true} call ULTIMATE.init(); {188623#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:20:58,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {188623#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {188616#true} is VALID [2022-04-08 15:20:58,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {188616#true} assume true; {188616#true} is VALID [2022-04-08 15:20:58,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188616#true} {188616#true} #593#return; {188616#true} is VALID [2022-04-08 15:20:58,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {188616#true} call #t~ret158 := main(); {188616#true} is VALID [2022-04-08 15:20:58,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {188616#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; {188616#true} is VALID [2022-04-08 15:20:58,654 INFO L272 TraceCheckUtils]: 6: Hoare triple {188616#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {188616#true} is VALID [2022-04-08 15:20:58,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {188616#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; {188616#true} is VALID [2022-04-08 15:20:58,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {188616#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; {188616#true} is VALID [2022-04-08 15:20:58,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {188616#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {188616#true} is VALID [2022-04-08 15:20:58,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-08 15:20:58,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {188616#true} assume 12292 == #t~mem49;havoc #t~mem49; {188616#true} is VALID [2022-04-08 15:20:58,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {188616#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; {188616#true} is VALID [2022-04-08 15:20:58,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {188616#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {188616#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {188616#true} is VALID [2022-04-08 15:20:58,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {188616#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {188616#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {188616#true} is VALID [2022-04-08 15:20:58,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {188616#true} assume !(0 == ~tmp___4~0); {188616#true} is VALID [2022-04-08 15:20:58,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {188616#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188616#true} is VALID [2022-04-08 15:20:58,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-08 15:20:58,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-08 15:20:58,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {188616#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {188616#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {188616#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {188616#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {188616#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {188616#true} assume 4368 == #t~mem54;havoc #t~mem54; {188616#true} is VALID [2022-04-08 15:20:58,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {188616#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; {188616#true} is VALID [2022-04-08 15:20:58,657 INFO L290 TraceCheckUtils]: 34: Hoare triple {188616#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {188616#true} is VALID [2022-04-08 15:20:58,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {188616#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; {188616#true} is VALID [2022-04-08 15:20:58,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {188616#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188616#true} is VALID [2022-04-08 15:20:58,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-08 15:20:58,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-08 15:20:58,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {188616#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,658 INFO L290 TraceCheckUtils]: 43: Hoare triple {188616#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {188616#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,658 INFO L290 TraceCheckUtils]: 45: Hoare triple {188616#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {188616#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {188616#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {188616#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {188616#true} assume 4384 == #t~mem56;havoc #t~mem56; {188616#true} is VALID [2022-04-08 15:20:58,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {188616#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {188616#true} is VALID [2022-04-08 15:20:58,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {188616#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {188616#true} is VALID [2022-04-08 15:20:58,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {188616#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {188616#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {188616#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,660 INFO L290 TraceCheckUtils]: 55: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {188616#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188616#true} is VALID [2022-04-08 15:20:58,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-08 15:20:58,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-08 15:20:58,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {188616#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {188616#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {188616#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {188616#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {188616#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {188616#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,661 INFO L290 TraceCheckUtils]: 66: Hoare triple {188616#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,661 INFO L290 TraceCheckUtils]: 67: Hoare triple {188616#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {188616#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {188616#true} assume 4400 == #t~mem58;havoc #t~mem58; {188616#true} is VALID [2022-04-08 15:20:58,661 INFO L290 TraceCheckUtils]: 70: Hoare triple {188616#true} 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); {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 71: Hoare triple {188616#true} 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; {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 72: Hoare triple {188616#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 73: Hoare triple {188616#true} assume !(~ret~0 <= 0); {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {188616#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 75: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {188616#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 77: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 78: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 79: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 80: Hoare triple {188616#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 81: Hoare triple {188616#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,662 INFO L290 TraceCheckUtils]: 82: Hoare triple {188616#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 83: Hoare triple {188616#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 84: Hoare triple {188616#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 85: Hoare triple {188616#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 86: Hoare triple {188616#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 87: Hoare triple {188616#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 88: Hoare triple {188616#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 89: Hoare triple {188616#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 90: Hoare triple {188616#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 91: Hoare triple {188616#true} assume 4416 == #t~mem60;havoc #t~mem60; {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 92: Hoare triple {188616#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 93: Hoare triple {188616#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 94: Hoare triple {188616#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 95: Hoare triple {188616#true} assume !(0 == ~tmp___6~0); {188616#true} is VALID [2022-04-08 15:20:58,663 INFO L290 TraceCheckUtils]: 96: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 97: Hoare triple {188616#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 98: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 99: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 100: Hoare triple {188616#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); {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 101: Hoare triple {188616#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 102: Hoare triple {188616#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 103: Hoare triple {188616#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 104: Hoare triple {188616#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 105: Hoare triple {188616#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 106: Hoare triple {188616#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 107: Hoare triple {188616#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 108: Hoare triple {188616#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 109: Hoare triple {188616#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,664 INFO L290 TraceCheckUtils]: 110: Hoare triple {188616#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,665 INFO L290 TraceCheckUtils]: 111: Hoare triple {188616#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,665 INFO L290 TraceCheckUtils]: 112: Hoare triple {188616#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,665 INFO L290 TraceCheckUtils]: 113: Hoare triple {188616#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-08 15:20:58,665 INFO L290 TraceCheckUtils]: 114: Hoare triple {188616#true} assume 4432 == #t~mem62;havoc #t~mem62; {188616#true} is VALID [2022-04-08 15:20:58,665 INFO L290 TraceCheckUtils]: 115: Hoare triple {188616#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {188616#true} is VALID [2022-04-08 15:20:58,665 INFO L290 TraceCheckUtils]: 116: Hoare triple {188616#true} assume !(5 == ~blastFlag~0); {188616#true} is VALID [2022-04-08 15:20:58,666 INFO L290 TraceCheckUtils]: 117: Hoare triple {188616#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:20:58,666 INFO L290 TraceCheckUtils]: 118: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} 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); {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:20:58,666 INFO L290 TraceCheckUtils]: 119: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:20:58,667 INFO L290 TraceCheckUtils]: 120: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} ~skip~0 := 0; {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:20:58,667 INFO L290 TraceCheckUtils]: 121: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !false; {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:20:58,667 INFO L290 TraceCheckUtils]: 122: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} 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); {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:20:58,668 INFO L290 TraceCheckUtils]: 123: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188622#(= |ssl3_connect_#t~mem50| 4448)} is VALID [2022-04-08 15:20:58,668 INFO L290 TraceCheckUtils]: 124: Hoare triple {188622#(= |ssl3_connect_#t~mem50| 4448)} assume 16384 == #t~mem50;havoc #t~mem50; {188617#false} is VALID [2022-04-08 15:20:58,668 INFO L290 TraceCheckUtils]: 125: Hoare triple {188617#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,668 INFO L290 TraceCheckUtils]: 126: Hoare triple {188617#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {188617#false} is VALID [2022-04-08 15:20:58,668 INFO L290 TraceCheckUtils]: 127: Hoare triple {188617#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,668 INFO L290 TraceCheckUtils]: 128: Hoare triple {188617#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {188617#false} is VALID [2022-04-08 15:20:58,668 INFO L290 TraceCheckUtils]: 129: Hoare triple {188617#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {188617#false} is VALID [2022-04-08 15:20:58,668 INFO L290 TraceCheckUtils]: 130: Hoare triple {188617#false} assume !(0 == ~tmp___4~0); {188617#false} is VALID [2022-04-08 15:20:58,668 INFO L290 TraceCheckUtils]: 131: Hoare triple {188617#false} 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); {188617#false} is VALID [2022-04-08 15:20:58,668 INFO L290 TraceCheckUtils]: 132: Hoare triple {188617#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); {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 133: Hoare triple {188617#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 134: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 135: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 136: Hoare triple {188617#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); {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 137: Hoare triple {188617#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 138: Hoare triple {188617#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 139: Hoare triple {188617#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 140: Hoare triple {188617#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 141: Hoare triple {188617#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 142: Hoare triple {188617#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 143: Hoare triple {188617#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 144: Hoare triple {188617#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 145: Hoare triple {188617#false} assume 4385 == #t~mem57;havoc #t~mem57; {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 146: Hoare triple {188617#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {188617#false} is VALID [2022-04-08 15:20:58,669 INFO L290 TraceCheckUtils]: 147: Hoare triple {188617#false} assume !(1 == ~blastFlag~0); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 148: Hoare triple {188617#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 149: Hoare triple {188617#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 150: Hoare triple {188617#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 151: Hoare triple {188617#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); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 152: Hoare triple {188617#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 153: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 154: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 155: Hoare triple {188617#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); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 156: Hoare triple {188617#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 157: Hoare triple {188617#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 158: Hoare triple {188617#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 159: Hoare triple {188617#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 160: Hoare triple {188617#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 161: Hoare triple {188617#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,670 INFO L290 TraceCheckUtils]: 162: Hoare triple {188617#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 163: Hoare triple {188617#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 164: Hoare triple {188617#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 165: Hoare triple {188617#false} assume 4400 == #t~mem58;havoc #t~mem58; {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 166: Hoare triple {188617#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); {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 167: Hoare triple {188617#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; {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 168: Hoare triple {188617#false} assume !(2 == ~blastFlag~0); {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 169: Hoare triple {188617#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 170: Hoare triple {188617#false} assume !(~ret~0 <= 0); {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 171: Hoare triple {188617#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 172: Hoare triple {188617#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); {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 173: Hoare triple {188617#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 174: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 175: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-08 15:20:58,671 INFO L290 TraceCheckUtils]: 176: Hoare triple {188617#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); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 177: Hoare triple {188617#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 178: Hoare triple {188617#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 179: Hoare triple {188617#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 180: Hoare triple {188617#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 181: Hoare triple {188617#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 182: Hoare triple {188617#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 183: Hoare triple {188617#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 184: Hoare triple {188617#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 185: Hoare triple {188617#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 186: Hoare triple {188617#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 187: Hoare triple {188617#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 188: Hoare triple {188617#false} assume 4416 == #t~mem60;havoc #t~mem60; {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 189: Hoare triple {188617#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 190: Hoare triple {188617#false} assume !(3 == ~blastFlag~0); {188617#false} is VALID [2022-04-08 15:20:58,672 INFO L290 TraceCheckUtils]: 191: Hoare triple {188617#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); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 192: Hoare triple {188617#false} assume !(0 == ~tmp___6~0); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 193: Hoare triple {188617#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); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 194: Hoare triple {188617#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 195: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 196: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 197: Hoare triple {188617#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); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 198: Hoare triple {188617#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 199: Hoare triple {188617#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 200: Hoare triple {188617#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 201: Hoare triple {188617#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 202: Hoare triple {188617#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 203: Hoare triple {188617#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 204: Hoare triple {188617#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 205: Hoare triple {188617#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,673 INFO L290 TraceCheckUtils]: 206: Hoare triple {188617#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,674 INFO L290 TraceCheckUtils]: 207: Hoare triple {188617#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,674 INFO L290 TraceCheckUtils]: 208: Hoare triple {188617#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,674 INFO L290 TraceCheckUtils]: 209: Hoare triple {188617#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,674 INFO L290 TraceCheckUtils]: 210: Hoare triple {188617#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-08 15:20:58,674 INFO L290 TraceCheckUtils]: 211: Hoare triple {188617#false} assume 4432 == #t~mem62;havoc #t~mem62; {188617#false} is VALID [2022-04-08 15:20:58,674 INFO L290 TraceCheckUtils]: 212: Hoare triple {188617#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {188617#false} is VALID [2022-04-08 15:20:58,674 INFO L290 TraceCheckUtils]: 213: Hoare triple {188617#false} assume 5 == ~blastFlag~0; {188617#false} is VALID [2022-04-08 15:20:58,674 INFO L290 TraceCheckUtils]: 214: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-08 15:20:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-04-08 15:20:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:20:58,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467993868] [2022-04-08 15:20:58,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467993868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:20:58,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:20:58,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:20:58,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:20:58,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [798063059] [2022-04-08 15:20:58,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [798063059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:20:58,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:20:58,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:20:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753547758] [2022-04-08 15:20:58,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:20:58,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 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 215 [2022-04-08 15:20:58,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:20:58,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:20:58,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:20:58,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:20:58,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:20:58,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:20:58,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:20:58,760 INFO L87 Difference]: Start difference. First operand 1535 states and 2294 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:00,779 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-08 15:21:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:21:02,556 INFO L93 Difference]: Finished difference Result 3383 states and 5036 transitions. [2022-04-08 15:21:02,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:21:02,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 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 215 [2022-04-08 15:21:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:21:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 15:21:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 15:21:02,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-08 15:21:02,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:21:03,000 INFO L225 Difference]: With dead ends: 3383 [2022-04-08 15:21:03,000 INFO L226 Difference]: Without dead ends: 1864 [2022-04-08 15:21:03,002 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-08 15:21:03,003 INFO L913 BasicCegarLoop]: 220 mSDtfsCounter, 81 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:21:03,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 530 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 492 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:21:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-04-08 15:21:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1535. [2022-04-08 15:21:03,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:21:03,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:03,139 INFO L74 IsIncluded]: Start isIncluded. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:03,140 INFO L87 Difference]: Start difference. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:21:03,233 INFO L93 Difference]: Finished difference Result 1864 states and 2756 transitions. [2022-04-08 15:21:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2756 transitions. [2022-04-08 15:21:03,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:21:03,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:21:03,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 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 1864 states. [2022-04-08 15:21:03,237 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 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 1864 states. [2022-04-08 15:21:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:21:03,323 INFO L93 Difference]: Finished difference Result 1864 states and 2756 transitions. [2022-04-08 15:21:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2756 transitions. [2022-04-08 15:21:03,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:21:03,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:21:03,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:21:03,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:21:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2288 transitions. [2022-04-08 15:21:03,415 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2288 transitions. Word has length 215 [2022-04-08 15:21:03,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:21:03,415 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2288 transitions. [2022-04-08 15:21:03,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:03,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2288 transitions. [2022-04-08 15:21:05,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2288 edges. 2288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:21:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2288 transitions. [2022-04-08 15:21:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-04-08 15:21:05,794 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:21:05,794 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:21:05,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 15:21:05,794 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:21:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:21:05,795 INFO L85 PathProgramCache]: Analyzing trace with hash -231635715, now seen corresponding path program 1 times [2022-04-08 15:21:05,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:21:05,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1000705553] [2022-04-08 15:21:16,895 WARN L232 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:21:29,307 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:21:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash -231635715, now seen corresponding path program 2 times [2022-04-08 15:21:29,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:21:29,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109082462] [2022-04-08 15:21:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:21:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:21:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:21:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:21:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:21:29,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {202199#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {202192#true} is VALID [2022-04-08 15:21:29,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {202192#true} assume true; {202192#true} is VALID [2022-04-08 15:21:29,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {202192#true} {202192#true} #593#return; {202192#true} is VALID [2022-04-08 15:21:29,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {202192#true} call ULTIMATE.init(); {202199#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:21:29,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {202199#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {202192#true} is VALID [2022-04-08 15:21:29,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {202192#true} assume true; {202192#true} is VALID [2022-04-08 15:21:29,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202192#true} {202192#true} #593#return; {202192#true} is VALID [2022-04-08 15:21:29,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {202192#true} call #t~ret158 := main(); {202192#true} is VALID [2022-04-08 15:21:29,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {202192#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; {202192#true} is VALID [2022-04-08 15:21:29,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {202192#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {202192#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; {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {202192#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; {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {202192#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {202192#true} assume 12292 == #t~mem49;havoc #t~mem49; {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {202192#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; {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {202192#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {202192#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {202192#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {202192#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {202192#true} is VALID [2022-04-08 15:21:29,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {202192#true} assume !(0 == ~tmp___4~0); {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {202192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {202192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {202192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {202192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {202192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {202192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {202192#true} assume 4368 == #t~mem54;havoc #t~mem54; {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {202192#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; {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {202192#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {202192#true} is VALID [2022-04-08 15:21:29,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {202192#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; {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {202192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {202192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {202192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {202192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {202192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {202192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {202192#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {202192#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {202192#true} assume 4384 == #t~mem56;havoc #t~mem56; {202192#true} is VALID [2022-04-08 15:21:29,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {202192#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {202192#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {202192#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {202192#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 54: Hoare triple {202192#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 55: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 56: Hoare triple {202192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 59: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 60: Hoare triple {202192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 61: Hoare triple {202192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {202192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {202192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {202192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 65: Hoare triple {202192#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {202192#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 67: Hoare triple {202192#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 68: Hoare triple {202192#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 69: Hoare triple {202192#true} assume 4400 == #t~mem58;havoc #t~mem58; {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 70: Hoare triple {202192#true} 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); {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 71: Hoare triple {202192#true} 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; {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 72: Hoare triple {202192#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {202192#true} assume !(~ret~0 <= 0); {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 74: Hoare triple {202192#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 75: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 76: Hoare triple {202192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 77: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 78: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-08 15:21:29,507 INFO L290 TraceCheckUtils]: 79: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 80: Hoare triple {202192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 81: Hoare triple {202192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 82: Hoare triple {202192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 83: Hoare triple {202192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 84: Hoare triple {202192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 85: Hoare triple {202192#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {202192#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 87: Hoare triple {202192#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 88: Hoare triple {202192#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {202192#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 90: Hoare triple {202192#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 91: Hoare triple {202192#true} assume 4416 == #t~mem60;havoc #t~mem60; {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 92: Hoare triple {202192#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 93: Hoare triple {202192#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {202192#true} is VALID [2022-04-08 15:21:29,508 INFO L290 TraceCheckUtils]: 94: Hoare triple {202192#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 95: Hoare triple {202192#true} assume !(0 == ~tmp___6~0); {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 96: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 97: Hoare triple {202192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 98: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 99: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 100: Hoare triple {202192#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); {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 101: Hoare triple {202192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 102: Hoare triple {202192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 103: Hoare triple {202192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 104: Hoare triple {202192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 105: Hoare triple {202192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 106: Hoare triple {202192#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 107: Hoare triple {202192#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,509 INFO L290 TraceCheckUtils]: 108: Hoare triple {202192#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,510 INFO L290 TraceCheckUtils]: 109: Hoare triple {202192#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,510 INFO L290 TraceCheckUtils]: 110: Hoare triple {202192#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,510 INFO L290 TraceCheckUtils]: 111: Hoare triple {202192#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,510 INFO L290 TraceCheckUtils]: 112: Hoare triple {202192#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,510 INFO L290 TraceCheckUtils]: 113: Hoare triple {202192#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-08 15:21:29,510 INFO L290 TraceCheckUtils]: 114: Hoare triple {202192#true} assume 4432 == #t~mem62;havoc #t~mem62; {202192#true} is VALID [2022-04-08 15:21:29,510 INFO L290 TraceCheckUtils]: 115: Hoare triple {202192#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {202192#true} is VALID [2022-04-08 15:21:29,510 INFO L290 TraceCheckUtils]: 116: Hoare triple {202192#true} assume !(5 == ~blastFlag~0); {202192#true} is VALID [2022-04-08 15:21:29,511 INFO L290 TraceCheckUtils]: 117: Hoare triple {202192#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:21:29,511 INFO L290 TraceCheckUtils]: 118: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} 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); {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:21:29,512 INFO L290 TraceCheckUtils]: 119: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:21:29,516 INFO L290 TraceCheckUtils]: 120: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} ~skip~0 := 0; {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:21:29,516 INFO L290 TraceCheckUtils]: 121: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !false; {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:21:29,517 INFO L290 TraceCheckUtils]: 122: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} 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); {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:21:29,517 INFO L290 TraceCheckUtils]: 123: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:21:29,517 INFO L290 TraceCheckUtils]: 124: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202198#(= |ssl3_connect_#t~mem51| 4448)} is VALID [2022-04-08 15:21:29,517 INFO L290 TraceCheckUtils]: 125: Hoare triple {202198#(= |ssl3_connect_#t~mem51| 4448)} assume 4096 == #t~mem51;havoc #t~mem51; {202193#false} is VALID [2022-04-08 15:21:29,517 INFO L290 TraceCheckUtils]: 126: Hoare triple {202193#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 127: Hoare triple {202193#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 128: Hoare triple {202193#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 129: Hoare triple {202193#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 130: Hoare triple {202193#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 131: Hoare triple {202193#false} assume !(0 == ~tmp___4~0); {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 132: Hoare triple {202193#false} 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); {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 133: Hoare triple {202193#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); {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 134: Hoare triple {202193#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 135: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 136: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 137: Hoare triple {202193#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); {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 138: Hoare triple {202193#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 139: Hoare triple {202193#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,518 INFO L290 TraceCheckUtils]: 140: Hoare triple {202193#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 141: Hoare triple {202193#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 142: Hoare triple {202193#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 143: Hoare triple {202193#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 144: Hoare triple {202193#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 145: Hoare triple {202193#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 146: Hoare triple {202193#false} assume 4385 == #t~mem57;havoc #t~mem57; {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 147: Hoare triple {202193#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 148: Hoare triple {202193#false} assume !(1 == ~blastFlag~0); {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 149: Hoare triple {202193#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 150: Hoare triple {202193#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 151: Hoare triple {202193#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 152: Hoare triple {202193#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); {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 153: Hoare triple {202193#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 154: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-08 15:21:29,519 INFO L290 TraceCheckUtils]: 155: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 156: Hoare triple {202193#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); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 157: Hoare triple {202193#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 158: Hoare triple {202193#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 159: Hoare triple {202193#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 160: Hoare triple {202193#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 161: Hoare triple {202193#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 162: Hoare triple {202193#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 163: Hoare triple {202193#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 164: Hoare triple {202193#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 165: Hoare triple {202193#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 166: Hoare triple {202193#false} assume 4400 == #t~mem58;havoc #t~mem58; {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 167: Hoare triple {202193#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); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 168: Hoare triple {202193#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; {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 169: Hoare triple {202193#false} assume !(2 == ~blastFlag~0); {202193#false} is VALID [2022-04-08 15:21:29,520 INFO L290 TraceCheckUtils]: 170: Hoare triple {202193#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 171: Hoare triple {202193#false} assume !(~ret~0 <= 0); {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 172: Hoare triple {202193#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 173: Hoare triple {202193#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); {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 174: Hoare triple {202193#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 175: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 176: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 177: Hoare triple {202193#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); {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 178: Hoare triple {202193#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 179: Hoare triple {202193#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 180: Hoare triple {202193#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 181: Hoare triple {202193#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 182: Hoare triple {202193#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 183: Hoare triple {202193#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 184: Hoare triple {202193#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,521 INFO L290 TraceCheckUtils]: 185: Hoare triple {202193#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 186: Hoare triple {202193#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 187: Hoare triple {202193#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 188: Hoare triple {202193#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 189: Hoare triple {202193#false} assume 4416 == #t~mem60;havoc #t~mem60; {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 190: Hoare triple {202193#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 191: Hoare triple {202193#false} assume !(3 == ~blastFlag~0); {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 192: Hoare triple {202193#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); {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 193: Hoare triple {202193#false} assume !(0 == ~tmp___6~0); {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 194: Hoare triple {202193#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); {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 195: Hoare triple {202193#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 196: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 197: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 198: Hoare triple {202193#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); {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 199: Hoare triple {202193#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,522 INFO L290 TraceCheckUtils]: 200: Hoare triple {202193#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 201: Hoare triple {202193#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 202: Hoare triple {202193#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 203: Hoare triple {202193#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 204: Hoare triple {202193#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 205: Hoare triple {202193#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 206: Hoare triple {202193#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 207: Hoare triple {202193#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 208: Hoare triple {202193#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 209: Hoare triple {202193#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 210: Hoare triple {202193#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 211: Hoare triple {202193#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-08 15:21:29,523 INFO L290 TraceCheckUtils]: 212: Hoare triple {202193#false} assume 4432 == #t~mem62;havoc #t~mem62; {202193#false} is VALID [2022-04-08 15:21:29,524 INFO L290 TraceCheckUtils]: 213: Hoare triple {202193#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {202193#false} is VALID [2022-04-08 15:21:29,524 INFO L290 TraceCheckUtils]: 214: Hoare triple {202193#false} assume 5 == ~blastFlag~0; {202193#false} is VALID [2022-04-08 15:21:29,524 INFO L290 TraceCheckUtils]: 215: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-08 15:21:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-04-08 15:21:29,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:21:29,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109082462] [2022-04-08 15:21:29,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109082462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:21:29,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:21:29,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:21:29,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:21:29,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1000705553] [2022-04-08 15:21:29,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1000705553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:21:29,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:21:29,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:21:29,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705282617] [2022-04-08 15:21:29,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:21:29,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 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 216 [2022-04-08 15:21:29,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:21:29,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:29,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:21:29,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:21:29,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:21:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:21:29,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:21:29,601 INFO L87 Difference]: Start difference. First operand 1535 states and 2288 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:31,621 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-08 15:21:33,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:21:33,386 INFO L93 Difference]: Finished difference Result 3383 states and 5024 transitions. [2022-04-08 15:21:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:21:33,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 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 216 [2022-04-08 15:21:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:21:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 15:21:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 15:21:33,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-08 15:21:33,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:21:33,822 INFO L225 Difference]: With dead ends: 3383 [2022-04-08 15:21:33,822 INFO L226 Difference]: Without dead ends: 1864 [2022-04-08 15:21:33,824 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-08 15:21:33,824 INFO L913 BasicCegarLoop]: 219 mSDtfsCounter, 79 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:21:33,824 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 528 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 491 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:21:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-04-08 15:21:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1535. [2022-04-08 15:21:33,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:21:33,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:33,951 INFO L74 IsIncluded]: Start isIncluded. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:33,952 INFO L87 Difference]: Start difference. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:21:34,066 INFO L93 Difference]: Finished difference Result 1864 states and 2750 transitions. [2022-04-08 15:21:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2750 transitions. [2022-04-08 15:21:34,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:21:34,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:21:34,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 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 1864 states. [2022-04-08 15:21:34,071 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 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 1864 states. [2022-04-08 15:21:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:21:34,175 INFO L93 Difference]: Finished difference Result 1864 states and 2750 transitions. [2022-04-08 15:21:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2750 transitions. [2022-04-08 15:21:34,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:21:34,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:21:34,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:21:34,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:21:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2282 transitions. [2022-04-08 15:21:34,272 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2282 transitions. Word has length 216 [2022-04-08 15:21:34,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:21:34,272 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2282 transitions. [2022-04-08 15:21:34,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:21:34,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2282 transitions. [2022-04-08 15:21:36,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2282 edges. 2282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:21:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2282 transitions. [2022-04-08 15:21:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-04-08 15:21:36,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:21:36,697 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:21:36,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 15:21:36,697 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:21:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:21:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1546125371, now seen corresponding path program 1 times [2022-04-08 15:21:36,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:21:36,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720762962] [2022-04-08 15:21:53,681 WARN L232 SmtUtils]: Spent 11.10s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:22:02,429 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:22:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1546125371, now seen corresponding path program 2 times [2022-04-08 15:22:02,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:22:02,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456840115] [2022-04-08 15:22:02,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:22:02,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:22:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:22:02,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:22:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:22:02,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {215775#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {215768#true} is VALID [2022-04-08 15:22:02,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {215768#true} assume true; {215768#true} is VALID [2022-04-08 15:22:02,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215768#true} {215768#true} #593#return; {215768#true} is VALID [2022-04-08 15:22:02,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {215768#true} call ULTIMATE.init(); {215775#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:22:02,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {215775#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {215768#true} is VALID [2022-04-08 15:22:02,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {215768#true} assume true; {215768#true} is VALID [2022-04-08 15:22:02,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215768#true} {215768#true} #593#return; {215768#true} is VALID [2022-04-08 15:22:02,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {215768#true} call #t~ret158 := main(); {215768#true} is VALID [2022-04-08 15:22:02,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {215768#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; {215768#true} is VALID [2022-04-08 15:22:02,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {215768#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {215768#true} is VALID [2022-04-08 15:22:02,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {215768#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; {215768#true} is VALID [2022-04-08 15:22:02,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {215768#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; {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {215768#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {215768#true} assume 12292 == #t~mem49;havoc #t~mem49; {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {215768#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; {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {215768#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {215768#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {215768#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {215768#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {215768#true} assume !(0 == ~tmp___4~0); {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {215768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215768#true} is VALID [2022-04-08 15:22:02,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {215768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {215768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {215768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {215768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {215768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {215768#true} assume 4368 == #t~mem54;havoc #t~mem54; {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {215768#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; {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {215768#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {215768#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; {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {215768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {215768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {215768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {215768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {215768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {215768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {215768#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {215768#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {215768#true} assume 4384 == #t~mem56;havoc #t~mem56; {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 50: Hoare triple {215768#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 51: Hoare triple {215768#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 52: Hoare triple {215768#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,615 INFO L290 TraceCheckUtils]: 53: Hoare triple {215768#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 54: Hoare triple {215768#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 55: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 56: Hoare triple {215768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 57: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 58: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 59: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 60: Hoare triple {215768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 61: Hoare triple {215768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 62: Hoare triple {215768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 63: Hoare triple {215768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 64: Hoare triple {215768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 65: Hoare triple {215768#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 66: Hoare triple {215768#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,616 INFO L290 TraceCheckUtils]: 67: Hoare triple {215768#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 68: Hoare triple {215768#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 69: Hoare triple {215768#true} assume 4400 == #t~mem58;havoc #t~mem58; {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 70: Hoare triple {215768#true} 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); {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 71: Hoare triple {215768#true} 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; {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 72: Hoare triple {215768#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 73: Hoare triple {215768#true} assume !(~ret~0 <= 0); {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 74: Hoare triple {215768#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 75: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 76: Hoare triple {215768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 77: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 78: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 79: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 80: Hoare triple {215768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 81: Hoare triple {215768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,617 INFO L290 TraceCheckUtils]: 82: Hoare triple {215768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,618 INFO L290 TraceCheckUtils]: 83: Hoare triple {215768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {215768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,638 INFO L290 TraceCheckUtils]: 85: Hoare triple {215768#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,638 INFO L290 TraceCheckUtils]: 86: Hoare triple {215768#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,638 INFO L290 TraceCheckUtils]: 87: Hoare triple {215768#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,638 INFO L290 TraceCheckUtils]: 88: Hoare triple {215768#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,638 INFO L290 TraceCheckUtils]: 89: Hoare triple {215768#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,638 INFO L290 TraceCheckUtils]: 90: Hoare triple {215768#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,638 INFO L290 TraceCheckUtils]: 91: Hoare triple {215768#true} assume 4416 == #t~mem60;havoc #t~mem60; {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {215768#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 93: Hoare triple {215768#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 94: Hoare triple {215768#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 95: Hoare triple {215768#true} assume !(0 == ~tmp___6~0); {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 96: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 97: Hoare triple {215768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 98: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 99: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 100: Hoare triple {215768#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); {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 101: Hoare triple {215768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 102: Hoare triple {215768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 103: Hoare triple {215768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,639 INFO L290 TraceCheckUtils]: 104: Hoare triple {215768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 105: Hoare triple {215768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 106: Hoare triple {215768#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 107: Hoare triple {215768#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 108: Hoare triple {215768#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 109: Hoare triple {215768#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 110: Hoare triple {215768#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 111: Hoare triple {215768#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 112: Hoare triple {215768#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 113: Hoare triple {215768#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 114: Hoare triple {215768#true} assume 4432 == #t~mem62;havoc #t~mem62; {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 115: Hoare triple {215768#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {215768#true} is VALID [2022-04-08 15:22:02,640 INFO L290 TraceCheckUtils]: 116: Hoare triple {215768#true} assume !(5 == ~blastFlag~0); {215768#true} is VALID [2022-04-08 15:22:02,641 INFO L290 TraceCheckUtils]: 117: Hoare triple {215768#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:02,642 INFO L290 TraceCheckUtils]: 118: Hoare triple {215773#(not (= 20480 (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); {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:02,642 INFO L290 TraceCheckUtils]: 119: Hoare triple {215773#(not (= 20480 (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; {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:02,642 INFO L290 TraceCheckUtils]: 120: Hoare triple {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:02,643 INFO L290 TraceCheckUtils]: 121: Hoare triple {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:02,647 INFO L290 TraceCheckUtils]: 122: Hoare triple {215773#(not (= 20480 (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); {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:02,647 INFO L290 TraceCheckUtils]: 123: Hoare triple {215773#(not (= 20480 (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); {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:02,648 INFO L290 TraceCheckUtils]: 124: Hoare triple {215773#(not (= 20480 (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); {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:02,648 INFO L290 TraceCheckUtils]: 125: Hoare triple {215773#(not (= 20480 (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); {215774#(not (= |ssl3_connect_#t~mem52| 20480))} is VALID [2022-04-08 15:22:02,648 INFO L290 TraceCheckUtils]: 126: Hoare triple {215774#(not (= |ssl3_connect_#t~mem52| 20480))} assume 20480 == #t~mem52;havoc #t~mem52; {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 127: Hoare triple {215769#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 128: Hoare triple {215769#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 129: Hoare triple {215769#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 130: Hoare triple {215769#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 131: Hoare triple {215769#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 132: Hoare triple {215769#false} assume !(0 == ~tmp___4~0); {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 133: Hoare triple {215769#false} 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); {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 134: Hoare triple {215769#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); {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 135: Hoare triple {215769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 136: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 137: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 138: Hoare triple {215769#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); {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 139: Hoare triple {215769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,649 INFO L290 TraceCheckUtils]: 140: Hoare triple {215769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 141: Hoare triple {215769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 142: Hoare triple {215769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 143: Hoare triple {215769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 144: Hoare triple {215769#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 145: Hoare triple {215769#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 146: Hoare triple {215769#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 147: Hoare triple {215769#false} assume 4385 == #t~mem57;havoc #t~mem57; {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 148: Hoare triple {215769#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 149: Hoare triple {215769#false} assume !(1 == ~blastFlag~0); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 150: Hoare triple {215769#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 151: Hoare triple {215769#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 152: Hoare triple {215769#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 153: Hoare triple {215769#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); {215769#false} is VALID [2022-04-08 15:22:02,650 INFO L290 TraceCheckUtils]: 154: Hoare triple {215769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 155: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 156: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 157: Hoare triple {215769#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); {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 158: Hoare triple {215769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 159: Hoare triple {215769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 160: Hoare triple {215769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 161: Hoare triple {215769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 162: Hoare triple {215769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 163: Hoare triple {215769#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 164: Hoare triple {215769#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 165: Hoare triple {215769#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 166: Hoare triple {215769#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 167: Hoare triple {215769#false} assume 4400 == #t~mem58;havoc #t~mem58; {215769#false} is VALID [2022-04-08 15:22:02,651 INFO L290 TraceCheckUtils]: 168: Hoare triple {215769#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); {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 169: Hoare triple {215769#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; {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 170: Hoare triple {215769#false} assume !(2 == ~blastFlag~0); {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 171: Hoare triple {215769#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 172: Hoare triple {215769#false} assume !(~ret~0 <= 0); {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 173: Hoare triple {215769#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 174: Hoare triple {215769#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); {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 175: Hoare triple {215769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 176: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 177: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 178: Hoare triple {215769#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); {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 179: Hoare triple {215769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 180: Hoare triple {215769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 181: Hoare triple {215769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,652 INFO L290 TraceCheckUtils]: 182: Hoare triple {215769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 183: Hoare triple {215769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 184: Hoare triple {215769#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 185: Hoare triple {215769#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 186: Hoare triple {215769#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 187: Hoare triple {215769#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 188: Hoare triple {215769#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 189: Hoare triple {215769#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 190: Hoare triple {215769#false} assume 4416 == #t~mem60;havoc #t~mem60; {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 191: Hoare triple {215769#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 192: Hoare triple {215769#false} assume !(3 == ~blastFlag~0); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 193: Hoare triple {215769#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); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 194: Hoare triple {215769#false} assume !(0 == ~tmp___6~0); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 195: Hoare triple {215769#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); {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 196: Hoare triple {215769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215769#false} is VALID [2022-04-08 15:22:02,653 INFO L290 TraceCheckUtils]: 197: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 198: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 199: Hoare triple {215769#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); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 200: Hoare triple {215769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 201: Hoare triple {215769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 202: Hoare triple {215769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 203: Hoare triple {215769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 204: Hoare triple {215769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 205: Hoare triple {215769#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 206: Hoare triple {215769#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 207: Hoare triple {215769#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 208: Hoare triple {215769#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 209: Hoare triple {215769#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 210: Hoare triple {215769#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,654 INFO L290 TraceCheckUtils]: 211: Hoare triple {215769#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,655 INFO L290 TraceCheckUtils]: 212: Hoare triple {215769#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-08 15:22:02,655 INFO L290 TraceCheckUtils]: 213: Hoare triple {215769#false} assume 4432 == #t~mem62;havoc #t~mem62; {215769#false} is VALID [2022-04-08 15:22:02,655 INFO L290 TraceCheckUtils]: 214: Hoare triple {215769#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {215769#false} is VALID [2022-04-08 15:22:02,655 INFO L290 TraceCheckUtils]: 215: Hoare triple {215769#false} assume 5 == ~blastFlag~0; {215769#false} is VALID [2022-04-08 15:22:02,655 INFO L290 TraceCheckUtils]: 216: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-08 15:22:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-04-08 15:22:02,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:22:02,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456840115] [2022-04-08 15:22:02,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456840115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:22:02,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:22:02,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:22:02,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:22:02,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720762962] [2022-04-08 15:22:02,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720762962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:22:02,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:22:02,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:22:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975480118] [2022-04-08 15:22:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:22:02,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 217 [2022-04-08 15:22:02,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:22:02,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:02,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:22:02,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:22:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:22:02,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:22:02,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:22:02,729 INFO L87 Difference]: Start difference. First operand 1535 states and 2282 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:04,748 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-08 15:22:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:22:06,380 INFO L93 Difference]: Finished difference Result 3431 states and 5068 transitions. [2022-04-08 15:22:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:22:06,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 217 [2022-04-08 15:22:06,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:22:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 15:22:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 15:22:06,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-08 15:22:06,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:22:06,853 INFO L225 Difference]: With dead ends: 3431 [2022-04-08 15:22:06,853 INFO L226 Difference]: Without dead ends: 1912 [2022-04-08 15:22:06,855 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-08 15:22:06,855 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 116 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 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-08 15:22:06,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:22:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2022-04-08 15:22:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1535. [2022-04-08 15:22:06,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:22:06,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:06,982 INFO L74 IsIncluded]: Start isIncluded. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:06,982 INFO L87 Difference]: Start difference. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:22:07,072 INFO L93 Difference]: Finished difference Result 1912 states and 2772 transitions. [2022-04-08 15:22:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2772 transitions. [2022-04-08 15:22:07,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:22:07,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:22:07,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 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 1912 states. [2022-04-08 15:22:07,076 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 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 1912 states. [2022-04-08 15:22:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:22:07,166 INFO L93 Difference]: Finished difference Result 1912 states and 2772 transitions. [2022-04-08 15:22:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2772 transitions. [2022-04-08 15:22:07,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:22:07,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:22:07,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:22:07,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:22:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2248 transitions. [2022-04-08 15:22:07,257 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2248 transitions. Word has length 217 [2022-04-08 15:22:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:22:07,257 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2248 transitions. [2022-04-08 15:22:07,257 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:07,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2248 transitions. [2022-04-08 15:22:09,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2248 edges. 2248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:22:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2248 transitions. [2022-04-08 15:22:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-04-08 15:22:09,630 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:22:09,630 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:22:09,630 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 15:22:09,630 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:22:09,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:22:09,630 INFO L85 PathProgramCache]: Analyzing trace with hash 97880514, now seen corresponding path program 1 times [2022-04-08 15:22:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:22:09,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [961644626] [2022-04-08 15:22:37,207 WARN L232 SmtUtils]: Spent 22.37s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:22:47,521 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:22:47,522 INFO L85 PathProgramCache]: Analyzing trace with hash 97880514, now seen corresponding path program 2 times [2022-04-08 15:22:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:22:47,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333569110] [2022-04-08 15:22:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:22:47,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:22:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:22:47,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:22:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:22:47,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {229543#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {229536#true} is VALID [2022-04-08 15:22:47,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {229536#true} assume true; {229536#true} is VALID [2022-04-08 15:22:47,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {229536#true} {229536#true} #593#return; {229536#true} is VALID [2022-04-08 15:22:47,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {229536#true} call ULTIMATE.init(); {229543#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:22:47,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {229543#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {229536#true} is VALID [2022-04-08 15:22:47,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {229536#true} assume true; {229536#true} is VALID [2022-04-08 15:22:47,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229536#true} {229536#true} #593#return; {229536#true} is VALID [2022-04-08 15:22:47,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {229536#true} call #t~ret158 := main(); {229536#true} is VALID [2022-04-08 15:22:47,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {229536#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; {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L272 TraceCheckUtils]: 6: Hoare triple {229536#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {229536#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; {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {229536#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; {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {229536#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {229536#true} assume 12292 == #t~mem49;havoc #t~mem49; {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {229536#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; {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {229536#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {229536#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {229536#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {229536#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {229536#true} is VALID [2022-04-08 15:22:47,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {229536#true} assume !(0 == ~tmp___4~0); {229536#true} is VALID [2022-04-08 15:22:47,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {229536#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229536#true} is VALID [2022-04-08 15:22:47,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-08 15:22:47,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-08 15:22:47,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {229536#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {229536#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {229536#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {229536#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {229536#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {229536#true} assume 4368 == #t~mem54;havoc #t~mem54; {229536#true} is VALID [2022-04-08 15:22:47,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {229536#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; {229536#true} is VALID [2022-04-08 15:22:47,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {229536#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {229536#true} is VALID [2022-04-08 15:22:47,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {229536#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; {229536#true} is VALID [2022-04-08 15:22:47,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {229536#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229536#true} is VALID [2022-04-08 15:22:47,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-08 15:22:47,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-08 15:22:47,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {229536#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {229536#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {229536#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {229536#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {229536#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,743 INFO L290 TraceCheckUtils]: 47: Hoare triple {229536#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,743 INFO L290 TraceCheckUtils]: 48: Hoare triple {229536#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {229536#true} assume 4384 == #t~mem56;havoc #t~mem56; {229536#true} is VALID [2022-04-08 15:22:47,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {229536#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {229536#true} is VALID [2022-04-08 15:22:47,743 INFO L290 TraceCheckUtils]: 51: Hoare triple {229536#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {229536#true} is VALID [2022-04-08 15:22:47,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {229536#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {229536#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {229536#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {229536#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229536#true} is VALID [2022-04-08 15:22:47,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-08 15:22:47,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-08 15:22:47,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {229536#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {229536#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {229536#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,744 INFO L290 TraceCheckUtils]: 63: Hoare triple {229536#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {229536#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {229536#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {229536#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 67: Hoare triple {229536#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 68: Hoare triple {229536#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 69: Hoare triple {229536#true} assume 4400 == #t~mem58;havoc #t~mem58; {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 70: Hoare triple {229536#true} 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); {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 71: Hoare triple {229536#true} 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; {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 72: Hoare triple {229536#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 73: Hoare triple {229536#true} assume !(~ret~0 <= 0); {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 74: Hoare triple {229536#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 75: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 76: Hoare triple {229536#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229536#true} is VALID [2022-04-08 15:22:47,745 INFO L290 TraceCheckUtils]: 77: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 78: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 79: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 80: Hoare triple {229536#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 81: Hoare triple {229536#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 82: Hoare triple {229536#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 83: Hoare triple {229536#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 84: Hoare triple {229536#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 85: Hoare triple {229536#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 86: Hoare triple {229536#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 87: Hoare triple {229536#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 88: Hoare triple {229536#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 89: Hoare triple {229536#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 90: Hoare triple {229536#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,746 INFO L290 TraceCheckUtils]: 91: Hoare triple {229536#true} assume 4416 == #t~mem60;havoc #t~mem60; {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 92: Hoare triple {229536#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 93: Hoare triple {229536#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 94: Hoare triple {229536#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 95: Hoare triple {229536#true} assume !(0 == ~tmp___6~0); {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 96: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 97: Hoare triple {229536#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 98: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 99: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 100: Hoare triple {229536#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); {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 101: Hoare triple {229536#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 102: Hoare triple {229536#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,747 INFO L290 TraceCheckUtils]: 103: Hoare triple {229536#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,748 INFO L290 TraceCheckUtils]: 104: Hoare triple {229536#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,748 INFO L290 TraceCheckUtils]: 105: Hoare triple {229536#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,748 INFO L290 TraceCheckUtils]: 106: Hoare triple {229536#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,748 INFO L290 TraceCheckUtils]: 107: Hoare triple {229536#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,748 INFO L290 TraceCheckUtils]: 108: Hoare triple {229536#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,748 INFO L290 TraceCheckUtils]: 109: Hoare triple {229536#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,748 INFO L290 TraceCheckUtils]: 110: Hoare triple {229536#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,748 INFO L290 TraceCheckUtils]: 111: Hoare triple {229536#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,748 INFO L290 TraceCheckUtils]: 112: Hoare triple {229536#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,748 INFO L290 TraceCheckUtils]: 113: Hoare triple {229536#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-08 15:22:47,749 INFO L290 TraceCheckUtils]: 114: Hoare triple {229536#true} assume 4432 == #t~mem62;havoc #t~mem62; {229536#true} is VALID [2022-04-08 15:22:47,749 INFO L290 TraceCheckUtils]: 115: Hoare triple {229536#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {229536#true} is VALID [2022-04-08 15:22:47,749 INFO L290 TraceCheckUtils]: 116: Hoare triple {229536#true} assume !(5 == ~blastFlag~0); {229536#true} is VALID [2022-04-08 15:22:47,750 INFO L290 TraceCheckUtils]: 117: Hoare triple {229536#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:47,750 INFO L290 TraceCheckUtils]: 118: Hoare triple {229541#(not (= 4099 (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); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:47,751 INFO L290 TraceCheckUtils]: 119: Hoare triple {229541#(not (= 4099 (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; {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:47,751 INFO L290 TraceCheckUtils]: 120: Hoare triple {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:47,751 INFO L290 TraceCheckUtils]: 121: Hoare triple {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:47,752 INFO L290 TraceCheckUtils]: 122: Hoare triple {229541#(not (= 4099 (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); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:47,752 INFO L290 TraceCheckUtils]: 123: Hoare triple {229541#(not (= 4099 (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); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:47,752 INFO L290 TraceCheckUtils]: 124: Hoare triple {229541#(not (= 4099 (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); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:47,753 INFO L290 TraceCheckUtils]: 125: Hoare triple {229541#(not (= 4099 (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); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:22:47,753 INFO L290 TraceCheckUtils]: 126: Hoare triple {229541#(not (= 4099 (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); {229542#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-08 15:22:47,753 INFO L290 TraceCheckUtils]: 127: Hoare triple {229542#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {229537#false} is VALID [2022-04-08 15:22:47,753 INFO L290 TraceCheckUtils]: 128: Hoare triple {229537#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,754 INFO L290 TraceCheckUtils]: 129: Hoare triple {229537#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {229537#false} is VALID [2022-04-08 15:22:47,754 INFO L290 TraceCheckUtils]: 130: Hoare triple {229537#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,754 INFO L290 TraceCheckUtils]: 131: Hoare triple {229537#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {229537#false} is VALID [2022-04-08 15:22:47,754 INFO L290 TraceCheckUtils]: 132: Hoare triple {229537#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {229537#false} is VALID [2022-04-08 15:22:47,754 INFO L290 TraceCheckUtils]: 133: Hoare triple {229537#false} assume !(0 == ~tmp___4~0); {229537#false} is VALID [2022-04-08 15:22:47,754 INFO L290 TraceCheckUtils]: 134: Hoare triple {229537#false} 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); {229537#false} is VALID [2022-04-08 15:22:47,754 INFO L290 TraceCheckUtils]: 135: Hoare triple {229537#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); {229537#false} is VALID [2022-04-08 15:22:47,754 INFO L290 TraceCheckUtils]: 136: Hoare triple {229537#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229537#false} is VALID [2022-04-08 15:22:47,754 INFO L290 TraceCheckUtils]: 137: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-08 15:22:47,754 INFO L290 TraceCheckUtils]: 138: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-08 15:22:47,755 INFO L290 TraceCheckUtils]: 139: Hoare triple {229537#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); {229537#false} is VALID [2022-04-08 15:22:47,755 INFO L290 TraceCheckUtils]: 140: Hoare triple {229537#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,755 INFO L290 TraceCheckUtils]: 141: Hoare triple {229537#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,755 INFO L290 TraceCheckUtils]: 142: Hoare triple {229537#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,755 INFO L290 TraceCheckUtils]: 143: Hoare triple {229537#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,755 INFO L290 TraceCheckUtils]: 144: Hoare triple {229537#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,755 INFO L290 TraceCheckUtils]: 145: Hoare triple {229537#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,755 INFO L290 TraceCheckUtils]: 146: Hoare triple {229537#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,755 INFO L290 TraceCheckUtils]: 147: Hoare triple {229537#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,755 INFO L290 TraceCheckUtils]: 148: Hoare triple {229537#false} assume 4385 == #t~mem57;havoc #t~mem57; {229537#false} is VALID [2022-04-08 15:22:47,755 INFO L290 TraceCheckUtils]: 149: Hoare triple {229537#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {229537#false} is VALID [2022-04-08 15:22:47,756 INFO L290 TraceCheckUtils]: 150: Hoare triple {229537#false} assume !(1 == ~blastFlag~0); {229537#false} is VALID [2022-04-08 15:22:47,756 INFO L290 TraceCheckUtils]: 151: Hoare triple {229537#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,756 INFO L290 TraceCheckUtils]: 152: Hoare triple {229537#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,756 INFO L290 TraceCheckUtils]: 153: Hoare triple {229537#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,756 INFO L290 TraceCheckUtils]: 154: Hoare triple {229537#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); {229537#false} is VALID [2022-04-08 15:22:47,756 INFO L290 TraceCheckUtils]: 155: Hoare triple {229537#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229537#false} is VALID [2022-04-08 15:22:47,756 INFO L290 TraceCheckUtils]: 156: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-08 15:22:47,756 INFO L290 TraceCheckUtils]: 157: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-08 15:22:47,756 INFO L290 TraceCheckUtils]: 158: Hoare triple {229537#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); {229537#false} is VALID [2022-04-08 15:22:47,756 INFO L290 TraceCheckUtils]: 159: Hoare triple {229537#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,756 INFO L290 TraceCheckUtils]: 160: Hoare triple {229537#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,757 INFO L290 TraceCheckUtils]: 161: Hoare triple {229537#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,757 INFO L290 TraceCheckUtils]: 162: Hoare triple {229537#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,757 INFO L290 TraceCheckUtils]: 163: Hoare triple {229537#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,757 INFO L290 TraceCheckUtils]: 164: Hoare triple {229537#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,757 INFO L290 TraceCheckUtils]: 165: Hoare triple {229537#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,757 INFO L290 TraceCheckUtils]: 166: Hoare triple {229537#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,757 INFO L290 TraceCheckUtils]: 167: Hoare triple {229537#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,757 INFO L290 TraceCheckUtils]: 168: Hoare triple {229537#false} assume 4400 == #t~mem58;havoc #t~mem58; {229537#false} is VALID [2022-04-08 15:22:47,757 INFO L290 TraceCheckUtils]: 169: Hoare triple {229537#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); {229537#false} is VALID [2022-04-08 15:22:47,757 INFO L290 TraceCheckUtils]: 170: Hoare triple {229537#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; {229537#false} is VALID [2022-04-08 15:22:47,757 INFO L290 TraceCheckUtils]: 171: Hoare triple {229537#false} assume !(2 == ~blastFlag~0); {229537#false} is VALID [2022-04-08 15:22:47,758 INFO L290 TraceCheckUtils]: 172: Hoare triple {229537#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {229537#false} is VALID [2022-04-08 15:22:47,758 INFO L290 TraceCheckUtils]: 173: Hoare triple {229537#false} assume !(~ret~0 <= 0); {229537#false} is VALID [2022-04-08 15:22:47,758 INFO L290 TraceCheckUtils]: 174: Hoare triple {229537#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,758 INFO L290 TraceCheckUtils]: 175: Hoare triple {229537#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); {229537#false} is VALID [2022-04-08 15:22:47,758 INFO L290 TraceCheckUtils]: 176: Hoare triple {229537#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229537#false} is VALID [2022-04-08 15:22:47,758 INFO L290 TraceCheckUtils]: 177: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-08 15:22:47,758 INFO L290 TraceCheckUtils]: 178: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-08 15:22:47,758 INFO L290 TraceCheckUtils]: 179: Hoare triple {229537#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); {229537#false} is VALID [2022-04-08 15:22:47,758 INFO L290 TraceCheckUtils]: 180: Hoare triple {229537#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,758 INFO L290 TraceCheckUtils]: 181: Hoare triple {229537#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,758 INFO L290 TraceCheckUtils]: 182: Hoare triple {229537#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,759 INFO L290 TraceCheckUtils]: 183: Hoare triple {229537#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,759 INFO L290 TraceCheckUtils]: 184: Hoare triple {229537#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,759 INFO L290 TraceCheckUtils]: 185: Hoare triple {229537#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,759 INFO L290 TraceCheckUtils]: 186: Hoare triple {229537#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,759 INFO L290 TraceCheckUtils]: 187: Hoare triple {229537#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,759 INFO L290 TraceCheckUtils]: 188: Hoare triple {229537#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,759 INFO L290 TraceCheckUtils]: 189: Hoare triple {229537#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,759 INFO L290 TraceCheckUtils]: 190: Hoare triple {229537#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,759 INFO L290 TraceCheckUtils]: 191: Hoare triple {229537#false} assume 4416 == #t~mem60;havoc #t~mem60; {229537#false} is VALID [2022-04-08 15:22:47,759 INFO L290 TraceCheckUtils]: 192: Hoare triple {229537#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {229537#false} is VALID [2022-04-08 15:22:47,759 INFO L290 TraceCheckUtils]: 193: Hoare triple {229537#false} assume !(3 == ~blastFlag~0); {229537#false} is VALID [2022-04-08 15:22:47,760 INFO L290 TraceCheckUtils]: 194: Hoare triple {229537#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); {229537#false} is VALID [2022-04-08 15:22:47,760 INFO L290 TraceCheckUtils]: 195: Hoare triple {229537#false} assume !(0 == ~tmp___6~0); {229537#false} is VALID [2022-04-08 15:22:47,760 INFO L290 TraceCheckUtils]: 196: Hoare triple {229537#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); {229537#false} is VALID [2022-04-08 15:22:47,760 INFO L290 TraceCheckUtils]: 197: Hoare triple {229537#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229537#false} is VALID [2022-04-08 15:22:47,760 INFO L290 TraceCheckUtils]: 198: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-08 15:22:47,760 INFO L290 TraceCheckUtils]: 199: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-08 15:22:47,760 INFO L290 TraceCheckUtils]: 200: Hoare triple {229537#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); {229537#false} is VALID [2022-04-08 15:22:47,760 INFO L290 TraceCheckUtils]: 201: Hoare triple {229537#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,760 INFO L290 TraceCheckUtils]: 202: Hoare triple {229537#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,760 INFO L290 TraceCheckUtils]: 203: Hoare triple {229537#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,760 INFO L290 TraceCheckUtils]: 204: Hoare triple {229537#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,761 INFO L290 TraceCheckUtils]: 205: Hoare triple {229537#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,761 INFO L290 TraceCheckUtils]: 206: Hoare triple {229537#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,761 INFO L290 TraceCheckUtils]: 207: Hoare triple {229537#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,761 INFO L290 TraceCheckUtils]: 208: Hoare triple {229537#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,761 INFO L290 TraceCheckUtils]: 209: Hoare triple {229537#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,761 INFO L290 TraceCheckUtils]: 210: Hoare triple {229537#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,761 INFO L290 TraceCheckUtils]: 211: Hoare triple {229537#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,761 INFO L290 TraceCheckUtils]: 212: Hoare triple {229537#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,761 INFO L290 TraceCheckUtils]: 213: Hoare triple {229537#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-08 15:22:47,761 INFO L290 TraceCheckUtils]: 214: Hoare triple {229537#false} assume 4432 == #t~mem62;havoc #t~mem62; {229537#false} is VALID [2022-04-08 15:22:47,761 INFO L290 TraceCheckUtils]: 215: Hoare triple {229537#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {229537#false} is VALID [2022-04-08 15:22:47,762 INFO L290 TraceCheckUtils]: 216: Hoare triple {229537#false} assume 5 == ~blastFlag~0; {229537#false} is VALID [2022-04-08 15:22:47,762 INFO L290 TraceCheckUtils]: 217: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-08 15:22:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-04-08 15:22:47,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:22:47,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333569110] [2022-04-08 15:22:47,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333569110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:22:47,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:22:47,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:22:47,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:22:47,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [961644626] [2022-04-08 15:22:47,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [961644626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:22:47,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:22:47,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:22:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408390511] [2022-04-08 15:22:47,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:22:47,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 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 218 [2022-04-08 15:22:47,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:22:47,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:47,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:22:47,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:22:47,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:22:47,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:22:47,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:22:47,849 INFO L87 Difference]: Start difference. First operand 1535 states and 2248 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:51,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:22:53,340 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-08 15:22:55,370 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-08 15:22:57,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:22:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:22:59,032 INFO L93 Difference]: Finished difference Result 3431 states and 5000 transitions. [2022-04-08 15:22:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:22:59,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 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 218 [2022-04-08 15:22:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:22:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 15:22:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 15:22:59,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-08 15:22:59,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:22:59,485 INFO L225 Difference]: With dead ends: 3431 [2022-04-08 15:22:59,485 INFO L226 Difference]: Without dead ends: 1912 [2022-04-08 15:22:59,487 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-08 15:22:59,487 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 114 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:22:59,487 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 280 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2022-04-08 15:22:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2022-04-08 15:22:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1535. [2022-04-08 15:22:59,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:22:59,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:59,640 INFO L74 IsIncluded]: Start isIncluded. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:59,641 INFO L87 Difference]: Start difference. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:22:59,741 INFO L93 Difference]: Finished difference Result 1912 states and 2738 transitions. [2022-04-08 15:22:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2738 transitions. [2022-04-08 15:22:59,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:22:59,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:22:59,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 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 1912 states. [2022-04-08 15:22:59,745 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 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 1912 states. [2022-04-08 15:22:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:22:59,834 INFO L93 Difference]: Finished difference Result 1912 states and 2738 transitions. [2022-04-08 15:22:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2738 transitions. [2022-04-08 15:22:59,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:22:59,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:22:59,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:22:59,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:22:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2214 transitions. [2022-04-08 15:22:59,933 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2214 transitions. Word has length 218 [2022-04-08 15:22:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:22:59,933 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2214 transitions. [2022-04-08 15:22:59,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:22:59,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2214 transitions. [2022-04-08 15:23:02,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2214 edges. 2214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:23:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2214 transitions. [2022-04-08 15:23:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-04-08 15:23:02,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:23:02,429 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:23:02,429 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 15:23:02,429 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:23:02,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:23:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash -252957758, now seen corresponding path program 1 times [2022-04-08 15:23:02,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:23:02,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1141395228] [2022-04-08 15:23:18,770 WARN L232 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:23:29,184 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:23:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash -252957758, now seen corresponding path program 2 times [2022-04-08 15:23:29,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:23:29,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33560172] [2022-04-08 15:23:29,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:23:29,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:23:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:23:29,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:23:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:23:29,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {243311#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {243304#true} is VALID [2022-04-08 15:23:29,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {243304#true} assume true; {243304#true} is VALID [2022-04-08 15:23:29,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {243304#true} {243304#true} #593#return; {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {243304#true} call ULTIMATE.init(); {243311#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:23:29,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {243311#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {243304#true} assume true; {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243304#true} {243304#true} #593#return; {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {243304#true} call #t~ret158 := main(); {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {243304#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; {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L272 TraceCheckUtils]: 6: Hoare triple {243304#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {243304#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; {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {243304#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; {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {243304#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-08 15:23:29,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {243304#true} assume 12292 == #t~mem49;havoc #t~mem49; {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {243304#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; {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {243304#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {243304#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {243304#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {243304#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {243304#true} assume !(0 == ~tmp___4~0); {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {243304#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {243304#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {243304#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {243304#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {243304#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {243304#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {243304#true} assume 4368 == #t~mem54;havoc #t~mem54; {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {243304#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; {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {243304#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {243304#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; {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {243304#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-08 15:23:29,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {243304#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {243304#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {243304#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {243304#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 46: Hoare triple {243304#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 47: Hoare triple {243304#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 48: Hoare triple {243304#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {243304#true} assume 4384 == #t~mem56;havoc #t~mem56; {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 50: Hoare triple {243304#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 51: Hoare triple {243304#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 52: Hoare triple {243304#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {243304#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {243304#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {243304#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 57: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 58: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 59: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {243304#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {243304#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {243304#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {243304#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {243304#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {243304#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {243304#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 67: Hoare triple {243304#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 68: Hoare triple {243304#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 69: Hoare triple {243304#true} assume 4400 == #t~mem58;havoc #t~mem58; {243304#true} is VALID [2022-04-08 15:23:29,379 INFO L290 TraceCheckUtils]: 70: Hoare triple {243304#true} 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); {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 71: Hoare triple {243304#true} 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; {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 72: Hoare triple {243304#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 73: Hoare triple {243304#true} assume !(~ret~0 <= 0); {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 74: Hoare triple {243304#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 75: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 76: Hoare triple {243304#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 77: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 78: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 79: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 80: Hoare triple {243304#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 81: Hoare triple {243304#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 82: Hoare triple {243304#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 83: Hoare triple {243304#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 84: Hoare triple {243304#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,380 INFO L290 TraceCheckUtils]: 85: Hoare triple {243304#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 86: Hoare triple {243304#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 87: Hoare triple {243304#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 88: Hoare triple {243304#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 89: Hoare triple {243304#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 90: Hoare triple {243304#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 91: Hoare triple {243304#true} assume 4416 == #t~mem60;havoc #t~mem60; {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 92: Hoare triple {243304#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 93: Hoare triple {243304#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 94: Hoare triple {243304#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 95: Hoare triple {243304#true} assume !(0 == ~tmp___6~0); {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 96: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 97: Hoare triple {243304#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 98: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-08 15:23:29,381 INFO L290 TraceCheckUtils]: 99: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 100: Hoare triple {243304#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); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 101: Hoare triple {243304#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 102: Hoare triple {243304#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 103: Hoare triple {243304#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 104: Hoare triple {243304#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 105: Hoare triple {243304#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 106: Hoare triple {243304#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 107: Hoare triple {243304#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 108: Hoare triple {243304#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 109: Hoare triple {243304#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 110: Hoare triple {243304#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 111: Hoare triple {243304#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 112: Hoare triple {243304#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 113: Hoare triple {243304#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-08 15:23:29,382 INFO L290 TraceCheckUtils]: 114: Hoare triple {243304#true} assume 4432 == #t~mem62;havoc #t~mem62; {243304#true} is VALID [2022-04-08 15:23:29,383 INFO L290 TraceCheckUtils]: 115: Hoare triple {243304#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {243304#true} is VALID [2022-04-08 15:23:29,383 INFO L290 TraceCheckUtils]: 116: Hoare triple {243304#true} assume !(5 == ~blastFlag~0); {243304#true} is VALID [2022-04-08 15:23:29,384 INFO L290 TraceCheckUtils]: 117: Hoare triple {243304#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,384 INFO L290 TraceCheckUtils]: 118: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} 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); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,384 INFO L290 TraceCheckUtils]: 119: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,384 INFO L290 TraceCheckUtils]: 120: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} ~skip~0 := 0; {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,385 INFO L290 TraceCheckUtils]: 121: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !false; {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,385 INFO L290 TraceCheckUtils]: 122: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} 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); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,385 INFO L290 TraceCheckUtils]: 123: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,385 INFO L290 TraceCheckUtils]: 124: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,386 INFO L290 TraceCheckUtils]: 125: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,386 INFO L290 TraceCheckUtils]: 126: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,386 INFO L290 TraceCheckUtils]: 127: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,386 INFO L290 TraceCheckUtils]: 128: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,387 INFO L290 TraceCheckUtils]: 129: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,387 INFO L290 TraceCheckUtils]: 130: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,387 INFO L290 TraceCheckUtils]: 131: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,387 INFO L290 TraceCheckUtils]: 132: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,388 INFO L290 TraceCheckUtils]: 133: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,388 INFO L290 TraceCheckUtils]: 134: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,388 INFO L290 TraceCheckUtils]: 135: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,389 INFO L290 TraceCheckUtils]: 136: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-08 15:23:29,389 INFO L290 TraceCheckUtils]: 137: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {243310#(= |ssl3_connect_#t~mem64| 4448)} is VALID [2022-04-08 15:23:29,389 INFO L290 TraceCheckUtils]: 138: Hoare triple {243310#(= |ssl3_connect_#t~mem64| 4448)} assume !(4448 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,389 INFO L290 TraceCheckUtils]: 139: Hoare triple {243305#false} assume !(4449 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,389 INFO L290 TraceCheckUtils]: 140: Hoare triple {243305#false} assume !(4464 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,389 INFO L290 TraceCheckUtils]: 141: Hoare triple {243305#false} assume !(4465 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,389 INFO L290 TraceCheckUtils]: 142: Hoare triple {243305#false} assume !(4466 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,389 INFO L290 TraceCheckUtils]: 143: Hoare triple {243305#false} assume !(4467 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 144: Hoare triple {243305#false} assume !(4480 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 145: Hoare triple {243305#false} assume !(4481 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 146: Hoare triple {243305#false} assume !(4496 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 147: Hoare triple {243305#false} assume !(4497 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 148: Hoare triple {243305#false} assume !(4512 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 149: Hoare triple {243305#false} assume 4513 == #t~mem75;havoc #t~mem75; {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 150: Hoare triple {243305#false} assume -2147483648 <= #t~nondet113 && #t~nondet113 <= 2147483647;~ret~0 := #t~nondet113;havoc #t~nondet113; {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 151: Hoare triple {243305#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem116.base, #t~mem116.offset := read~$Pointer$(#t~mem115.base, 888 + #t~mem115.offset, 8);call write~$Pointer$(#t~mem116.base, #t~mem116.offset, #t~mem114.base, 192 + #t~mem114.offset, 8);havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;havoc #t~mem116.base, #t~mem116.offset;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 967 + #t~mem117.offset, 8); {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 152: Hoare triple {243305#false} assume 0 == (#t~mem118.base + #t~mem118.offset) % 18446744073709551616;havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset;call #t~mem119.base, #t~mem119.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem119.base, 188 + #t~mem119.offset, 4);havoc #t~mem119.base, #t~mem119.offset; {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 153: Hoare triple {243305#false} assume !(0 == ~tmp___7~0); {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 154: Hoare triple {243305#false} assume !(0 == ~tmp___8~0); {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 155: Hoare triple {243305#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); {243305#false} is VALID [2022-04-08 15:23:29,390 INFO L290 TraceCheckUtils]: 156: Hoare triple {243305#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 157: Hoare triple {243305#false} ~skip~0 := 0; {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 158: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 159: Hoare triple {243305#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); {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 160: Hoare triple {243305#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 161: Hoare triple {243305#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 162: Hoare triple {243305#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 163: Hoare triple {243305#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 164: Hoare triple {243305#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 165: Hoare triple {243305#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 166: Hoare triple {243305#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 167: Hoare triple {243305#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 168: Hoare triple {243305#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 169: Hoare triple {243305#false} assume 4400 == #t~mem58;havoc #t~mem58; {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 170: Hoare triple {243305#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); {243305#false} is VALID [2022-04-08 15:23:29,391 INFO L290 TraceCheckUtils]: 171: Hoare triple {243305#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; {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 172: Hoare triple {243305#false} assume !(2 == ~blastFlag~0); {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 173: Hoare triple {243305#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 174: Hoare triple {243305#false} assume !(~ret~0 <= 0); {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 175: Hoare triple {243305#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 176: Hoare triple {243305#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); {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 177: Hoare triple {243305#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 178: Hoare triple {243305#false} ~skip~0 := 0; {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 179: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 180: Hoare triple {243305#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); {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 181: Hoare triple {243305#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 182: Hoare triple {243305#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 183: Hoare triple {243305#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 184: Hoare triple {243305#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,392 INFO L290 TraceCheckUtils]: 185: Hoare triple {243305#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 186: Hoare triple {243305#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 187: Hoare triple {243305#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 188: Hoare triple {243305#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 189: Hoare triple {243305#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 190: Hoare triple {243305#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 191: Hoare triple {243305#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 192: Hoare triple {243305#false} assume 4416 == #t~mem60;havoc #t~mem60; {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 193: Hoare triple {243305#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 194: Hoare triple {243305#false} assume !(3 == ~blastFlag~0); {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 195: Hoare triple {243305#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); {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 196: Hoare triple {243305#false} assume !(0 == ~tmp___6~0); {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 197: Hoare triple {243305#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); {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 198: Hoare triple {243305#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 199: Hoare triple {243305#false} ~skip~0 := 0; {243305#false} is VALID [2022-04-08 15:23:29,393 INFO L290 TraceCheckUtils]: 200: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 201: Hoare triple {243305#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); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 202: Hoare triple {243305#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 203: Hoare triple {243305#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 204: Hoare triple {243305#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 205: Hoare triple {243305#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 206: Hoare triple {243305#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 207: Hoare triple {243305#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 208: Hoare triple {243305#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 209: Hoare triple {243305#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 210: Hoare triple {243305#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 211: Hoare triple {243305#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 212: Hoare triple {243305#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 213: Hoare triple {243305#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 214: Hoare triple {243305#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-08 15:23:29,394 INFO L290 TraceCheckUtils]: 215: Hoare triple {243305#false} assume 4432 == #t~mem62;havoc #t~mem62; {243305#false} is VALID [2022-04-08 15:23:29,395 INFO L290 TraceCheckUtils]: 216: Hoare triple {243305#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {243305#false} is VALID [2022-04-08 15:23:29,395 INFO L290 TraceCheckUtils]: 217: Hoare triple {243305#false} assume 5 == ~blastFlag~0; {243305#false} is VALID [2022-04-08 15:23:29,395 INFO L290 TraceCheckUtils]: 218: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-08 15:23:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-04-08 15:23:29,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:23:29,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33560172] [2022-04-08 15:23:29,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33560172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:23:29,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:23:29,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:23:29,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:23:29,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1141395228] [2022-04-08 15:23:29,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1141395228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:23:29,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:23:29,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:23:29,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629774468] [2022-04-08 15:23:29,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:23:29,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 219 [2022-04-08 15:23:29,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:23:29,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:23:29,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:23:29,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:23:29,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:23:29,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:23:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:23:29,487 INFO L87 Difference]: Start difference. First operand 1535 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:23:31,508 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-08 15:23:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:23:32,824 INFO L93 Difference]: Finished difference Result 3131 states and 4510 transitions. [2022-04-08 15:23:32,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:23:32,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 219 [2022-04-08 15:23:32,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:23:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:23:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 375 transitions. [2022-04-08 15:23:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:23:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 375 transitions. [2022-04-08 15:23:32,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 375 transitions. [2022-04-08 15:23:33,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 375 edges. 375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:23:33,150 INFO L225 Difference]: With dead ends: 3131 [2022-04-08 15:23:33,150 INFO L226 Difference]: Without dead ends: 1612 [2022-04-08 15:23:33,152 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-08 15:23:33,152 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 17 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:23:33,152 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 466 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:23:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2022-04-08 15:23:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1577. [2022-04-08 15:23:33,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:23:33,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1612 states. Second operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:23:33,291 INFO L74 IsIncluded]: Start isIncluded. First operand 1612 states. Second operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:23:33,292 INFO L87 Difference]: Start difference. First operand 1612 states. Second operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:23:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:23:33,359 INFO L93 Difference]: Finished difference Result 1612 states and 2310 transitions. [2022-04-08 15:23:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2310 transitions. [2022-04-08 15:23:33,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:23:33,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:23:33,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 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 1612 states. [2022-04-08 15:23:33,361 INFO L87 Difference]: Start difference. First operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 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 1612 states. [2022-04-08 15:23:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:23:33,427 INFO L93 Difference]: Finished difference Result 1612 states and 2310 transitions. [2022-04-08 15:23:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2310 transitions. [2022-04-08 15:23:33,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:23:33,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:23:33,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:23:33,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:23:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:23:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2268 transitions. [2022-04-08 15:23:33,522 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2268 transitions. Word has length 219 [2022-04-08 15:23:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:23:33,522 INFO L478 AbstractCegarLoop]: Abstraction has 1577 states and 2268 transitions. [2022-04-08 15:23:33,522 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:23:33,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1577 states and 2268 transitions. [2022-04-08 15:23:35,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2268 edges. 2268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:23:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2268 transitions. [2022-04-08 15:23:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-04-08 15:23:35,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:23:35,981 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:23:35,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 15:23:35,981 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:23:35,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:23:35,981 INFO L85 PathProgramCache]: Analyzing trace with hash 944424234, now seen corresponding path program 1 times [2022-04-08 15:23:35,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:23:35,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [567682597] [2022-04-08 15:23:49,974 WARN L232 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:23:57,192 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:23:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash 944424234, now seen corresponding path program 2 times [2022-04-08 15:23:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:23:57,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698266277] [2022-04-08 15:23:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:23:57,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:23:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:23:57,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:23:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:23:57,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {255963#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {255956#true} is VALID [2022-04-08 15:23:57,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {255956#true} assume true; {255956#true} is VALID [2022-04-08 15:23:57,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {255956#true} {255956#true} #593#return; {255956#true} is VALID [2022-04-08 15:23:57,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {255956#true} call ULTIMATE.init(); {255963#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:23:57,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {255963#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {255956#true} assume true; {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {255956#true} {255956#true} #593#return; {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {255956#true} call #t~ret158 := main(); {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {255956#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; {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L272 TraceCheckUtils]: 6: Hoare triple {255956#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {255956#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; {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {255956#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; {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {255956#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {255956#true} assume 12292 == #t~mem49;havoc #t~mem49; {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {255956#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; {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {255956#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {255956#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {255956#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {255956#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {255956#true} assume !(0 == ~tmp___4~0); {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {255956#true} assume 4368 == #t~mem54;havoc #t~mem54; {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {255956#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; {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {255956#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {255956#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; {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {255956#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {255956#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {255956#true} assume 4384 == #t~mem56;havoc #t~mem56; {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {255956#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {255956#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {255956#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {255956#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {255956#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 59: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 60: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 61: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 62: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 63: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 64: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 65: Hoare triple {255956#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 66: Hoare triple {255956#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 67: Hoare triple {255956#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {255956#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {255956#true} assume 4400 == #t~mem58;havoc #t~mem58; {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 70: Hoare triple {255956#true} 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); {255956#true} is VALID [2022-04-08 15:23:57,391 INFO L290 TraceCheckUtils]: 71: Hoare triple {255956#true} 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; {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 72: Hoare triple {255956#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 73: Hoare triple {255956#true} assume !(~ret~0 <= 0); {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 74: Hoare triple {255956#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 75: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 77: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 78: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 79: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 80: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 81: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 82: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 83: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 84: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 85: Hoare triple {255956#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,392 INFO L290 TraceCheckUtils]: 86: Hoare triple {255956#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 87: Hoare triple {255956#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 88: Hoare triple {255956#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 89: Hoare triple {255956#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 90: Hoare triple {255956#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 91: Hoare triple {255956#true} assume 4416 == #t~mem60;havoc #t~mem60; {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 92: Hoare triple {255956#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 93: Hoare triple {255956#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 94: Hoare triple {255956#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 95: Hoare triple {255956#true} assume !(0 == ~tmp___6~0); {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 96: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 97: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 98: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 99: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-08 15:23:57,393 INFO L290 TraceCheckUtils]: 100: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 101: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 102: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 103: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 104: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 105: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 106: Hoare triple {255956#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 107: Hoare triple {255956#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 108: Hoare triple {255956#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 109: Hoare triple {255956#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 110: Hoare triple {255956#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 111: Hoare triple {255956#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 112: Hoare triple {255956#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 113: Hoare triple {255956#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 114: Hoare triple {255956#true} assume 4432 == #t~mem62;havoc #t~mem62; {255956#true} is VALID [2022-04-08 15:23:57,394 INFO L290 TraceCheckUtils]: 115: Hoare triple {255956#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 116: Hoare triple {255956#true} assume !(5 == ~blastFlag~0); {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 117: Hoare triple {255956#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 118: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 119: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 120: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 121: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 122: Hoare triple {255956#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); {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 123: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 124: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 125: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 126: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 127: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 128: Hoare triple {255956#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,395 INFO L290 TraceCheckUtils]: 129: Hoare triple {255956#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,396 INFO L290 TraceCheckUtils]: 130: Hoare triple {255956#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,396 INFO L290 TraceCheckUtils]: 131: Hoare triple {255956#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,396 INFO L290 TraceCheckUtils]: 132: Hoare triple {255956#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,396 INFO L290 TraceCheckUtils]: 133: Hoare triple {255956#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,396 INFO L290 TraceCheckUtils]: 134: Hoare triple {255956#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,396 INFO L290 TraceCheckUtils]: 135: Hoare triple {255956#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,396 INFO L290 TraceCheckUtils]: 136: Hoare triple {255956#true} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,396 INFO L290 TraceCheckUtils]: 137: Hoare triple {255956#true} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,396 INFO L290 TraceCheckUtils]: 138: Hoare triple {255956#true} assume 4448 == #t~mem64;havoc #t~mem64; {255956#true} is VALID [2022-04-08 15:23:57,396 INFO L290 TraceCheckUtils]: 139: Hoare triple {255956#true} assume -2147483648 <= #t~nondet100 && #t~nondet100 <= 2147483647;~ret~0 := #t~nondet100;havoc #t~nondet100; {255956#true} is VALID [2022-04-08 15:23:57,396 INFO L290 TraceCheckUtils]: 140: Hoare triple {255956#true} assume !(~ret~0 <= 0);call #t~mem101.base, #t~mem101.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem102 := read~int(#t~mem101.base, 912 + #t~mem101.offset, 4); {255956#true} is VALID [2022-04-08 15:23:57,397 INFO L290 TraceCheckUtils]: 141: Hoare triple {255956#true} assume !(0 != #t~mem102);havoc #t~mem101.base, #t~mem101.offset;havoc #t~mem102;call write~int(4480, ~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,398 INFO L290 TraceCheckUtils]: 142: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,398 INFO L290 TraceCheckUtils]: 143: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} 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); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,398 INFO L290 TraceCheckUtils]: 144: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,398 INFO L290 TraceCheckUtils]: 145: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} ~skip~0 := 0; {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,399 INFO L290 TraceCheckUtils]: 146: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !false; {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,399 INFO L290 TraceCheckUtils]: 147: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} 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); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,399 INFO L290 TraceCheckUtils]: 148: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,399 INFO L290 TraceCheckUtils]: 149: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,400 INFO L290 TraceCheckUtils]: 150: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,400 INFO L290 TraceCheckUtils]: 151: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,400 INFO L290 TraceCheckUtils]: 152: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,400 INFO L290 TraceCheckUtils]: 153: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,401 INFO L290 TraceCheckUtils]: 154: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:23:57,401 INFO L290 TraceCheckUtils]: 155: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255962#(= |ssl3_connect_#t~mem57| 4480)} is VALID [2022-04-08 15:23:57,401 INFO L290 TraceCheckUtils]: 156: Hoare triple {255962#(= |ssl3_connect_#t~mem57| 4480)} assume 4385 == #t~mem57;havoc #t~mem57; {255957#false} is VALID [2022-04-08 15:23:57,401 INFO L290 TraceCheckUtils]: 157: Hoare triple {255957#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {255957#false} is VALID [2022-04-08 15:23:57,401 INFO L290 TraceCheckUtils]: 158: Hoare triple {255957#false} assume !(1 == ~blastFlag~0); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 159: Hoare triple {255957#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 160: Hoare triple {255957#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 161: Hoare triple {255957#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 162: Hoare triple {255957#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); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 163: Hoare triple {255957#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 164: Hoare triple {255957#false} ~skip~0 := 0; {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 165: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 166: Hoare triple {255957#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); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 167: Hoare triple {255957#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 168: Hoare triple {255957#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 169: Hoare triple {255957#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 170: Hoare triple {255957#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 171: Hoare triple {255957#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 172: Hoare triple {255957#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,402 INFO L290 TraceCheckUtils]: 173: Hoare triple {255957#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 174: Hoare triple {255957#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 175: Hoare triple {255957#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 176: Hoare triple {255957#false} assume 4400 == #t~mem58;havoc #t~mem58; {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 177: Hoare triple {255957#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); {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 178: Hoare triple {255957#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; {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 179: Hoare triple {255957#false} assume !(2 == ~blastFlag~0); {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 180: Hoare triple {255957#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 181: Hoare triple {255957#false} assume !(~ret~0 <= 0); {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 182: Hoare triple {255957#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 183: Hoare triple {255957#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); {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 184: Hoare triple {255957#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 185: Hoare triple {255957#false} ~skip~0 := 0; {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 186: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-08 15:23:57,403 INFO L290 TraceCheckUtils]: 187: Hoare triple {255957#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); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 188: Hoare triple {255957#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 189: Hoare triple {255957#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 190: Hoare triple {255957#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 191: Hoare triple {255957#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 192: Hoare triple {255957#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 193: Hoare triple {255957#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 194: Hoare triple {255957#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 195: Hoare triple {255957#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 196: Hoare triple {255957#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 197: Hoare triple {255957#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 198: Hoare triple {255957#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 199: Hoare triple {255957#false} assume 4416 == #t~mem60;havoc #t~mem60; {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 200: Hoare triple {255957#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 201: Hoare triple {255957#false} assume !(3 == ~blastFlag~0); {255957#false} is VALID [2022-04-08 15:23:57,404 INFO L290 TraceCheckUtils]: 202: Hoare triple {255957#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); {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 203: Hoare triple {255957#false} assume !(0 == ~tmp___6~0); {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 204: Hoare triple {255957#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); {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 205: Hoare triple {255957#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 206: Hoare triple {255957#false} ~skip~0 := 0; {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 207: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 208: Hoare triple {255957#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); {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 209: Hoare triple {255957#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 210: Hoare triple {255957#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 211: Hoare triple {255957#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 212: Hoare triple {255957#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 213: Hoare triple {255957#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 214: Hoare triple {255957#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 215: Hoare triple {255957#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,405 INFO L290 TraceCheckUtils]: 216: Hoare triple {255957#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,406 INFO L290 TraceCheckUtils]: 217: Hoare triple {255957#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,406 INFO L290 TraceCheckUtils]: 218: Hoare triple {255957#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,406 INFO L290 TraceCheckUtils]: 219: Hoare triple {255957#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,406 INFO L290 TraceCheckUtils]: 220: Hoare triple {255957#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,406 INFO L290 TraceCheckUtils]: 221: Hoare triple {255957#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-08 15:23:57,406 INFO L290 TraceCheckUtils]: 222: Hoare triple {255957#false} assume 4432 == #t~mem62;havoc #t~mem62; {255957#false} is VALID [2022-04-08 15:23:57,406 INFO L290 TraceCheckUtils]: 223: Hoare triple {255957#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {255957#false} is VALID [2022-04-08 15:23:57,406 INFO L290 TraceCheckUtils]: 224: Hoare triple {255957#false} assume 5 == ~blastFlag~0; {255957#false} is VALID [2022-04-08 15:23:57,406 INFO L290 TraceCheckUtils]: 225: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-08 15:23:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2022-04-08 15:23:57,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:23:57,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698266277] [2022-04-08 15:23:57,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698266277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:23:57,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:23:57,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:23:57,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:23:57,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [567682597] [2022-04-08 15:23:57,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [567682597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:23:57,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:23:57,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:23:57,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970283537] [2022-04-08 15:23:57,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:23:57,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 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 226 [2022-04-08 15:23:57,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:23:57,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:23:57,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:23:57,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:23:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:23:57,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:23:57,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:23:57,497 INFO L87 Difference]: Start difference. First operand 1577 states and 2268 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:23:59,519 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-08 15:24:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:24:01,320 INFO L93 Difference]: Finished difference Result 3587 states and 5152 transitions. [2022-04-08 15:24:01,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:24:01,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 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 226 [2022-04-08 15:24:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:24:01,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 15:24:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 15:24:01,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-08 15:24:01,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:24:01,759 INFO L225 Difference]: With dead ends: 3587 [2022-04-08 15:24:01,760 INFO L226 Difference]: Without dead ends: 2026 [2022-04-08 15:24:01,761 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-08 15:24:01,762 INFO L913 BasicCegarLoop]: 218 mSDtfsCounter, 73 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:24:01,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 526 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 490 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:24:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2022-04-08 15:24:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1697. [2022-04-08 15:24:01,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:24:01,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2026 states. Second operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:01,956 INFO L74 IsIncluded]: Start isIncluded. First operand 2026 states. Second operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:01,957 INFO L87 Difference]: Start difference. First operand 2026 states. Second operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:24:02,084 INFO L93 Difference]: Finished difference Result 2026 states and 2898 transitions. [2022-04-08 15:24:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2898 transitions. [2022-04-08 15:24:02,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:24:02,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:24:02,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 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 2026 states. [2022-04-08 15:24:02,088 INFO L87 Difference]: Start difference. First operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 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 2026 states. [2022-04-08 15:24:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:24:02,188 INFO L93 Difference]: Finished difference Result 2026 states and 2898 transitions. [2022-04-08 15:24:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2898 transitions. [2022-04-08 15:24:02,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:24:02,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:24:02,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:24:02,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:24:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2430 transitions. [2022-04-08 15:24:02,306 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2430 transitions. Word has length 226 [2022-04-08 15:24:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:24:02,306 INFO L478 AbstractCegarLoop]: Abstraction has 1697 states and 2430 transitions. [2022-04-08 15:24:02,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:02,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1697 states and 2430 transitions. [2022-04-08 15:24:04,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2430 edges. 2430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:24:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2430 transitions. [2022-04-08 15:24:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-04-08 15:24:04,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:24:04,955 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:24:04,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-08 15:24:04,955 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:24:04,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:24:04,955 INFO L85 PathProgramCache]: Analyzing trace with hash -932058584, now seen corresponding path program 1 times [2022-04-08 15:24:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:24:04,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [13952740] [2022-04-08 15:24:19,955 WARN L232 SmtUtils]: Spent 9.77s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:24:29,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:24:29,009 INFO L85 PathProgramCache]: Analyzing trace with hash -932058584, now seen corresponding path program 2 times [2022-04-08 15:24:29,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:24:29,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962393594] [2022-04-08 15:24:29,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:24:29,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:24:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:24:29,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:24:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:24:29,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {270595#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {270588#true} is VALID [2022-04-08 15:24:29,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {270588#true} assume true; {270588#true} is VALID [2022-04-08 15:24:29,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {270588#true} {270588#true} #593#return; {270588#true} is VALID [2022-04-08 15:24:29,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {270588#true} call ULTIMATE.init(); {270595#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:24:29,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {270595#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {270588#true} is VALID [2022-04-08 15:24:29,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {270588#true} assume true; {270588#true} is VALID [2022-04-08 15:24:29,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {270588#true} {270588#true} #593#return; {270588#true} is VALID [2022-04-08 15:24:29,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {270588#true} call #t~ret158 := main(); {270588#true} is VALID [2022-04-08 15:24:29,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {270588#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; {270588#true} is VALID [2022-04-08 15:24:29,197 INFO L272 TraceCheckUtils]: 6: Hoare triple {270588#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {270588#true} is VALID [2022-04-08 15:24:29,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {270588#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; {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {270588#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; {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {270588#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {270588#true} assume 12292 == #t~mem49;havoc #t~mem49; {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {270588#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; {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {270588#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {270588#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {270588#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {270588#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {270588#true} assume !(0 == ~tmp___4~0); {270588#true} is VALID [2022-04-08 15:24:29,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {270588#true} assume 4368 == #t~mem54;havoc #t~mem54; {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {270588#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; {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {270588#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {270588#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; {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {270588#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {270588#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 49: Hoare triple {270588#true} assume 4384 == #t~mem56;havoc #t~mem56; {270588#true} is VALID [2022-04-08 15:24:29,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {270588#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 51: Hoare triple {270588#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {270588#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {270588#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 54: Hoare triple {270588#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 55: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 56: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 57: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 58: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 59: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 63: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 64: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {270588#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 66: Hoare triple {270588#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 67: Hoare triple {270588#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {270588#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {270588#true} assume 4400 == #t~mem58;havoc #t~mem58; {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {270588#true} 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); {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 71: Hoare triple {270588#true} 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; {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 72: Hoare triple {270588#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 73: Hoare triple {270588#true} assume !(~ret~0 <= 0); {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 74: Hoare triple {270588#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 75: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 76: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 77: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-08 15:24:29,202 INFO L290 TraceCheckUtils]: 78: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 79: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 80: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 81: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 82: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 83: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 84: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 85: Hoare triple {270588#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 86: Hoare triple {270588#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 87: Hoare triple {270588#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 88: Hoare triple {270588#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 89: Hoare triple {270588#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 90: Hoare triple {270588#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 91: Hoare triple {270588#true} assume 4416 == #t~mem60;havoc #t~mem60; {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 92: Hoare triple {270588#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {270588#true} is VALID [2022-04-08 15:24:29,203 INFO L290 TraceCheckUtils]: 93: Hoare triple {270588#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 94: Hoare triple {270588#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 95: Hoare triple {270588#true} assume !(0 == ~tmp___6~0); {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 96: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 97: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 98: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 99: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 100: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 101: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 102: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 103: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 104: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 105: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 106: Hoare triple {270588#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 107: Hoare triple {270588#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,204 INFO L290 TraceCheckUtils]: 108: Hoare triple {270588#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 109: Hoare triple {270588#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 110: Hoare triple {270588#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 111: Hoare triple {270588#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 112: Hoare triple {270588#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 113: Hoare triple {270588#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 114: Hoare triple {270588#true} assume 4432 == #t~mem62;havoc #t~mem62; {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 115: Hoare triple {270588#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 116: Hoare triple {270588#true} assume !(5 == ~blastFlag~0); {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 117: Hoare triple {270588#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 118: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 119: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 120: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 121: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-08 15:24:29,205 INFO L290 TraceCheckUtils]: 122: Hoare triple {270588#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); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 123: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 124: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 125: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 126: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 127: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 128: Hoare triple {270588#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 129: Hoare triple {270588#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 130: Hoare triple {270588#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 131: Hoare triple {270588#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 132: Hoare triple {270588#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 133: Hoare triple {270588#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 134: Hoare triple {270588#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 135: Hoare triple {270588#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 136: Hoare triple {270588#true} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,206 INFO L290 TraceCheckUtils]: 137: Hoare triple {270588#true} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,207 INFO L290 TraceCheckUtils]: 138: Hoare triple {270588#true} assume 4448 == #t~mem64;havoc #t~mem64; {270588#true} is VALID [2022-04-08 15:24:29,207 INFO L290 TraceCheckUtils]: 139: Hoare triple {270588#true} assume -2147483648 <= #t~nondet100 && #t~nondet100 <= 2147483647;~ret~0 := #t~nondet100;havoc #t~nondet100; {270588#true} is VALID [2022-04-08 15:24:29,207 INFO L290 TraceCheckUtils]: 140: Hoare triple {270588#true} assume !(~ret~0 <= 0);call #t~mem101.base, #t~mem101.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem102 := read~int(#t~mem101.base, 912 + #t~mem101.offset, 4); {270588#true} is VALID [2022-04-08 15:24:29,213 INFO L290 TraceCheckUtils]: 141: Hoare triple {270588#true} assume 0 != #t~mem102;havoc #t~mem101.base, #t~mem101.offset;havoc #t~mem102;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,214 INFO L290 TraceCheckUtils]: 142: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,215 INFO L290 TraceCheckUtils]: 143: Hoare triple {270593#(= 4464 (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); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,215 INFO L290 TraceCheckUtils]: 144: Hoare triple {270593#(= 4464 (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; {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,215 INFO L290 TraceCheckUtils]: 145: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,215 INFO L290 TraceCheckUtils]: 146: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,216 INFO L290 TraceCheckUtils]: 147: Hoare triple {270593#(= 4464 (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); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,216 INFO L290 TraceCheckUtils]: 148: Hoare triple {270593#(= 4464 (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); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,216 INFO L290 TraceCheckUtils]: 149: Hoare triple {270593#(= 4464 (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); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,217 INFO L290 TraceCheckUtils]: 150: Hoare triple {270593#(= 4464 (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); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,217 INFO L290 TraceCheckUtils]: 151: Hoare triple {270593#(= 4464 (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); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,217 INFO L290 TraceCheckUtils]: 152: Hoare triple {270593#(= 4464 (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); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,218 INFO L290 TraceCheckUtils]: 153: Hoare triple {270593#(= 4464 (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); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,218 INFO L290 TraceCheckUtils]: 154: Hoare triple {270593#(= 4464 (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); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:24:29,218 INFO L290 TraceCheckUtils]: 155: Hoare triple {270593#(= 4464 (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); {270594#(= |ssl3_connect_#t~mem57| 4464)} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 156: Hoare triple {270594#(= |ssl3_connect_#t~mem57| 4464)} assume 4385 == #t~mem57;havoc #t~mem57; {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 157: Hoare triple {270589#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 158: Hoare triple {270589#false} assume !(1 == ~blastFlag~0); {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 159: Hoare triple {270589#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 160: Hoare triple {270589#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 161: Hoare triple {270589#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 162: Hoare triple {270589#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); {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 163: Hoare triple {270589#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 164: Hoare triple {270589#false} ~skip~0 := 0; {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 165: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 166: Hoare triple {270589#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); {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 167: Hoare triple {270589#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,219 INFO L290 TraceCheckUtils]: 168: Hoare triple {270589#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 169: Hoare triple {270589#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 170: Hoare triple {270589#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 171: Hoare triple {270589#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 172: Hoare triple {270589#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 173: Hoare triple {270589#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 174: Hoare triple {270589#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 175: Hoare triple {270589#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 176: Hoare triple {270589#false} assume 4400 == #t~mem58;havoc #t~mem58; {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 177: Hoare triple {270589#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); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 178: Hoare triple {270589#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; {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 179: Hoare triple {270589#false} assume !(2 == ~blastFlag~0); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 180: Hoare triple {270589#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 181: Hoare triple {270589#false} assume !(~ret~0 <= 0); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 182: Hoare triple {270589#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,220 INFO L290 TraceCheckUtils]: 183: Hoare triple {270589#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); {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 184: Hoare triple {270589#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 185: Hoare triple {270589#false} ~skip~0 := 0; {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 186: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 187: Hoare triple {270589#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); {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 188: Hoare triple {270589#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 189: Hoare triple {270589#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 190: Hoare triple {270589#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 191: Hoare triple {270589#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 192: Hoare triple {270589#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 193: Hoare triple {270589#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 194: Hoare triple {270589#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 195: Hoare triple {270589#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 196: Hoare triple {270589#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,221 INFO L290 TraceCheckUtils]: 197: Hoare triple {270589#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 198: Hoare triple {270589#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 199: Hoare triple {270589#false} assume 4416 == #t~mem60;havoc #t~mem60; {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 200: Hoare triple {270589#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 201: Hoare triple {270589#false} assume !(3 == ~blastFlag~0); {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 202: Hoare triple {270589#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); {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 203: Hoare triple {270589#false} assume !(0 == ~tmp___6~0); {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 204: Hoare triple {270589#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); {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 205: Hoare triple {270589#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 206: Hoare triple {270589#false} ~skip~0 := 0; {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 207: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 208: Hoare triple {270589#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); {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 209: Hoare triple {270589#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 210: Hoare triple {270589#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 211: Hoare triple {270589#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,222 INFO L290 TraceCheckUtils]: 212: Hoare triple {270589#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 213: Hoare triple {270589#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 214: Hoare triple {270589#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 215: Hoare triple {270589#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 216: Hoare triple {270589#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 217: Hoare triple {270589#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 218: Hoare triple {270589#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 219: Hoare triple {270589#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 220: Hoare triple {270589#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 221: Hoare triple {270589#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 222: Hoare triple {270589#false} assume 4432 == #t~mem62;havoc #t~mem62; {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 223: Hoare triple {270589#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 224: Hoare triple {270589#false} assume 5 == ~blastFlag~0; {270589#false} is VALID [2022-04-08 15:24:29,223 INFO L290 TraceCheckUtils]: 225: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-08 15:24:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2022-04-08 15:24:29,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:24:29,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962393594] [2022-04-08 15:24:29,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962393594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:24:29,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:24:29,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:24:29,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:24:29,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [13952740] [2022-04-08 15:24:29,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [13952740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:24:29,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:24:29,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:24:29,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751861235] [2022-04-08 15:24:29,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:24:29,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 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 226 [2022-04-08 15:24:29,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:24:29,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:29,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:24:29,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:24:29,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:24:29,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:24:29,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:24:29,308 INFO L87 Difference]: Start difference. First operand 1697 states and 2430 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:31,326 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-08 15:24:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:24:33,194 INFO L93 Difference]: Finished difference Result 3821 states and 5470 transitions. [2022-04-08 15:24:33,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:24:33,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 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 226 [2022-04-08 15:24:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:24:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 15:24:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 15:24:33,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-08 15:24:33,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:24:33,635 INFO L225 Difference]: With dead ends: 3821 [2022-04-08 15:24:33,635 INFO L226 Difference]: Without dead ends: 2140 [2022-04-08 15:24:33,638 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-08 15:24:33,638 INFO L913 BasicCegarLoop]: 219 mSDtfsCounter, 73 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:24:33,638 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 528 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 493 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:24:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2022-04-08 15:24:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1691. [2022-04-08 15:24:33,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:24:33,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2140 states. Second operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:33,797 INFO L74 IsIncluded]: Start isIncluded. First operand 2140 states. Second operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:33,798 INFO L87 Difference]: Start difference. First operand 2140 states. Second operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:24:33,920 INFO L93 Difference]: Finished difference Result 2140 states and 3054 transitions. [2022-04-08 15:24:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3054 transitions. [2022-04-08 15:24:33,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:24:33,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:24:33,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 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 2140 states. [2022-04-08 15:24:33,923 INFO L87 Difference]: Start difference. First operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 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 2140 states. [2022-04-08 15:24:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:24:34,038 INFO L93 Difference]: Finished difference Result 2140 states and 3054 transitions. [2022-04-08 15:24:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3054 transitions. [2022-04-08 15:24:34,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:24:34,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:24:34,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:24:34,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:24:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2424 transitions. [2022-04-08 15:24:34,155 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2424 transitions. Word has length 226 [2022-04-08 15:24:34,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:24:34,155 INFO L478 AbstractCegarLoop]: Abstraction has 1691 states and 2424 transitions. [2022-04-08 15:24:34,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:34,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1691 states and 2424 transitions. [2022-04-08 15:24:36,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2424 edges. 2424 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:24:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2424 transitions. [2022-04-08 15:24:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-04-08 15:24:36,938 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:24:36,938 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:24:36,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-08 15:24:36,938 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:24:36,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:24:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1157522256, now seen corresponding path program 1 times [2022-04-08 15:24:36,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:24:36,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377998541] [2022-04-08 15:24:49,150 WARN L232 SmtUtils]: Spent 6.55s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:24:59,505 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:24:59,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1157522256, now seen corresponding path program 2 times [2022-04-08 15:24:59,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:24:59,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764290032] [2022-04-08 15:24:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:24:59,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:24:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:24:59,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:24:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:24:59,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {285911#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {285904#true} is VALID [2022-04-08 15:24:59,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {285904#true} assume true; {285904#true} is VALID [2022-04-08 15:24:59,694 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {285904#true} {285904#true} #593#return; {285904#true} is VALID [2022-04-08 15:24:59,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {285904#true} call ULTIMATE.init(); {285911#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:24:59,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {285911#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {285904#true} is VALID [2022-04-08 15:24:59,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {285904#true} assume true; {285904#true} is VALID [2022-04-08 15:24:59,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285904#true} {285904#true} #593#return; {285904#true} is VALID [2022-04-08 15:24:59,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {285904#true} call #t~ret158 := main(); {285904#true} is VALID [2022-04-08 15:24:59,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {285904#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; {285904#true} is VALID [2022-04-08 15:24:59,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {285904#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {285904#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; {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {285904#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; {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {285904#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {285904#true} assume 12292 == #t~mem49;havoc #t~mem49; {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {285904#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; {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {285904#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {285904#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {285904#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {285904#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {285904#true} assume !(0 == ~tmp___4~0); {285904#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {285904#true} assume 4368 == #t~mem54;havoc #t~mem54; {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {285904#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; {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {285904#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {285904#true} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {285904#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; {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {285904#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {285904#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 49: Hoare triple {285904#true} assume 4384 == #t~mem56;havoc #t~mem56; {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {285904#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {285904#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 52: Hoare triple {285904#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {285904#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {285904#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 57: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 59: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 60: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 61: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 62: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 63: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 64: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 65: Hoare triple {285904#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 66: Hoare triple {285904#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 67: Hoare triple {285904#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 68: Hoare triple {285904#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 69: Hoare triple {285904#true} assume 4400 == #t~mem58;havoc #t~mem58; {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 70: Hoare triple {285904#true} 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); {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 71: Hoare triple {285904#true} 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; {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 72: Hoare triple {285904#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 73: Hoare triple {285904#true} assume !(~ret~0 <= 0); {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 74: Hoare triple {285904#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 75: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 76: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 77: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 78: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 79: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 80: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 81: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 82: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 83: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 84: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 85: Hoare triple {285904#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 86: Hoare triple {285904#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 87: Hoare triple {285904#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 88: Hoare triple {285904#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 89: Hoare triple {285904#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 90: Hoare triple {285904#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 91: Hoare triple {285904#true} assume 4416 == #t~mem60;havoc #t~mem60; {285904#true} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 92: Hoare triple {285904#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 93: Hoare triple {285904#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 94: Hoare triple {285904#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 95: Hoare triple {285904#true} assume !(0 == ~tmp___6~0); {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 96: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 97: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 98: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 99: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 100: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 101: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 102: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 103: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 104: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 105: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 106: Hoare triple {285904#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 107: Hoare triple {285904#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 108: Hoare triple {285904#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 109: Hoare triple {285904#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 110: Hoare triple {285904#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 111: Hoare triple {285904#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 112: Hoare triple {285904#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 113: Hoare triple {285904#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 114: Hoare triple {285904#true} assume 4432 == #t~mem62;havoc #t~mem62; {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 115: Hoare triple {285904#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 116: Hoare triple {285904#true} assume !(5 == ~blastFlag~0); {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 117: Hoare triple {285904#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 118: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 119: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 120: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 121: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 122: Hoare triple {285904#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); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 123: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 124: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 125: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 126: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 127: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 128: Hoare triple {285904#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 129: Hoare triple {285904#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 130: Hoare triple {285904#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 131: Hoare triple {285904#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 132: Hoare triple {285904#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 133: Hoare triple {285904#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 134: Hoare triple {285904#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 135: Hoare triple {285904#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,705 INFO L290 TraceCheckUtils]: 136: Hoare triple {285904#true} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,705 INFO L290 TraceCheckUtils]: 137: Hoare triple {285904#true} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,705 INFO L290 TraceCheckUtils]: 138: Hoare triple {285904#true} assume 4448 == #t~mem64;havoc #t~mem64; {285904#true} is VALID [2022-04-08 15:24:59,705 INFO L290 TraceCheckUtils]: 139: Hoare triple {285904#true} assume -2147483648 <= #t~nondet100 && #t~nondet100 <= 2147483647;~ret~0 := #t~nondet100;havoc #t~nondet100; {285904#true} is VALID [2022-04-08 15:24:59,705 INFO L290 TraceCheckUtils]: 140: Hoare triple {285904#true} assume !(~ret~0 <= 0);call #t~mem101.base, #t~mem101.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem102 := read~int(#t~mem101.base, 912 + #t~mem101.offset, 4); {285904#true} is VALID [2022-04-08 15:24:59,706 INFO L290 TraceCheckUtils]: 141: Hoare triple {285904#true} assume !(0 != #t~mem102);havoc #t~mem101.base, #t~mem101.offset;havoc #t~mem102;call write~int(4480, ~s.base, 72 + ~s.offset, 4); {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:24:59,706 INFO L290 TraceCheckUtils]: 142: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:24:59,706 INFO L290 TraceCheckUtils]: 143: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} 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); {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:24:59,707 INFO L290 TraceCheckUtils]: 144: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:24:59,707 INFO L290 TraceCheckUtils]: 145: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} ~skip~0 := 0; {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:24:59,707 INFO L290 TraceCheckUtils]: 146: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !false; {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:24:59,707 INFO L290 TraceCheckUtils]: 147: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} 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); {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-08 15:24:59,708 INFO L290 TraceCheckUtils]: 148: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285910#(= |ssl3_connect_#t~mem50| 4480)} is VALID [2022-04-08 15:24:59,708 INFO L290 TraceCheckUtils]: 149: Hoare triple {285910#(= |ssl3_connect_#t~mem50| 4480)} assume 16384 == #t~mem50;havoc #t~mem50; {285905#false} is VALID [2022-04-08 15:24:59,708 INFO L290 TraceCheckUtils]: 150: Hoare triple {285905#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,708 INFO L290 TraceCheckUtils]: 151: Hoare triple {285905#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {285905#false} is VALID [2022-04-08 15:24:59,708 INFO L290 TraceCheckUtils]: 152: Hoare triple {285905#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,708 INFO L290 TraceCheckUtils]: 153: Hoare triple {285905#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 154: Hoare triple {285905#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 155: Hoare triple {285905#false} assume !(0 == ~tmp___4~0); {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 156: Hoare triple {285905#false} 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); {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 157: Hoare triple {285905#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); {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 158: Hoare triple {285905#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 159: Hoare triple {285905#false} ~skip~0 := 0; {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 160: Hoare triple {285905#false} assume !false; {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 161: Hoare triple {285905#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); {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 162: Hoare triple {285905#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 163: Hoare triple {285905#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 164: Hoare triple {285905#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 165: Hoare triple {285905#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 166: Hoare triple {285905#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 167: Hoare triple {285905#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 168: Hoare triple {285905#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 169: Hoare triple {285905#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 170: Hoare triple {285905#false} assume 4385 == #t~mem57;havoc #t~mem57; {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 171: Hoare triple {285905#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 172: Hoare triple {285905#false} assume !(1 == ~blastFlag~0); {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 173: Hoare triple {285905#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 174: Hoare triple {285905#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 175: Hoare triple {285905#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 176: Hoare triple {285905#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); {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 177: Hoare triple {285905#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 178: Hoare triple {285905#false} ~skip~0 := 0; {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 179: Hoare triple {285905#false} assume !false; {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 180: Hoare triple {285905#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); {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 181: Hoare triple {285905#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 182: Hoare triple {285905#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 183: Hoare triple {285905#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 184: Hoare triple {285905#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 185: Hoare triple {285905#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 186: Hoare triple {285905#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 187: Hoare triple {285905#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 188: Hoare triple {285905#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 189: Hoare triple {285905#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 190: Hoare triple {285905#false} assume 4400 == #t~mem58;havoc #t~mem58; {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 191: Hoare triple {285905#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); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 192: Hoare triple {285905#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; {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 193: Hoare triple {285905#false} assume !(2 == ~blastFlag~0); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 194: Hoare triple {285905#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 195: Hoare triple {285905#false} assume !(~ret~0 <= 0); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 196: Hoare triple {285905#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 197: Hoare triple {285905#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); {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 198: Hoare triple {285905#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 199: Hoare triple {285905#false} ~skip~0 := 0; {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 200: Hoare triple {285905#false} assume !false; {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 201: Hoare triple {285905#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); {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 202: Hoare triple {285905#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 203: Hoare triple {285905#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 204: Hoare triple {285905#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 205: Hoare triple {285905#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 206: Hoare triple {285905#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 207: Hoare triple {285905#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 208: Hoare triple {285905#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 209: Hoare triple {285905#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 210: Hoare triple {285905#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 211: Hoare triple {285905#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 212: Hoare triple {285905#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 213: Hoare triple {285905#false} assume 4416 == #t~mem60;havoc #t~mem60; {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 214: Hoare triple {285905#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 215: Hoare triple {285905#false} assume !(3 == ~blastFlag~0); {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 216: Hoare triple {285905#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); {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 217: Hoare triple {285905#false} assume !(0 == ~tmp___6~0); {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 218: Hoare triple {285905#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); {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 219: Hoare triple {285905#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 220: Hoare triple {285905#false} ~skip~0 := 0; {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 221: Hoare triple {285905#false} assume !false; {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 222: Hoare triple {285905#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); {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 223: Hoare triple {285905#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 224: Hoare triple {285905#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 225: Hoare triple {285905#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,713 INFO L290 TraceCheckUtils]: 226: Hoare triple {285905#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 227: Hoare triple {285905#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 228: Hoare triple {285905#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 229: Hoare triple {285905#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 230: Hoare triple {285905#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 231: Hoare triple {285905#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 232: Hoare triple {285905#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 233: Hoare triple {285905#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 234: Hoare triple {285905#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 235: Hoare triple {285905#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 236: Hoare triple {285905#false} assume 4432 == #t~mem62;havoc #t~mem62; {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 237: Hoare triple {285905#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 238: Hoare triple {285905#false} assume 5 == ~blastFlag~0; {285905#false} is VALID [2022-04-08 15:24:59,714 INFO L290 TraceCheckUtils]: 239: Hoare triple {285905#false} assume !false; {285905#false} is VALID [2022-04-08 15:24:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 15:24:59,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:24:59,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764290032] [2022-04-08 15:24:59,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764290032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:24:59,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:24:59,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:24:59,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:24:59,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377998541] [2022-04-08 15:24:59,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377998541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:24:59,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:24:59,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:24:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587148894] [2022-04-08 15:24:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:24:59,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 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 240 [2022-04-08 15:24:59,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:24:59,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:59,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:24:59,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:24:59,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:24:59,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:24:59,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:24:59,804 INFO L87 Difference]: Start difference. First operand 1691 states and 2424 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:01,822 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-08 15:25:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:03,745 INFO L93 Difference]: Finished difference Result 3815 states and 5458 transitions. [2022-04-08 15:25:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:25:03,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 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 240 [2022-04-08 15:25:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:25:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 15:25:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 15:25:03,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-08 15:25:04,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:04,206 INFO L225 Difference]: With dead ends: 3815 [2022-04-08 15:25:04,206 INFO L226 Difference]: Without dead ends: 2140 [2022-04-08 15:25:04,208 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-08 15:25:04,209 INFO L913 BasicCegarLoop]: 217 mSDtfsCounter, 79 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:25:04,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 524 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 489 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:25:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2022-04-08 15:25:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1769. [2022-04-08 15:25:04,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:25:04,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2140 states. Second operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:04,380 INFO L74 IsIncluded]: Start isIncluded. First operand 2140 states. Second operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:04,381 INFO L87 Difference]: Start difference. First operand 2140 states. Second operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:04,491 INFO L93 Difference]: Finished difference Result 2140 states and 3048 transitions. [2022-04-08 15:25:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3048 transitions. [2022-04-08 15:25:04,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:04,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:04,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 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 2140 states. [2022-04-08 15:25:04,494 INFO L87 Difference]: Start difference. First operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 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 2140 states. [2022-04-08 15:25:04,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:04,604 INFO L93 Difference]: Finished difference Result 2140 states and 3048 transitions. [2022-04-08 15:25:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3048 transitions. [2022-04-08 15:25:04,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:04,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:04,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:25:04,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:25:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2532 transitions. [2022-04-08 15:25:04,736 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2532 transitions. Word has length 240 [2022-04-08 15:25:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:25:04,736 INFO L478 AbstractCegarLoop]: Abstraction has 1769 states and 2532 transitions. [2022-04-08 15:25:04,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:04,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1769 states and 2532 transitions. [2022-04-08 15:25:07,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2532 edges. 2532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2532 transitions. [2022-04-08 15:25:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-04-08 15:25:07,657 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:25:07,657 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:25:07,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-08 15:25:07,658 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:25:07,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:25:07,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2106404142, now seen corresponding path program 1 times [2022-04-08 15:25:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:07,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [770405906] [2022-04-08 15:25:29,763 WARN L232 SmtUtils]: Spent 16.26s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:25:38,854 WARN L232 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:25:41,478 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:25:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2106404142, now seen corresponding path program 2 times [2022-04-08 15:25:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:25:41,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454516934] [2022-04-08 15:25:41,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:25:41,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:25:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:41,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:25:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:41,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {301371#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {301364#true} is VALID [2022-04-08 15:25:41,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {301364#true} assume true; {301364#true} is VALID [2022-04-08 15:25:41,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301364#true} {301364#true} #593#return; {301364#true} is VALID [2022-04-08 15:25:41,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {301364#true} call ULTIMATE.init(); {301371#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:25:41,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {301371#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {301364#true} is VALID [2022-04-08 15:25:41,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {301364#true} assume true; {301364#true} is VALID [2022-04-08 15:25:41,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301364#true} {301364#true} #593#return; {301364#true} is VALID [2022-04-08 15:25:41,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {301364#true} call #t~ret158 := main(); {301364#true} is VALID [2022-04-08 15:25:41,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {301364#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; {301364#true} is VALID [2022-04-08 15:25:41,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {301364#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {301364#true} is VALID [2022-04-08 15:25:41,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {301364#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; {301364#true} is VALID [2022-04-08 15:25:41,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {301364#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; {301364#true} is VALID [2022-04-08 15:25:41,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {301364#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {301364#true} is VALID [2022-04-08 15:25:41,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {301364#true} assume !false; {301364#true} is VALID [2022-04-08 15:25:41,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {301364#true} assume 12292 == #t~mem49;havoc #t~mem49; {301364#true} is VALID [2022-04-08 15:25:41,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {301364#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; {301364#true} is VALID [2022-04-08 15:25:41,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {301364#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {301364#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {301364#true} is VALID [2022-04-08 15:25:41,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {301364#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {301364#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {301364#true} is VALID [2022-04-08 15:25:41,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {301364#true} assume !(0 == ~tmp___4~0); {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {301364#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {301364#true} ~skip~0 := 0; {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {301364#true} assume !false; {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {301364#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {301364#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {301364#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {301364#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {301364#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {301364#true} assume 4368 == #t~mem54;havoc #t~mem54; {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {301364#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; {301364#true} is VALID [2022-04-08 15:25:41,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {301364#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 36: Hoare triple {301364#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; {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {301364#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {301364#true} ~skip~0 := 0; {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {301364#true} assume !false; {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {301364#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {301364#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {301364#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {301364#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {301364#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {301364#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {301364#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {301364#true} assume 4384 == #t~mem56;havoc #t~mem56; {301364#true} is VALID [2022-04-08 15:25:41,671 INFO L290 TraceCheckUtils]: 50: Hoare triple {301364#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {301364#true} is VALID [2022-04-08 15:25:41,671 INFO L290 TraceCheckUtils]: 51: Hoare triple {301364#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {301364#true} is VALID [2022-04-08 15:25:41,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {301364#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {301364#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,671 INFO L290 TraceCheckUtils]: 54: Hoare triple {301364#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,671 INFO L290 TraceCheckUtils]: 55: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,671 INFO L290 TraceCheckUtils]: 56: Hoare triple {301364#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {301364#true} is VALID [2022-04-08 15:25:41,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {301364#true} ~skip~0 := 0; {301364#true} is VALID [2022-04-08 15:25:41,672 INFO L290 TraceCheckUtils]: 58: Hoare triple {301364#true} assume !false; {301364#true} is VALID [2022-04-08 15:25:41,672 INFO L290 TraceCheckUtils]: 59: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,672 INFO L290 TraceCheckUtils]: 60: Hoare triple {301364#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,675 INFO L290 TraceCheckUtils]: 61: Hoare triple {301364#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,675 INFO L290 TraceCheckUtils]: 62: Hoare triple {301364#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,675 INFO L290 TraceCheckUtils]: 63: Hoare triple {301364#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,675 INFO L290 TraceCheckUtils]: 64: Hoare triple {301364#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {301364#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {301364#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,675 INFO L290 TraceCheckUtils]: 67: Hoare triple {301364#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {301364#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 69: Hoare triple {301364#true} assume 4400 == #t~mem58;havoc #t~mem58; {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 70: Hoare triple {301364#true} 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); {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 71: Hoare triple {301364#true} 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; {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 72: Hoare triple {301364#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 73: Hoare triple {301364#true} assume !(~ret~0 <= 0); {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 74: Hoare triple {301364#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 75: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 76: Hoare triple {301364#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 77: Hoare triple {301364#true} ~skip~0 := 0; {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 78: Hoare triple {301364#true} assume !false; {301364#true} is VALID [2022-04-08 15:25:41,676 INFO L290 TraceCheckUtils]: 79: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 80: Hoare triple {301364#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 81: Hoare triple {301364#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 82: Hoare triple {301364#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 83: Hoare triple {301364#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 84: Hoare triple {301364#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 85: Hoare triple {301364#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 86: Hoare triple {301364#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 87: Hoare triple {301364#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 88: Hoare triple {301364#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 89: Hoare triple {301364#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 90: Hoare triple {301364#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 91: Hoare triple {301364#true} assume 4416 == #t~mem60;havoc #t~mem60; {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 92: Hoare triple {301364#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 93: Hoare triple {301364#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {301364#true} is VALID [2022-04-08 15:25:41,677 INFO L290 TraceCheckUtils]: 94: Hoare triple {301364#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 95: Hoare triple {301364#true} assume !(0 == ~tmp___6~0); {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 96: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 97: Hoare triple {301364#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 98: Hoare triple {301364#true} ~skip~0 := 0; {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 99: Hoare triple {301364#true} assume !false; {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 100: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 101: Hoare triple {301364#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 102: Hoare triple {301364#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 103: Hoare triple {301364#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 104: Hoare triple {301364#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 105: Hoare triple {301364#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 106: Hoare triple {301364#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 107: Hoare triple {301364#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,678 INFO L290 TraceCheckUtils]: 108: Hoare triple {301364#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 109: Hoare triple {301364#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 110: Hoare triple {301364#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 111: Hoare triple {301364#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 112: Hoare triple {301364#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 113: Hoare triple {301364#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 114: Hoare triple {301364#true} assume 4432 == #t~mem62;havoc #t~mem62; {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 115: Hoare triple {301364#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 116: Hoare triple {301364#true} assume !(5 == ~blastFlag~0); {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 117: Hoare triple {301364#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 118: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 119: Hoare triple {301364#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 120: Hoare triple {301364#true} ~skip~0 := 0; {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 121: Hoare triple {301364#true} assume !false; {301364#true} is VALID [2022-04-08 15:25:41,679 INFO L290 TraceCheckUtils]: 122: Hoare triple {301364#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); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 123: Hoare triple {301364#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 124: Hoare triple {301364#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 125: Hoare triple {301364#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 126: Hoare triple {301364#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 127: Hoare triple {301364#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 128: Hoare triple {301364#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 129: Hoare triple {301364#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 130: Hoare triple {301364#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 131: Hoare triple {301364#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 132: Hoare triple {301364#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 133: Hoare triple {301364#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 134: Hoare triple {301364#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 135: Hoare triple {301364#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 136: Hoare triple {301364#true} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,680 INFO L290 TraceCheckUtils]: 137: Hoare triple {301364#true} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,681 INFO L290 TraceCheckUtils]: 138: Hoare triple {301364#true} assume 4448 == #t~mem64;havoc #t~mem64; {301364#true} is VALID [2022-04-08 15:25:41,681 INFO L290 TraceCheckUtils]: 139: Hoare triple {301364#true} assume -2147483648 <= #t~nondet100 && #t~nondet100 <= 2147483647;~ret~0 := #t~nondet100;havoc #t~nondet100; {301364#true} is VALID [2022-04-08 15:25:41,681 INFO L290 TraceCheckUtils]: 140: Hoare triple {301364#true} assume !(~ret~0 <= 0);call #t~mem101.base, #t~mem101.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem102 := read~int(#t~mem101.base, 912 + #t~mem101.offset, 4); {301364#true} is VALID [2022-04-08 15:25:41,682 INFO L290 TraceCheckUtils]: 141: Hoare triple {301364#true} assume 0 != #t~mem102;havoc #t~mem101.base, #t~mem101.offset;havoc #t~mem102;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {301369#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:25:41,683 INFO L290 TraceCheckUtils]: 142: Hoare triple {301369#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {301369#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:25:41,683 INFO L290 TraceCheckUtils]: 143: Hoare triple {301369#(= 4464 (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); {301369#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:25:41,683 INFO L290 TraceCheckUtils]: 144: Hoare triple {301369#(= 4464 (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; {301369#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:25:41,683 INFO L290 TraceCheckUtils]: 145: Hoare triple {301369#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {301369#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:25:41,684 INFO L290 TraceCheckUtils]: 146: Hoare triple {301369#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {301369#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:25:41,684 INFO L290 TraceCheckUtils]: 147: Hoare triple {301369#(= 4464 (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); {301369#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:25:41,684 INFO L290 TraceCheckUtils]: 148: Hoare triple {301369#(= 4464 (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); {301370#(= |ssl3_connect_#t~mem50| 4464)} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 149: Hoare triple {301370#(= |ssl3_connect_#t~mem50| 4464)} assume 16384 == #t~mem50;havoc #t~mem50; {301365#false} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 150: Hoare triple {301365#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 151: Hoare triple {301365#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {301365#false} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 152: Hoare triple {301365#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 153: Hoare triple {301365#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {301365#false} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 154: Hoare triple {301365#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {301365#false} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 155: Hoare triple {301365#false} assume !(0 == ~tmp___4~0); {301365#false} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 156: Hoare triple {301365#false} 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); {301365#false} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 157: Hoare triple {301365#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); {301365#false} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 158: Hoare triple {301365#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {301365#false} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 159: Hoare triple {301365#false} ~skip~0 := 0; {301365#false} is VALID [2022-04-08 15:25:41,685 INFO L290 TraceCheckUtils]: 160: Hoare triple {301365#false} assume !false; {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 161: Hoare triple {301365#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); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 162: Hoare triple {301365#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 163: Hoare triple {301365#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 164: Hoare triple {301365#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 165: Hoare triple {301365#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 166: Hoare triple {301365#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 167: Hoare triple {301365#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 168: Hoare triple {301365#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 169: Hoare triple {301365#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 170: Hoare triple {301365#false} assume 4385 == #t~mem57;havoc #t~mem57; {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 171: Hoare triple {301365#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 172: Hoare triple {301365#false} assume !(1 == ~blastFlag~0); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 173: Hoare triple {301365#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 174: Hoare triple {301365#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,686 INFO L290 TraceCheckUtils]: 175: Hoare triple {301365#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 176: Hoare triple {301365#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); {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 177: Hoare triple {301365#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 178: Hoare triple {301365#false} ~skip~0 := 0; {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 179: Hoare triple {301365#false} assume !false; {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 180: Hoare triple {301365#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); {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 181: Hoare triple {301365#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 182: Hoare triple {301365#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 183: Hoare triple {301365#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 184: Hoare triple {301365#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 185: Hoare triple {301365#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 186: Hoare triple {301365#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 187: Hoare triple {301365#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 188: Hoare triple {301365#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,687 INFO L290 TraceCheckUtils]: 189: Hoare triple {301365#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 190: Hoare triple {301365#false} assume 4400 == #t~mem58;havoc #t~mem58; {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 191: Hoare triple {301365#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); {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 192: Hoare triple {301365#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; {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 193: Hoare triple {301365#false} assume !(2 == ~blastFlag~0); {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 194: Hoare triple {301365#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 195: Hoare triple {301365#false} assume !(~ret~0 <= 0); {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 196: Hoare triple {301365#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 197: Hoare triple {301365#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); {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 198: Hoare triple {301365#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 199: Hoare triple {301365#false} ~skip~0 := 0; {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 200: Hoare triple {301365#false} assume !false; {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 201: Hoare triple {301365#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); {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 202: Hoare triple {301365#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 203: Hoare triple {301365#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,688 INFO L290 TraceCheckUtils]: 204: Hoare triple {301365#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 205: Hoare triple {301365#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 206: Hoare triple {301365#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 207: Hoare triple {301365#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 208: Hoare triple {301365#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 209: Hoare triple {301365#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 210: Hoare triple {301365#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 211: Hoare triple {301365#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 212: Hoare triple {301365#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 213: Hoare triple {301365#false} assume 4416 == #t~mem60;havoc #t~mem60; {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 214: Hoare triple {301365#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 215: Hoare triple {301365#false} assume !(3 == ~blastFlag~0); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 216: Hoare triple {301365#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); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 217: Hoare triple {301365#false} assume !(0 == ~tmp___6~0); {301365#false} is VALID [2022-04-08 15:25:41,689 INFO L290 TraceCheckUtils]: 218: Hoare triple {301365#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); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 219: Hoare triple {301365#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 220: Hoare triple {301365#false} ~skip~0 := 0; {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 221: Hoare triple {301365#false} assume !false; {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 222: Hoare triple {301365#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); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 223: Hoare triple {301365#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 224: Hoare triple {301365#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 225: Hoare triple {301365#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 226: Hoare triple {301365#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 227: Hoare triple {301365#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 228: Hoare triple {301365#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 229: Hoare triple {301365#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 230: Hoare triple {301365#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 231: Hoare triple {301365#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 232: Hoare triple {301365#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,690 INFO L290 TraceCheckUtils]: 233: Hoare triple {301365#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,691 INFO L290 TraceCheckUtils]: 234: Hoare triple {301365#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,691 INFO L290 TraceCheckUtils]: 235: Hoare triple {301365#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {301365#false} is VALID [2022-04-08 15:25:41,691 INFO L290 TraceCheckUtils]: 236: Hoare triple {301365#false} assume 4432 == #t~mem62;havoc #t~mem62; {301365#false} is VALID [2022-04-08 15:25:41,691 INFO L290 TraceCheckUtils]: 237: Hoare triple {301365#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {301365#false} is VALID [2022-04-08 15:25:41,691 INFO L290 TraceCheckUtils]: 238: Hoare triple {301365#false} assume 5 == ~blastFlag~0; {301365#false} is VALID [2022-04-08 15:25:41,691 INFO L290 TraceCheckUtils]: 239: Hoare triple {301365#false} assume !false; {301365#false} is VALID [2022-04-08 15:25:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 15:25:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:25:41,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454516934] [2022-04-08 15:25:41,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454516934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:41,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:41,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:41,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:25:41,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [770405906] [2022-04-08 15:25:41,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [770405906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:41,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:41,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:41,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085950367] [2022-04-08 15:25:41,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:25:41,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 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 240 [2022-04-08 15:25:41,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:25:41,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:41,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:41,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:25:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:41,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:25:41,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:25:41,771 INFO L87 Difference]: Start difference. First operand 1769 states and 2532 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:43,789 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-08 15:25:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:45,728 INFO L93 Difference]: Finished difference Result 3893 states and 5560 transitions. [2022-04-08 15:25:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:25:45,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 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 240 [2022-04-08 15:25:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:25:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 15:25:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 15:25:45,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-08 15:25:45,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:46,168 INFO L225 Difference]: With dead ends: 3893 [2022-04-08 15:25:46,168 INFO L226 Difference]: Without dead ends: 2140 [2022-04-08 15:25:46,170 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-08 15:25:46,171 INFO L913 BasicCegarLoop]: 218 mSDtfsCounter, 79 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:25:46,171 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 526 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 492 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:25:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2022-04-08 15:25:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1691. [2022-04-08 15:25:46,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:25:46,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2140 states. Second operand has 1691 states, 1686 states have (on average 1.431791221826809) internal successors, (2414), 1686 states have internal predecessors, (2414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:46,342 INFO L74 IsIncluded]: Start isIncluded. First operand 2140 states. Second operand has 1691 states, 1686 states have (on average 1.431791221826809) internal successors, (2414), 1686 states have internal predecessors, (2414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:46,343 INFO L87 Difference]: Start difference. First operand 2140 states. Second operand has 1691 states, 1686 states have (on average 1.431791221826809) internal successors, (2414), 1686 states have internal predecessors, (2414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:46,454 INFO L93 Difference]: Finished difference Result 2140 states and 3042 transitions. [2022-04-08 15:25:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3042 transitions. [2022-04-08 15:25:46,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:46,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:46,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 1691 states, 1686 states have (on average 1.431791221826809) internal successors, (2414), 1686 states have internal predecessors, (2414), 3 states have call successors, (3), 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 2140 states. [2022-04-08 15:25:46,458 INFO L87 Difference]: Start difference. First operand has 1691 states, 1686 states have (on average 1.431791221826809) internal successors, (2414), 1686 states have internal predecessors, (2414), 3 states have call successors, (3), 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 2140 states. [2022-04-08 15:25:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:46,570 INFO L93 Difference]: Finished difference Result 2140 states and 3042 transitions. [2022-04-08 15:25:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3042 transitions. [2022-04-08 15:25:46,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:46,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:46,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:25:46,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:25:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1686 states have (on average 1.431791221826809) internal successors, (2414), 1686 states have internal predecessors, (2414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2418 transitions. [2022-04-08 15:25:46,708 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2418 transitions. Word has length 240 [2022-04-08 15:25:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:25:46,709 INFO L478 AbstractCegarLoop]: Abstraction has 1691 states and 2418 transitions. [2022-04-08 15:25:46,709 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:46,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1691 states and 2418 transitions. [2022-04-08 15:25:49,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2418 edges. 2418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2418 transitions. [2022-04-08 15:25:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-04-08 15:25:49,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:25:49,502 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:25:49,502 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-08 15:25:49,502 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:25:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:25:49,502 INFO L85 PathProgramCache]: Analyzing trace with hash 372650669, now seen corresponding path program 1 times [2022-04-08 15:25:49,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:49,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [776346730] [2022-04-08 15:26:03,087 WARN L232 SmtUtils]: Spent 12.20s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:26:16,269 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:26:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash 372650669, now seen corresponding path program 2 times [2022-04-08 15:26:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:26:16,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989075781] [2022-04-08 15:26:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:26:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:26:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:26:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:16,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {316831#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {316824#true} is VALID [2022-04-08 15:26:16,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {316824#true} assume true; {316824#true} is VALID [2022-04-08 15:26:16,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {316824#true} {316824#true} #593#return; {316824#true} is VALID [2022-04-08 15:26:16,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {316824#true} call ULTIMATE.init(); {316831#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-08 15:26:16,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {316831#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {316824#true} is VALID [2022-04-08 15:26:16,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {316824#true} assume true; {316824#true} is VALID [2022-04-08 15:26:16,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316824#true} {316824#true} #593#return; {316824#true} is VALID [2022-04-08 15:26:16,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {316824#true} call #t~ret158 := main(); {316824#true} is VALID [2022-04-08 15:26:16,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {316824#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; {316824#true} is VALID [2022-04-08 15:26:16,446 INFO L272 TraceCheckUtils]: 6: Hoare triple {316824#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {316824#true} is VALID [2022-04-08 15:26:16,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {316824#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; {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {316824#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; {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {316824#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {316824#true} assume !false; {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {316824#true} assume 12292 == #t~mem49;havoc #t~mem49; {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {316824#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; {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {316824#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {316824#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {316824#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {316824#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {316824#true} assume !(0 == ~tmp___4~0); {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {316824#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {316824#true} ~skip~0 := 0; {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {316824#true} assume !false; {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {316824#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {316824#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {316824#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {316824#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {316824#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {316824#true} assume 4368 == #t~mem54;havoc #t~mem54; {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {316824#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; {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {316824#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {316824#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; {316824#true} is VALID [2022-04-08 15:26:16,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {316824#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {316824#true} ~skip~0 := 0; {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {316824#true} assume !false; {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {316824#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {316824#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {316824#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {316824#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {316824#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {316824#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {316824#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {316824#true} assume 4384 == #t~mem56;havoc #t~mem56; {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 50: Hoare triple {316824#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 51: Hoare triple {316824#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {316824#true} is VALID [2022-04-08 15:26:16,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {316824#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {316824#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {316824#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 55: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {316824#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {316824#true} ~skip~0 := 0; {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {316824#true} assume !false; {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {316824#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 61: Hoare triple {316824#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 62: Hoare triple {316824#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 63: Hoare triple {316824#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 64: Hoare triple {316824#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 65: Hoare triple {316824#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,450 INFO L290 TraceCheckUtils]: 66: Hoare triple {316824#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 67: Hoare triple {316824#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 68: Hoare triple {316824#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 69: Hoare triple {316824#true} assume 4400 == #t~mem58;havoc #t~mem58; {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 70: Hoare triple {316824#true} 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); {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 71: Hoare triple {316824#true} 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; {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 72: Hoare triple {316824#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 73: Hoare triple {316824#true} assume !(~ret~0 <= 0); {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 74: Hoare triple {316824#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 75: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 76: Hoare triple {316824#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 77: Hoare triple {316824#true} ~skip~0 := 0; {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 78: Hoare triple {316824#true} assume !false; {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 79: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 80: Hoare triple {316824#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,451 INFO L290 TraceCheckUtils]: 81: Hoare triple {316824#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 82: Hoare triple {316824#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 83: Hoare triple {316824#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {316824#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {316824#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 86: Hoare triple {316824#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 87: Hoare triple {316824#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 88: Hoare triple {316824#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 89: Hoare triple {316824#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 90: Hoare triple {316824#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 91: Hoare triple {316824#true} assume 4416 == #t~mem60;havoc #t~mem60; {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 92: Hoare triple {316824#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {316824#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 94: Hoare triple {316824#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 95: Hoare triple {316824#true} assume !(0 == ~tmp___6~0); {316824#true} is VALID [2022-04-08 15:26:16,452 INFO L290 TraceCheckUtils]: 96: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 97: Hoare triple {316824#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 98: Hoare triple {316824#true} ~skip~0 := 0; {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 99: Hoare triple {316824#true} assume !false; {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 100: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 101: Hoare triple {316824#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 102: Hoare triple {316824#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 103: Hoare triple {316824#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 104: Hoare triple {316824#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 105: Hoare triple {316824#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 106: Hoare triple {316824#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 107: Hoare triple {316824#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 108: Hoare triple {316824#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 109: Hoare triple {316824#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,453 INFO L290 TraceCheckUtils]: 110: Hoare triple {316824#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 111: Hoare triple {316824#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 112: Hoare triple {316824#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 113: Hoare triple {316824#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 114: Hoare triple {316824#true} assume 4432 == #t~mem62;havoc #t~mem62; {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 115: Hoare triple {316824#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 116: Hoare triple {316824#true} assume !(5 == ~blastFlag~0); {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 117: Hoare triple {316824#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 118: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 119: Hoare triple {316824#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 120: Hoare triple {316824#true} ~skip~0 := 0; {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 121: Hoare triple {316824#true} assume !false; {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 122: Hoare triple {316824#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); {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 123: Hoare triple {316824#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 124: Hoare triple {316824#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,454 INFO L290 TraceCheckUtils]: 125: Hoare triple {316824#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 126: Hoare triple {316824#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 127: Hoare triple {316824#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 128: Hoare triple {316824#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 129: Hoare triple {316824#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 130: Hoare triple {316824#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 131: Hoare triple {316824#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 132: Hoare triple {316824#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 133: Hoare triple {316824#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 134: Hoare triple {316824#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 135: Hoare triple {316824#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 136: Hoare triple {316824#true} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 137: Hoare triple {316824#true} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 138: Hoare triple {316824#true} assume 4448 == #t~mem64;havoc #t~mem64; {316824#true} is VALID [2022-04-08 15:26:16,455 INFO L290 TraceCheckUtils]: 139: Hoare triple {316824#true} assume -2147483648 <= #t~nondet100 && #t~nondet100 <= 2147483647;~ret~0 := #t~nondet100;havoc #t~nondet100; {316824#true} is VALID [2022-04-08 15:26:16,456 INFO L290 TraceCheckUtils]: 140: Hoare triple {316824#true} assume !(~ret~0 <= 0);call #t~mem101.base, #t~mem101.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem102 := read~int(#t~mem101.base, 912 + #t~mem101.offset, 4); {316824#true} is VALID [2022-04-08 15:26:16,456 INFO L290 TraceCheckUtils]: 141: Hoare triple {316824#true} assume !(0 != #t~mem102);havoc #t~mem101.base, #t~mem101.offset;havoc #t~mem102;call write~int(4480, ~s.base, 72 + ~s.offset, 4); {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-08 15:26:16,457 INFO L290 TraceCheckUtils]: 142: Hoare triple {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-08 15:26:16,457 INFO L290 TraceCheckUtils]: 143: Hoare triple {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} 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); {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-08 15:26:16,457 INFO L290 TraceCheckUtils]: 144: Hoare triple {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-08 15:26:16,458 INFO L290 TraceCheckUtils]: 145: Hoare triple {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} ~skip~0 := 0; {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-08 15:26:16,458 INFO L290 TraceCheckUtils]: 146: Hoare triple {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !false; {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-08 15:26:16,458 INFO L290 TraceCheckUtils]: 147: Hoare triple {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} 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); {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-08 15:26:16,458 INFO L290 TraceCheckUtils]: 148: Hoare triple {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-08 15:26:16,459 INFO L290 TraceCheckUtils]: 149: Hoare triple {316829#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {316830#(not (= |ssl3_connect_#t~mem51| 4096))} is VALID [2022-04-08 15:26:16,459 INFO L290 TraceCheckUtils]: 150: Hoare triple {316830#(not (= |ssl3_connect_#t~mem51| 4096))} assume 4096 == #t~mem51;havoc #t~mem51; {316825#false} is VALID [2022-04-08 15:26:16,459 INFO L290 TraceCheckUtils]: 151: Hoare triple {316825#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,459 INFO L290 TraceCheckUtils]: 152: Hoare triple {316825#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {316825#false} is VALID [2022-04-08 15:26:16,459 INFO L290 TraceCheckUtils]: 153: Hoare triple {316825#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,459 INFO L290 TraceCheckUtils]: 154: Hoare triple {316825#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {316825#false} is VALID [2022-04-08 15:26:16,459 INFO L290 TraceCheckUtils]: 155: Hoare triple {316825#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {316825#false} is VALID [2022-04-08 15:26:16,459 INFO L290 TraceCheckUtils]: 156: Hoare triple {316825#false} assume !(0 == ~tmp___4~0); {316825#false} is VALID [2022-04-08 15:26:16,459 INFO L290 TraceCheckUtils]: 157: Hoare triple {316825#false} 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); {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 158: Hoare triple {316825#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); {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 159: Hoare triple {316825#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 160: Hoare triple {316825#false} ~skip~0 := 0; {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 161: Hoare triple {316825#false} assume !false; {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 162: Hoare triple {316825#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); {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 163: Hoare triple {316825#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 164: Hoare triple {316825#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 165: Hoare triple {316825#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 166: Hoare triple {316825#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 167: Hoare triple {316825#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 168: Hoare triple {316825#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 169: Hoare triple {316825#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 170: Hoare triple {316825#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 171: Hoare triple {316825#false} assume 4385 == #t~mem57;havoc #t~mem57; {316825#false} is VALID [2022-04-08 15:26:16,460 INFO L290 TraceCheckUtils]: 172: Hoare triple {316825#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 173: Hoare triple {316825#false} assume !(1 == ~blastFlag~0); {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 174: Hoare triple {316825#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 175: Hoare triple {316825#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 176: Hoare triple {316825#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 177: Hoare triple {316825#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); {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 178: Hoare triple {316825#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 179: Hoare triple {316825#false} ~skip~0 := 0; {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 180: Hoare triple {316825#false} assume !false; {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 181: Hoare triple {316825#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); {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 182: Hoare triple {316825#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 183: Hoare triple {316825#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 184: Hoare triple {316825#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 185: Hoare triple {316825#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,461 INFO L290 TraceCheckUtils]: 186: Hoare triple {316825#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 187: Hoare triple {316825#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 188: Hoare triple {316825#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 189: Hoare triple {316825#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 190: Hoare triple {316825#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 191: Hoare triple {316825#false} assume 4400 == #t~mem58;havoc #t~mem58; {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 192: Hoare triple {316825#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); {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 193: Hoare triple {316825#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; {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 194: Hoare triple {316825#false} assume !(2 == ~blastFlag~0); {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 195: Hoare triple {316825#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 196: Hoare triple {316825#false} assume !(~ret~0 <= 0); {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 197: Hoare triple {316825#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 198: Hoare triple {316825#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); {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 199: Hoare triple {316825#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 200: Hoare triple {316825#false} ~skip~0 := 0; {316825#false} is VALID [2022-04-08 15:26:16,462 INFO L290 TraceCheckUtils]: 201: Hoare triple {316825#false} assume !false; {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 202: Hoare triple {316825#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); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 203: Hoare triple {316825#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 204: Hoare triple {316825#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 205: Hoare triple {316825#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 206: Hoare triple {316825#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 207: Hoare triple {316825#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 208: Hoare triple {316825#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 209: Hoare triple {316825#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 210: Hoare triple {316825#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 211: Hoare triple {316825#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 212: Hoare triple {316825#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 213: Hoare triple {316825#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 214: Hoare triple {316825#false} assume 4416 == #t~mem60;havoc #t~mem60; {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 215: Hoare triple {316825#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {316825#false} is VALID [2022-04-08 15:26:16,463 INFO L290 TraceCheckUtils]: 216: Hoare triple {316825#false} assume !(3 == ~blastFlag~0); {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 217: Hoare triple {316825#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); {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 218: Hoare triple {316825#false} assume !(0 == ~tmp___6~0); {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 219: Hoare triple {316825#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); {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 220: Hoare triple {316825#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 221: Hoare triple {316825#false} ~skip~0 := 0; {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 222: Hoare triple {316825#false} assume !false; {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 223: Hoare triple {316825#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); {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 224: Hoare triple {316825#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 225: Hoare triple {316825#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 226: Hoare triple {316825#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 227: Hoare triple {316825#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 228: Hoare triple {316825#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 229: Hoare triple {316825#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,464 INFO L290 TraceCheckUtils]: 230: Hoare triple {316825#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,465 INFO L290 TraceCheckUtils]: 231: Hoare triple {316825#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,465 INFO L290 TraceCheckUtils]: 232: Hoare triple {316825#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,465 INFO L290 TraceCheckUtils]: 233: Hoare triple {316825#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,465 INFO L290 TraceCheckUtils]: 234: Hoare triple {316825#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,465 INFO L290 TraceCheckUtils]: 235: Hoare triple {316825#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,465 INFO L290 TraceCheckUtils]: 236: Hoare triple {316825#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {316825#false} is VALID [2022-04-08 15:26:16,465 INFO L290 TraceCheckUtils]: 237: Hoare triple {316825#false} assume 4432 == #t~mem62;havoc #t~mem62; {316825#false} is VALID [2022-04-08 15:26:16,465 INFO L290 TraceCheckUtils]: 238: Hoare triple {316825#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {316825#false} is VALID [2022-04-08 15:26:16,465 INFO L290 TraceCheckUtils]: 239: Hoare triple {316825#false} assume 5 == ~blastFlag~0; {316825#false} is VALID [2022-04-08 15:26:16,465 INFO L290 TraceCheckUtils]: 240: Hoare triple {316825#false} assume !false; {316825#false} is VALID [2022-04-08 15:26:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 15:26:16,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:26:16,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989075781] [2022-04-08 15:26:16,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989075781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:16,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:16,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:16,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:26:16,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [776346730] [2022-04-08 15:26:16,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [776346730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:16,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:16,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4582190] [2022-04-08 15:26:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:26:16,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 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 241 [2022-04-08 15:26:16,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:26:16,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:16,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:16,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:26:16,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:16,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:26:16,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:26:16,571 INFO L87 Difference]: Start difference. First operand 1691 states and 2418 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:18,589 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-08 15:26:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:20,318 INFO L93 Difference]: Finished difference Result 3743 states and 5340 transitions. [2022-04-08 15:26:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:26:20,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 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 241 [2022-04-08 15:26:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:26:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-08 15:26:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-08 15:26:20,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-08 15:26:20,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:20,787 INFO L225 Difference]: With dead ends: 3743 [2022-04-08 15:26:20,787 INFO L226 Difference]: Without dead ends: 2068 [2022-04-08 15:26:20,789 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-08 15:26:20,789 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 115 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:26:20,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 302 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:26:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-04-08 15:26:20,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1691. [2022-04-08 15:26:20,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:26:20,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2068 states. Second operand has 1691 states, 1686 states have (on average 1.4116251482799524) internal successors, (2380), 1686 states have internal predecessors, (2380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:20,982 INFO L74 IsIncluded]: Start isIncluded. First operand 2068 states. Second operand has 1691 states, 1686 states have (on average 1.4116251482799524) internal successors, (2380), 1686 states have internal predecessors, (2380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:20,983 INFO L87 Difference]: Start difference. First operand 2068 states. Second operand has 1691 states, 1686 states have (on average 1.4116251482799524) internal successors, (2380), 1686 states have internal predecessors, (2380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:21,085 INFO L93 Difference]: Finished difference Result 2068 states and 2908 transitions. [2022-04-08 15:26:21,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2908 transitions. [2022-04-08 15:26:21,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:21,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:21,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 1691 states, 1686 states have (on average 1.4116251482799524) internal successors, (2380), 1686 states have internal predecessors, (2380), 3 states have call successors, (3), 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 2068 states. [2022-04-08 15:26:21,089 INFO L87 Difference]: Start difference. First operand has 1691 states, 1686 states have (on average 1.4116251482799524) internal successors, (2380), 1686 states have internal predecessors, (2380), 3 states have call successors, (3), 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 2068 states. [2022-04-08 15:26:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:21,193 INFO L93 Difference]: Finished difference Result 2068 states and 2908 transitions. [2022-04-08 15:26:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2908 transitions. [2022-04-08 15:26:21,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:21,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:21,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:26:21,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:26:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1686 states have (on average 1.4116251482799524) internal successors, (2380), 1686 states have internal predecessors, (2380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2384 transitions. [2022-04-08 15:26:21,322 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2384 transitions. Word has length 241 [2022-04-08 15:26:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:26:21,322 INFO L478 AbstractCegarLoop]: Abstraction has 1691 states and 2384 transitions. [2022-04-08 15:26:21,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:21,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1691 states and 2384 transitions. [2022-04-08 15:26:24,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2384 edges. 2384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2384 transitions. [2022-04-08 15:26:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-04-08 15:26:24,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:26:24,225 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:26:24,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-08 15:26:24,225 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:26:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:26:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1834770450, now seen corresponding path program 1 times [2022-04-08 15:26:24,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:24,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [143175873]