/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-e106359-m [2022-04-15 18:16:42,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:16:42,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:16:42,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:16:42,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:16:42,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:16:42,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:16:42,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:16:42,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:16:42,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:16:42,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:16:42,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:16:42,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:16:42,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:16:42,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:16:42,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:16:42,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:16:42,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:16:42,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:16:42,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:16:42,175 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:16:42,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:16:42,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:16:42,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:16:42,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:16:42,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:16:42,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:16:42,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:16:42,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:16:42,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:16:42,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:16:42,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:16:42,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:16:42,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:16:42,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:16:42,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:16:42,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:16:42,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:16:42,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:16:42,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:16:42,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:16:42,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:16:42,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 18:16:42,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:16:42,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:16:42,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:16:42,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:16:42,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:16:42,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:16:42,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:16:42,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:16:42,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:16:42,209 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:16:42,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:16:42,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:16:42,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:16:42,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:16:42,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:16:42,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:16:42,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:16:42,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:16:42,211 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:16:42,211 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:16:42,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:16:42,212 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:16:42,212 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 18:16:42,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:16:42,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:16:42,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:16:42,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:16:42,638 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:16:42,639 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-15 18:16:42,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88289f97/73f0e96649344fe4be809c6190152b88/FLAG89de40ab6 [2022-04-15 18:16:43,579 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:16:43,580 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c [2022-04-15 18:16:43,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88289f97/73f0e96649344fe4be809c6190152b88/FLAG89de40ab6 [2022-04-15 18:16:43,658 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88289f97/73f0e96649344fe4be809c6190152b88 [2022-04-15 18:16:43,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:16:43,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:16:43,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:16:43,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:16:43,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:16:43,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:16:43" (1/1) ... [2022-04-15 18:16:43,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791ea691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:43, skipping insertion in model container [2022-04-15 18:16:43,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:16:43" (1/1) ... [2022-04-15 18:16:43,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:16:43,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:16:44,411 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-15 18:16:44,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:16:44,449 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:16:44,599 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-15 18:16:44,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:16:44,626 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:16:44,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:44 WrapperNode [2022-04-15 18:16:44,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:16:44,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:16:44,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:16:44,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:16:44,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:44" (1/1) ... [2022-04-15 18:16:44,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:44" (1/1) ... [2022-04-15 18:16:44,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:44" (1/1) ... [2022-04-15 18:16:44,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:44" (1/1) ... [2022-04-15 18:16:44,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:44" (1/1) ... [2022-04-15 18:16:44,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:44" (1/1) ... [2022-04-15 18:16:44,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:44" (1/1) ... [2022-04-15 18:16:44,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:16:44,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:16:44,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:16:44,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:16:44,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:44" (1/1) ... [2022-04-15 18:16:44,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:16:44,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:16:44,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 18:16:44,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 18:16:44,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:16:44,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:16:44,863 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:16:44,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 18:16:44,864 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 18:16:44,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:16:44,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 18:16:44,864 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 18:16:44,864 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 18:16:44,865 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 18:16:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:16:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:16:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:16:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:16:44,866 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 18:16:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 18:16:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:16:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 18:16:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 18:16:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 18:16:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 18:16:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 18:16:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 18:16:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 18:16:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 18:16:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 18:16:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:16:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 18:16:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:16:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 18:16:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:16:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 18:16:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 18:16:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:16:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:16:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:16:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 18:16:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 18:16:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 18:16:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 18:16:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:16:45,123 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:16:45,125 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:16:47,703 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:16:48,322 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 18:16:48,322 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 18:16:48,344 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:16:48,353 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:16:48,353 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 18:16:48,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:16:48 BoogieIcfgContainer [2022-04-15 18:16:48,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:16:48,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:16:48,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:16:48,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:16:48,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:16:43" (1/3) ... [2022-04-15 18:16:48,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304aafb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:16:48, skipping insertion in model container [2022-04-15 18:16:48,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:44" (2/3) ... [2022-04-15 18:16:48,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304aafb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:16:48, skipping insertion in model container [2022-04-15 18:16:48,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:16:48" (3/3) ... [2022-04-15 18:16:48,378 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-2.c [2022-04-15 18:16:48,384 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:16:48,384 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:16:48,431 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:16:48,449 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 18:16:48,449 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:16:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 18:16:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 18:16:48,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:48,494 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:48,494 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-15 18:16:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:48,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1749517125] [2022-04-15 18:16:48,531 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:16:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-15 18:16:48,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:48,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441830809] [2022-04-15 18:16:48,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:49,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 18:16:49,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 18:16:49,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 18:16:49,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:49,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 18:16:49,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 18:16:49,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 18:16:49,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-15 18:16:49,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-15 18:16:49,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-15 18:16:49,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:16:49,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:16:49,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:16:49,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:16:49,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:16:49,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-15 18:16:49,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:16:49,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-15 18:16:49,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-15 18:16:49,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-15 18:16:49,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-15 18:16:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:16:49,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:49,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441830809] [2022-04-15 18:16:49,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441830809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:49,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:49,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:49,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:49,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1749517125] [2022-04-15 18:16:49,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1749517125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:49,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:49,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488881621] [2022-04-15 18:16:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:49,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:16:49,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:49,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:49,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:49,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:16:49,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:49,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:16:49,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:16:49,535 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:53,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:55,515 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:57,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:59,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:01,526 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-15 18:17:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:17:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:17:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 18:17:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 18:17:01,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 18:17:02,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:02,228 INFO L225 Difference]: With dead ends: 267 [2022-04-15 18:17:02,228 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 18:17:02,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:17:02,270 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s 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, 8.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:02,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 3 Unknown, 0 Unchecked, 8.5s Time] [2022-04-15 18:17:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 18:17:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 18:17:02,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:02,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,354 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,355 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:02,365 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 18:17:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 18:17:02,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:02,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:02,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 18:17:02,374 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 18:17:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:02,401 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 18:17:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 18:17:02,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:02,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:02,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:02,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-15 18:17:02,418 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-15 18:17:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:02,418 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-15 18:17:02,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-15 18:17:02,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-15 18:17:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 18:17:02,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:02,632 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:17:02,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:17:02,633 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:02,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-15 18:17:02,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:02,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1713961110] [2022-04-15 18:17:02,634 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:02,634 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-15 18:17:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:02,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42138344] [2022-04-15 18:17:02,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:02,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:03,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:03,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 18:17:03,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 18:17:03,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 18:17:03,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:17:03,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 18:17:03,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 18:17:03,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 18:17:03,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-15 18:17:03,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1173#true} is VALID [2022-04-15 18:17:03,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {1173#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1173#true} is VALID [2022-04-15 18:17:03,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 56 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:17:03,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-15 18:17:03,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-15 18:17:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:17:03,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:03,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42138344] [2022-04-15 18:17:03,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42138344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:03,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:03,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:17:03,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:03,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1713961110] [2022-04-15 18:17:03,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1713961110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:03,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:03,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:17:03,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279470021] [2022-04-15 18:17:03,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:03,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 18:17:03,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:03,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:03,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:03,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:17:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:03,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:17:03,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:17:03,201 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:05,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:06,507 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-15 18:17:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:17:06,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 18:17:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 18:17:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 18:17:06,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 18:17:07,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:07,039 INFO L225 Difference]: With dead ends: 327 [2022-04-15 18:17:07,039 INFO L226 Difference]: Without dead ends: 222 [2022-04-15 18:17:07,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:17:07,041 INFO L913 BasicCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:07,041 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.4s Time] [2022-04-15 18:17:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-15 18:17:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-15 18:17:07,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:07,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:07,087 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:07,087 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:07,144 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 18:17:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 18:17:07,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:07,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:07,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 18:17:07,146 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 18:17:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:07,156 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 18:17:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 18:17:07,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:07,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:07,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:07,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-15 18:17:07,177 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-15 18:17:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:07,178 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-15 18:17:07,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:07,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-15 18:17:07,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 18:17:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 18:17:07,508 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:07,508 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:17:07,508 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:17:07,508 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:07,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-15 18:17:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:07,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617573939] [2022-04-15 18:17:07,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:07,510 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-15 18:17:07,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:07,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503080872] [2022-04-15 18:17:07,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:07,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:07,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2724#true} is VALID [2022-04-15 18:17:07,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 18:17:07,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 18:17:07,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:17:07,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2724#true} is VALID [2022-04-15 18:17:07,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 18:17:07,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 18:17:07,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-15 18:17:07,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2724#true} is VALID [2022-04-15 18:17:07,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {2724#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2724#true} is VALID [2022-04-15 18:17:07,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {2724#true} is VALID [2022-04-15 18:17:07,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {2724#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {2724#true} is VALID [2022-04-15 18:17:07,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {2724#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {2724#true} is VALID [2022-04-15 18:17:07,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {2724#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2724#true} is VALID [2022-04-15 18:17:07,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 18:17:07,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:17:07,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-15 18:17:07,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {2724#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {2724#true} is VALID [2022-04-15 18:17:07,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:17:07,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {2724#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2724#true} is VALID [2022-04-15 18:17:07,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:17:07,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {2724#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {2724#true} is VALID [2022-04-15 18:17:07,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {2724#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {2724#true} is VALID [2022-04-15 18:17:07,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-15 18:17:07,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {2724#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:17:07,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {2724#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {2724#true} is VALID [2022-04-15 18:17:07,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {2724#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2724#true} is VALID [2022-04-15 18:17:07,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-15 18:17:07,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 18:17:07,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:17:07,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {2724#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:17:07,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {2724#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:17:07,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {2724#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:17:07,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {2724#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:17:07,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {2724#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:17:07,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-15 18:17:07,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {2724#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {2724#true} is VALID [2022-04-15 18:17:07,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-15 18:17:07,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {2724#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,939 INFO L290 TraceCheckUtils]: 53: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:07,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2730#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-15 18:17:07,948 INFO L290 TraceCheckUtils]: 55: Hoare triple {2730#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-15 18:17:07,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {2725#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {2725#false} is VALID [2022-04-15 18:17:07,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 5 == ~blastFlag~0; {2725#false} is VALID [2022-04-15 18:17:07,949 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 18:17:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:17:07,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:07,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503080872] [2022-04-15 18:17:07,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503080872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:07,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:07,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:07,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:07,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617573939] [2022-04-15 18:17:07,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617573939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:07,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:07,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095848420] [2022-04-15 18:17:07,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:07,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 18:17:07,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:07,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:08,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:08,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:17:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:08,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:17:08,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:17:08,050 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:10,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:11,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:11,721 INFO L93 Difference]: Finished difference Result 611 states and 908 transitions. [2022-04-15 18:17:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:17:11,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 18:17:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:17:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:17:11,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 18:17:12,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:12,184 INFO L225 Difference]: With dead ends: 611 [2022-04-15 18:17:12,184 INFO L226 Difference]: Without dead ends: 405 [2022-04-15 18:17:12,189 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:17:12,193 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:12,203 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.7s Time] [2022-04-15 18:17:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-15 18:17:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 270. [2022-04-15 18:17:12,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:12,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:12,244 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:12,245 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:12,273 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-15 18:17:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-15 18:17:12,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:12,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:12,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-15 18:17:12,276 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-15 18:17:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:12,304 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-15 18:17:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-15 18:17:12,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:12,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:12,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:12,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 410 transitions. [2022-04-15 18:17:12,316 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 410 transitions. Word has length 59 [2022-04-15 18:17:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:12,316 INFO L478 AbstractCegarLoop]: Abstraction has 270 states and 410 transitions. [2022-04-15 18:17:12,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:12,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 270 states and 410 transitions. [2022-04-15 18:17:12,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 410 transitions. [2022-04-15 18:17:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 18:17:12,717 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:12,717 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:17:12,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:17:12,717 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:12,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:12,718 INFO L85 PathProgramCache]: Analyzing trace with hash -949350737, now seen corresponding path program 1 times [2022-04-15 18:17:12,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:12,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [336100407] [2022-04-15 18:17:12,718 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:12,718 INFO L85 PathProgramCache]: Analyzing trace with hash -949350737, now seen corresponding path program 2 times [2022-04-15 18:17:12,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:12,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333631979] [2022-04-15 18:17:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:12,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:13,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:13,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {5315#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {5308#true} is VALID [2022-04-15 18:17:13,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {5308#true} assume true; {5308#true} is VALID [2022-04-15 18:17:13,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5308#true} {5308#true} #593#return; {5308#true} is VALID [2022-04-15 18:17:13,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {5308#true} call ULTIMATE.init(); {5315#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:17:13,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {5315#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {5308#true} is VALID [2022-04-15 18:17:13,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {5308#true} assume true; {5308#true} is VALID [2022-04-15 18:17:13,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5308#true} {5308#true} #593#return; {5308#true} is VALID [2022-04-15 18:17:13,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {5308#true} call #t~ret158 := main(); {5308#true} is VALID [2022-04-15 18:17:13,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {5308#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {5308#true} is VALID [2022-04-15 18:17:13,194 INFO L272 TraceCheckUtils]: 6: Hoare triple {5308#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {5308#true} is VALID [2022-04-15 18:17:13,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {5308#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {5308#true} is VALID [2022-04-15 18:17:13,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {5308#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {5308#true} is VALID [2022-04-15 18:17:13,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {5308#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {5308#true} is VALID [2022-04-15 18:17:13,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {5308#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5308#true} is VALID [2022-04-15 18:17:13,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {5308#true} assume !false; {5308#true} is VALID [2022-04-15 18:17:13,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {5308#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:17:13,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {5308#true} assume 12292 == #t~mem49;havoc #t~mem49; {5308#true} is VALID [2022-04-15 18:17:13,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {5308#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {5308#true} is VALID [2022-04-15 18:17:13,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {5308#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:17:13,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {5308#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {5308#true} is VALID [2022-04-15 18:17:13,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {5308#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:17:13,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {5308#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {5308#true} is VALID [2022-04-15 18:17:13,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {5308#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {5308#true} is VALID [2022-04-15 18:17:13,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {5308#true} assume !(0 == ~tmp___4~0); {5308#true} is VALID [2022-04-15 18:17:13,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {5308#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:17:13,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {5308#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {5308#true} is VALID [2022-04-15 18:17:13,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {5308#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {5308#true} is VALID [2022-04-15 18:17:13,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {5308#true} ~skip~0 := 0; {5308#true} is VALID [2022-04-15 18:17:13,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {5308#true} assume !false; {5308#true} is VALID [2022-04-15 18:17:13,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {5308#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:17:13,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {5308#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:17:13,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {5308#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:17:13,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {5308#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:17:13,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {5308#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:17:13,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {5308#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:17:13,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {5308#true} assume 4368 == #t~mem54;havoc #t~mem54; {5308#true} is VALID [2022-04-15 18:17:13,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {5308#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {5308#true} is VALID [2022-04-15 18:17:13,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {5308#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5308#true} is VALID [2022-04-15 18:17:13,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {5308#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} ~skip~0 := 0; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !false; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,207 INFO L290 TraceCheckUtils]: 50: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,208 INFO L290 TraceCheckUtils]: 53: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:17:13,209 INFO L290 TraceCheckUtils]: 55: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5314#(not (= |ssl3_connect_#t~mem63| 4433))} is VALID [2022-04-15 18:17:13,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {5314#(not (= |ssl3_connect_#t~mem63| 4433))} assume 4433 == #t~mem63;havoc #t~mem63; {5309#false} is VALID [2022-04-15 18:17:13,213 INFO L290 TraceCheckUtils]: 57: Hoare triple {5309#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {5309#false} is VALID [2022-04-15 18:17:13,213 INFO L290 TraceCheckUtils]: 58: Hoare triple {5309#false} assume 5 == ~blastFlag~0; {5309#false} is VALID [2022-04-15 18:17:13,213 INFO L290 TraceCheckUtils]: 59: Hoare triple {5309#false} assume !false; {5309#false} is VALID [2022-04-15 18:17:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:17:13,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:13,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333631979] [2022-04-15 18:17:13,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333631979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:13,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:13,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:13,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:13,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [336100407] [2022-04-15 18:17:13,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [336100407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:13,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:13,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302549055] [2022-04-15 18:17:13,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:13,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 18:17:13,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:13,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:13,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:13,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:17:13,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:13,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:17:13,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:17:13,301 INFO L87 Difference]: Start difference. First operand 270 states and 410 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:15,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:16,665 INFO L93 Difference]: Finished difference Result 707 states and 1076 transitions. [2022-04-15 18:17:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:17:16,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 18:17:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:16,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:17:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:17:16,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 18:17:17,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:17,155 INFO L225 Difference]: With dead ends: 707 [2022-04-15 18:17:17,155 INFO L226 Difference]: Without dead ends: 453 [2022-04-15 18:17:17,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:17:17,158 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:17,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 18:17:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-15 18:17:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 320. [2022-04-15 18:17:17,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:17,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,196 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,197 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:17,212 INFO L93 Difference]: Finished difference Result 453 states and 684 transitions. [2022-04-15 18:17:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 684 transitions. [2022-04-15 18:17:17,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:17,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:17,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 453 states. [2022-04-15 18:17:17,215 INFO L87 Difference]: Start difference. First operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 453 states. [2022-04-15 18:17:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:17,229 INFO L93 Difference]: Finished difference Result 453 states and 684 transitions. [2022-04-15 18:17:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 684 transitions. [2022-04-15 18:17:17,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:17,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:17,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:17,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 498 transitions. [2022-04-15 18:17:17,240 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 498 transitions. Word has length 60 [2022-04-15 18:17:17,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:17,240 INFO L478 AbstractCegarLoop]: Abstraction has 320 states and 498 transitions. [2022-04-15 18:17:17,241 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 320 states and 498 transitions. [2022-04-15 18:17:17,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 498 transitions. [2022-04-15 18:17:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 18:17:17,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:17,699 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:17:17,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 18:17:17,699 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:17,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:17,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1308079053, now seen corresponding path program 1 times [2022-04-15 18:17:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:17,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [680326566] [2022-04-15 18:17:17,701 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:17,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1308079053, now seen corresponding path program 2 times [2022-04-15 18:17:17,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:17,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159639950] [2022-04-15 18:17:17,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:17,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:18,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:18,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {8286#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {8280#true} is VALID [2022-04-15 18:17:18,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {8280#true} assume true; {8280#true} is VALID [2022-04-15 18:17:18,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8280#true} {8280#true} #593#return; {8280#true} is VALID [2022-04-15 18:17:18,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {8280#true} call ULTIMATE.init(); {8286#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:17:18,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {8286#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {8280#true} is VALID [2022-04-15 18:17:18,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {8280#true} assume true; {8280#true} is VALID [2022-04-15 18:17:18,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8280#true} {8280#true} #593#return; {8280#true} is VALID [2022-04-15 18:17:18,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {8280#true} call #t~ret158 := main(); {8280#true} is VALID [2022-04-15 18:17:18,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {8280#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {8280#true} is VALID [2022-04-15 18:17:18,147 INFO L272 TraceCheckUtils]: 6: Hoare triple {8280#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {8280#true} is VALID [2022-04-15 18:17:18,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {8280#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {8280#true} is VALID [2022-04-15 18:17:18,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {8280#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {8280#true} is VALID [2022-04-15 18:17:18,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {8280#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {8280#true} is VALID [2022-04-15 18:17:18,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {8280#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8280#true} is VALID [2022-04-15 18:17:18,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {8280#true} assume !false; {8280#true} is VALID [2022-04-15 18:17:18,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {8280#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:17:18,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {8280#true} assume 12292 == #t~mem49;havoc #t~mem49; {8280#true} is VALID [2022-04-15 18:17:18,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {8280#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {8280#true} is VALID [2022-04-15 18:17:18,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {8280#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:17:18,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {8280#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8280#true} is VALID [2022-04-15 18:17:18,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {8280#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:17:18,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {8280#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {8280#true} is VALID [2022-04-15 18:17:18,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {8280#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {8280#true} is VALID [2022-04-15 18:17:18,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {8280#true} assume !(0 == ~tmp___4~0); {8280#true} is VALID [2022-04-15 18:17:18,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {8280#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:17:18,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {8280#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8280#true} is VALID [2022-04-15 18:17:18,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {8280#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8280#true} is VALID [2022-04-15 18:17:18,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {8280#true} ~skip~0 := 0; {8280#true} is VALID [2022-04-15 18:17:18,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {8280#true} assume !false; {8280#true} is VALID [2022-04-15 18:17:18,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {8280#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:17:18,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {8280#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:17:18,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {8280#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:17:18,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {8280#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:17:18,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {8280#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:17:18,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {8280#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:17:18,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {8280#true} assume 4368 == #t~mem54;havoc #t~mem54; {8280#true} is VALID [2022-04-15 18:17:18,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {8280#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {8280#true} is VALID [2022-04-15 18:17:18,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {8280#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !false; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,170 INFO L290 TraceCheckUtils]: 51: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume 4416 == #t~mem60;havoc #t~mem60; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,171 INFO L290 TraceCheckUtils]: 54: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:17:18,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {8281#false} is VALID [2022-04-15 18:17:18,171 INFO L290 TraceCheckUtils]: 56: Hoare triple {8281#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {8281#false} assume !(0 == ~tmp___6~0); {8281#false} is VALID [2022-04-15 18:17:18,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {8281#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,172 INFO L290 TraceCheckUtils]: 59: Hoare triple {8281#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8281#false} is VALID [2022-04-15 18:17:18,172 INFO L290 TraceCheckUtils]: 60: Hoare triple {8281#false} ~skip~0 := 0; {8281#false} is VALID [2022-04-15 18:17:18,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {8281#false} assume !false; {8281#false} is VALID [2022-04-15 18:17:18,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {8281#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,172 INFO L290 TraceCheckUtils]: 63: Hoare triple {8281#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,172 INFO L290 TraceCheckUtils]: 64: Hoare triple {8281#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,172 INFO L290 TraceCheckUtils]: 65: Hoare triple {8281#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,172 INFO L290 TraceCheckUtils]: 66: Hoare triple {8281#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,172 INFO L290 TraceCheckUtils]: 67: Hoare triple {8281#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,173 INFO L290 TraceCheckUtils]: 68: Hoare triple {8281#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,173 INFO L290 TraceCheckUtils]: 69: Hoare triple {8281#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,187 INFO L290 TraceCheckUtils]: 70: Hoare triple {8281#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,187 INFO L290 TraceCheckUtils]: 71: Hoare triple {8281#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,189 INFO L290 TraceCheckUtils]: 72: Hoare triple {8281#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,189 INFO L290 TraceCheckUtils]: 73: Hoare triple {8281#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,189 INFO L290 TraceCheckUtils]: 74: Hoare triple {8281#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,189 INFO L290 TraceCheckUtils]: 75: Hoare triple {8281#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:17:18,189 INFO L290 TraceCheckUtils]: 76: Hoare triple {8281#false} assume 4432 == #t~mem62;havoc #t~mem62; {8281#false} is VALID [2022-04-15 18:17:18,190 INFO L290 TraceCheckUtils]: 77: Hoare triple {8281#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {8281#false} is VALID [2022-04-15 18:17:18,190 INFO L290 TraceCheckUtils]: 78: Hoare triple {8281#false} assume 5 == ~blastFlag~0; {8281#false} is VALID [2022-04-15 18:17:18,190 INFO L290 TraceCheckUtils]: 79: Hoare triple {8281#false} assume !false; {8281#false} is VALID [2022-04-15 18:17:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:17:18,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:18,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159639950] [2022-04-15 18:17:18,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159639950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:18,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:18,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:17:18,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:18,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [680326566] [2022-04-15 18:17:18,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [680326566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:18,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:18,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:17:18,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699747004] [2022-04-15 18:17:18,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:18,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 18:17:18,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:18,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:18,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:18,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:17:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:18,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:17:18,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:17:18,278 INFO L87 Difference]: Start difference. First operand 320 states and 498 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:20,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:21,572 INFO L93 Difference]: Finished difference Result 623 states and 981 transitions. [2022-04-15 18:17:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:17:21,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 18:17:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-15 18:17:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-15 18:17:21,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 486 transitions. [2022-04-15 18:17:22,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:22,031 INFO L225 Difference]: With dead ends: 623 [2022-04-15 18:17:22,032 INFO L226 Difference]: Without dead ends: 469 [2022-04-15 18:17:22,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:17:22,033 INFO L913 BasicCegarLoop]: 308 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:22,034 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.4s Time] [2022-04-15 18:17:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-15 18:17:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2022-04-15 18:17:22,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:22,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 469 states. Second operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:22,056 INFO L74 IsIncluded]: Start isIncluded. First operand 469 states. Second operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:22,057 INFO L87 Difference]: Start difference. First operand 469 states. Second operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:22,070 INFO L93 Difference]: Finished difference Result 469 states and 731 transitions. [2022-04-15 18:17:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-15 18:17:22,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:22,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:22,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-15 18:17:22,074 INFO L87 Difference]: Start difference. First operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-15 18:17:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:22,088 INFO L93 Difference]: Finished difference Result 469 states and 731 transitions. [2022-04-15 18:17:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-15 18:17:22,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:22,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:22,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:22,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 731 transitions. [2022-04-15 18:17:22,107 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 731 transitions. Word has length 80 [2022-04-15 18:17:22,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:22,107 INFO L478 AbstractCegarLoop]: Abstraction has 469 states and 731 transitions. [2022-04-15 18:17:22,107 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:22,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 469 states and 731 transitions. [2022-04-15 18:17:23,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 731 edges. 731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-15 18:17:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 18:17:23,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:23,108 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:17:23,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 18:17:23,108 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:23,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1829686905, now seen corresponding path program 1 times [2022-04-15 18:17:23,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:23,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [160846268] [2022-04-15 18:17:23,109 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:23,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1829686905, now seen corresponding path program 2 times [2022-04-15 18:17:23,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:23,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460722185] [2022-04-15 18:17:23,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:23,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:23,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:23,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {11417#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11411#true} is VALID [2022-04-15 18:17:23,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {11411#true} assume true; {11411#true} is VALID [2022-04-15 18:17:23,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11411#true} {11411#true} #593#return; {11411#true} is VALID [2022-04-15 18:17:23,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {11411#true} call ULTIMATE.init(); {11417#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:17:23,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {11417#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11411#true} is VALID [2022-04-15 18:17:23,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {11411#true} assume true; {11411#true} is VALID [2022-04-15 18:17:23,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11411#true} {11411#true} #593#return; {11411#true} is VALID [2022-04-15 18:17:23,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {11411#true} call #t~ret158 := main(); {11411#true} is VALID [2022-04-15 18:17:23,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {11411#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11411#true} is VALID [2022-04-15 18:17:23,428 INFO L272 TraceCheckUtils]: 6: Hoare triple {11411#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11411#true} is VALID [2022-04-15 18:17:23,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {11411#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {11411#true} is VALID [2022-04-15 18:17:23,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {11411#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {11411#true} is VALID [2022-04-15 18:17:23,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {11411#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {11411#true} is VALID [2022-04-15 18:17:23,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {11411#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11411#true} is VALID [2022-04-15 18:17:23,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-15 18:17:23,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {11411#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {11411#true} assume 12292 == #t~mem49;havoc #t~mem49; {11411#true} is VALID [2022-04-15 18:17:23,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {11411#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {11411#true} is VALID [2022-04-15 18:17:23,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {11411#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {11411#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11411#true} is VALID [2022-04-15 18:17:23,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {11411#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {11411#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {11411#true} is VALID [2022-04-15 18:17:23,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {11411#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {11411#true} is VALID [2022-04-15 18:17:23,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {11411#true} assume !(0 == ~tmp___4~0); {11411#true} is VALID [2022-04-15 18:17:23,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {11411#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {11411#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {11411#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11411#true} is VALID [2022-04-15 18:17:23,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {11411#true} ~skip~0 := 0; {11411#true} is VALID [2022-04-15 18:17:23,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-15 18:17:23,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {11411#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {11411#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {11411#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {11411#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {11411#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {11411#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {11411#true} assume 4368 == #t~mem54;havoc #t~mem54; {11411#true} is VALID [2022-04-15 18:17:23,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {11411#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11411#true} is VALID [2022-04-15 18:17:23,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {11411#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11411#true} is VALID [2022-04-15 18:17:23,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {11411#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {11411#true} is VALID [2022-04-15 18:17:23,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {11411#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {11411#true} is VALID [2022-04-15 18:17:23,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {11411#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {11411#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11411#true} is VALID [2022-04-15 18:17:23,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {11411#true} ~skip~0 := 0; {11411#true} is VALID [2022-04-15 18:17:23,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-15 18:17:23,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {11411#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {11411#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {11411#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {11411#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {11411#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,438 INFO L290 TraceCheckUtils]: 46: Hoare triple {11411#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {11411#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,478 INFO L290 TraceCheckUtils]: 48: Hoare triple {11411#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-15 18:17:23,478 INFO L290 TraceCheckUtils]: 49: Hoare triple {11411#true} assume 4384 == #t~mem56;havoc #t~mem56; {11411#true} is VALID [2022-04-15 18:17:23,478 INFO L290 TraceCheckUtils]: 50: Hoare triple {11411#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11411#true} is VALID [2022-04-15 18:17:23,479 INFO L290 TraceCheckUtils]: 51: Hoare triple {11411#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,481 INFO L290 TraceCheckUtils]: 53: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,482 INFO L290 TraceCheckUtils]: 55: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,482 INFO L290 TraceCheckUtils]: 56: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,485 INFO L290 TraceCheckUtils]: 62: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,485 INFO L290 TraceCheckUtils]: 63: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,485 INFO L290 TraceCheckUtils]: 64: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,486 INFO L290 TraceCheckUtils]: 67: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,487 INFO L290 TraceCheckUtils]: 69: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,488 INFO L290 TraceCheckUtils]: 70: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,488 INFO L290 TraceCheckUtils]: 71: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem60;havoc #t~mem60; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,488 INFO L290 TraceCheckUtils]: 72: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:23,489 INFO L290 TraceCheckUtils]: 73: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {11412#false} is VALID [2022-04-15 18:17:23,489 INFO L290 TraceCheckUtils]: 74: Hoare triple {11412#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,490 INFO L290 TraceCheckUtils]: 75: Hoare triple {11412#false} assume !(0 == ~tmp___6~0); {11412#false} is VALID [2022-04-15 18:17:23,490 INFO L290 TraceCheckUtils]: 76: Hoare triple {11412#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,491 INFO L290 TraceCheckUtils]: 77: Hoare triple {11412#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11412#false} is VALID [2022-04-15 18:17:23,491 INFO L290 TraceCheckUtils]: 78: Hoare triple {11412#false} ~skip~0 := 0; {11412#false} is VALID [2022-04-15 18:17:23,491 INFO L290 TraceCheckUtils]: 79: Hoare triple {11412#false} assume !false; {11412#false} is VALID [2022-04-15 18:17:23,491 INFO L290 TraceCheckUtils]: 80: Hoare triple {11412#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,492 INFO L290 TraceCheckUtils]: 81: Hoare triple {11412#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,492 INFO L290 TraceCheckUtils]: 82: Hoare triple {11412#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,492 INFO L290 TraceCheckUtils]: 83: Hoare triple {11412#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,492 INFO L290 TraceCheckUtils]: 84: Hoare triple {11412#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,492 INFO L290 TraceCheckUtils]: 85: Hoare triple {11412#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,492 INFO L290 TraceCheckUtils]: 86: Hoare triple {11412#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,492 INFO L290 TraceCheckUtils]: 87: Hoare triple {11412#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,492 INFO L290 TraceCheckUtils]: 88: Hoare triple {11412#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,492 INFO L290 TraceCheckUtils]: 89: Hoare triple {11412#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,493 INFO L290 TraceCheckUtils]: 90: Hoare triple {11412#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,493 INFO L290 TraceCheckUtils]: 91: Hoare triple {11412#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,493 INFO L290 TraceCheckUtils]: 92: Hoare triple {11412#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,493 INFO L290 TraceCheckUtils]: 93: Hoare triple {11412#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-15 18:17:23,493 INFO L290 TraceCheckUtils]: 94: Hoare triple {11412#false} assume 4432 == #t~mem62;havoc #t~mem62; {11412#false} is VALID [2022-04-15 18:17:23,493 INFO L290 TraceCheckUtils]: 95: Hoare triple {11412#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11412#false} is VALID [2022-04-15 18:17:23,493 INFO L290 TraceCheckUtils]: 96: Hoare triple {11412#false} assume 5 == ~blastFlag~0; {11412#false} is VALID [2022-04-15 18:17:23,493 INFO L290 TraceCheckUtils]: 97: Hoare triple {11412#false} assume !false; {11412#false} is VALID [2022-04-15 18:17:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 18:17:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:23,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460722185] [2022-04-15 18:17:23,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460722185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:23,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:23,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:17:23,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:23,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [160846268] [2022-04-15 18:17:23,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [160846268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:23,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:23,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:17:23,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455013584] [2022-04-15 18:17:23,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:23,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 18:17:23,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:23,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:23,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:23,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:17:23,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:23,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:17:23,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:17:23,579 INFO L87 Difference]: Start difference. First operand 469 states and 731 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:25,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:27,007 INFO L93 Difference]: Finished difference Result 922 states and 1448 transitions. [2022-04-15 18:17:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:17:27,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 18:17:27,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 18:17:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 18:17:27,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 18:17:27,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:27,602 INFO L225 Difference]: With dead ends: 922 [2022-04-15 18:17:27,602 INFO L226 Difference]: Without dead ends: 619 [2022-04-15 18:17:27,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:17:27,608 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 127 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:27,608 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.4s Time] [2022-04-15 18:17:27,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-15 18:17:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2022-04-15 18:17:27,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:27,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:27,637 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:27,639 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:27,660 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-15 18:17:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-15 18:17:27,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:27,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:27,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-15 18:17:27,665 INFO L87 Difference]: Start difference. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-15 18:17:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:27,687 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-15 18:17:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-15 18:17:27,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:27,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:27,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:27,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 966 transitions. [2022-04-15 18:17:27,738 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 966 transitions. Word has length 98 [2022-04-15 18:17:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:27,738 INFO L478 AbstractCegarLoop]: Abstraction has 619 states and 966 transitions. [2022-04-15 18:17:27,738 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:27,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 619 states and 966 transitions. [2022-04-15 18:17:28,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 966 edges. 966 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:28,738 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-15 18:17:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 18:17:28,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:28,740 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:17:28,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 18:17:28,740 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:28,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 1 times [2022-04-15 18:17:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:28,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519718983] [2022-04-15 18:17:28,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 2 times [2022-04-15 18:17:28,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:28,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5109594] [2022-04-15 18:17:28,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:28,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:29,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:29,217 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-15 18:17:29,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {15740#true} assume true; {15740#true} is VALID [2022-04-15 18:17:29,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15740#true} {15740#true} #593#return; {15740#true} is VALID [2022-04-15 18:17:29,259 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-15 18:17:29,259 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-15 18:17:29,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {15740#true} assume true; {15740#true} is VALID [2022-04-15 18:17:29,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15740#true} {15740#true} #593#return; {15740#true} is VALID [2022-04-15 18:17:29,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {15740#true} call #t~ret158 := main(); {15740#true} is VALID [2022-04-15 18:17:29,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {15740#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15740#true} is VALID [2022-04-15 18:17:29,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {15740#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15740#true} is VALID [2022-04-15 18:17:29,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {15740#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {15740#true} is VALID [2022-04-15 18:17:29,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {15740#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {15740#true} is VALID [2022-04-15 18:17:29,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {15740#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {15740#true} is VALID [2022-04-15 18:17:29,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {15740#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15740#true} is VALID [2022-04-15 18:17:29,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-15 18:17:29,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {15740#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {15740#true} assume 12292 == #t~mem49;havoc #t~mem49; {15740#true} is VALID [2022-04-15 18:17:29,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {15740#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {15740#true} is VALID [2022-04-15 18:17:29,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {15740#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {15740#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {15740#true} is VALID [2022-04-15 18:17:29,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {15740#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {15740#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {15740#true} is VALID [2022-04-15 18:17:29,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {15740#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {15740#true} is VALID [2022-04-15 18:17:29,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {15740#true} assume !(0 == ~tmp___4~0); {15740#true} is VALID [2022-04-15 18:17:29,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {15740#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {15740#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {15740#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15740#true} is VALID [2022-04-15 18:17:29,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-15 18:17:29,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-15 18:17:29,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {15740#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {15740#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {15740#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {15740#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {15740#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {15740#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {15740#true} assume 4368 == #t~mem54;havoc #t~mem54; {15740#true} is VALID [2022-04-15 18:17:29,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {15740#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {15740#true} is VALID [2022-04-15 18:17:29,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {15740#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15740#true} is VALID [2022-04-15 18:17:29,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {15740#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {15740#true} is VALID [2022-04-15 18:17:29,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {15740#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {15740#true} is VALID [2022-04-15 18:17:29,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {15740#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {15740#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15740#true} is VALID [2022-04-15 18:17:29,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-15 18:17:29,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-15 18:17:29,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {15740#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {15740#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {15740#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {15740#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {15740#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {15740#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {15740#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {15740#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {15740#true} assume 4384 == #t~mem56;havoc #t~mem56; {15740#true} is VALID [2022-04-15 18:17:29,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {15740#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15740#true} is VALID [2022-04-15 18:17:29,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {15740#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15740#true} is VALID [2022-04-15 18:17:29,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {15740#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,266 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-15 18:17:29,266 INFO L290 TraceCheckUtils]: 54: Hoare triple {15740#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {15740#true} is VALID [2022-04-15 18:17:29,266 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-15 18:17:29,266 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-15 18:17:29,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-15 18:17:29,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-15 18:17:29,267 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-15 18:17:29,267 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-15 18:17:29,267 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-15 18:17:29,267 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-15 18:17:29,267 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-15 18:17:29,267 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-15 18:17:29,267 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-15 18:17:29,267 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-15 18:17:29,267 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-15 18:17:29,268 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-15 18:17:29,268 INFO L290 TraceCheckUtils]: 69: Hoare triple {15740#true} assume 4400 == #t~mem58;havoc #t~mem58; {15740#true} is VALID [2022-04-15 18:17:29,268 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-15 18:17:29,268 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-15 18:17:29,268 INFO L290 TraceCheckUtils]: 72: Hoare triple {15740#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {15740#true} is VALID [2022-04-15 18:17:29,268 INFO L290 TraceCheckUtils]: 73: Hoare triple {15740#true} assume !(~ret~0 <= 0); {15740#true} is VALID [2022-04-15 18:17:29,268 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-15 18:17:29,268 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-15 18:17:29,269 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-15 18:17:29,269 INFO L290 TraceCheckUtils]: 77: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-15 18:17:29,269 INFO L290 TraceCheckUtils]: 78: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-15 18:17:29,269 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-15 18:17:29,269 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-15 18:17:29,269 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-15 18:17:29,269 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-15 18:17:29,269 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-15 18:17:29,269 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-15 18:17:29,271 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-15 18:17:29,271 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-15 18:17:29,271 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-15 18:17:29,271 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-15 18:17:29,271 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-15 18:17:29,271 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-15 18:17:29,271 INFO L290 TraceCheckUtils]: 91: Hoare triple {15740#true} assume 4416 == #t~mem60;havoc #t~mem60; {15740#true} is VALID [2022-04-15 18:17:29,271 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-15 18:17:29,272 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-15 18:17:29,272 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-15 18:17:29,272 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-15 18:17:29,273 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-15 18:17:29,273 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-15 18:17:29,273 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-15 18:17:29,274 INFO L290 TraceCheckUtils]: 99: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !false; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:17:29,274 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-15 18:17:29,274 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-15 18:17:29,275 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-15 18:17:29,275 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-15 18:17:29,275 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-15 18:17:29,276 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-15 18:17:29,276 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-15 18:17:29,276 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-15 18:17:29,276 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-15 18:17:29,277 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-15 18:17:29,277 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-15 18:17:29,277 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-15 18:17:29,278 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-15 18:17:29,278 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-15 18:17:29,278 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-15 18:17:29,279 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-15 18:17:29,279 INFO L290 TraceCheckUtils]: 116: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {15741#false} is VALID [2022-04-15 18:17:29,279 INFO L290 TraceCheckUtils]: 117: Hoare triple {15741#false} assume !false; {15741#false} is VALID [2022-04-15 18:17:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-15 18:17:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:29,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5109594] [2022-04-15 18:17:29,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5109594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:29,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:29,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:17:29,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:29,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519718983] [2022-04-15 18:17:29,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519718983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:29,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:29,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:17:29,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076445723] [2022-04-15 18:17:29,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:29,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 18:17:29,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:29,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:29,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:29,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:17:29,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:29,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:17:29,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:17:29,359 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-15 18:17:31,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:32,721 INFO L93 Difference]: Finished difference Result 1223 states and 1920 transitions. [2022-04-15 18:17:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:17:32,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 18:17:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 18:17:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 18:17:32,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-15 18:17:33,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:33,337 INFO L225 Difference]: With dead ends: 1223 [2022-04-15 18:17:33,338 INFO L226 Difference]: Without dead ends: 770 [2022-04-15 18:17:33,339 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:17:33,339 INFO L913 BasicCegarLoop]: 316 mSDtfsCounter, 127 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:33,339 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.4s Time] [2022-04-15 18:17:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-04-15 18:17:33,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-04-15 18:17:33,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:33,384 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-15 18:17:33,385 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-15 18:17:33,387 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-15 18:17:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:33,416 INFO L93 Difference]: Finished difference Result 770 states and 1202 transitions. [2022-04-15 18:17:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1202 transitions. [2022-04-15 18:17:33,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:33,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:33,420 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-15 18:17:33,423 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-15 18:17:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:33,455 INFO L93 Difference]: Finished difference Result 770 states and 1202 transitions. [2022-04-15 18:17:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1202 transitions. [2022-04-15 18:17:33,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:33,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:33,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:33,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:33,459 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-15 18:17:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1202 transitions. [2022-04-15 18:17:33,505 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1202 transitions. Word has length 118 [2022-04-15 18:17:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:33,506 INFO L478 AbstractCegarLoop]: Abstraction has 770 states and 1202 transitions. [2022-04-15 18:17:33,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:33,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 770 states and 1202 transitions. [2022-04-15 18:17:34,500 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-15 18:17:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1202 transitions. [2022-04-15 18:17:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 18:17:34,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:34,503 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:17:34,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 18:17:34,503 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1249203673, now seen corresponding path program 1 times [2022-04-15 18:17:34,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:34,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1365544735] [2022-04-15 18:17:34,505 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1249203673, now seen corresponding path program 2 times [2022-04-15 18:17:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:34,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533111587] [2022-04-15 18:17:34,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:34,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:34,721 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-15 18:17:34,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {21275#true} assume true; {21275#true} is VALID [2022-04-15 18:17:34,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21275#true} {21275#true} #593#return; {21275#true} is VALID [2022-04-15 18:17:34,723 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-15 18:17:34,723 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-15 18:17:34,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {21275#true} assume true; {21275#true} is VALID [2022-04-15 18:17:34,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21275#true} {21275#true} #593#return; {21275#true} is VALID [2022-04-15 18:17:34,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {21275#true} call #t~ret158 := main(); {21275#true} is VALID [2022-04-15 18:17:34,723 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-15 18:17:34,723 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-15 18:17:34,724 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-15 18:17:34,724 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-15 18:17:34,724 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-15 18:17:34,724 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-15 18:17:34,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-15 18:17:34,724 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-15 18:17:34,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {21275#true} assume 12292 == #t~mem49;havoc #t~mem49; {21275#true} is VALID [2022-04-15 18:17:34,724 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-15 18:17:34,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {21275#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {21275#true} is VALID [2022-04-15 18:17:34,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {21275#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21275#true} is VALID [2022-04-15 18:17:34,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {21275#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21275#true} is VALID [2022-04-15 18:17:34,725 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-15 18:17:34,725 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-15 18:17:34,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {21275#true} assume !(0 == ~tmp___4~0); {21275#true} is VALID [2022-04-15 18:17:34,725 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-15 18:17:34,725 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-15 18:17:34,725 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-15 18:17:34,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {21275#true} ~skip~0 := 0; {21275#true} is VALID [2022-04-15 18:17:34,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-15 18:17:34,725 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-15 18:17:34,726 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-15 18:17:34,726 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-15 18:17:34,726 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-15 18:17:34,726 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-15 18:17:34,726 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-15 18:17:34,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {21275#true} assume 4368 == #t~mem54;havoc #t~mem54; {21275#true} is VALID [2022-04-15 18:17:34,726 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-15 18:17:34,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {21275#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21275#true} is VALID [2022-04-15 18:17:34,726 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-15 18:17:34,726 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-15 18:17:34,727 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-15 18:17:34,727 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-15 18:17:34,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {21275#true} ~skip~0 := 0; {21275#true} is VALID [2022-04-15 18:17:34,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-15 18:17:34,727 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-15 18:17:34,727 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-15 18:17:34,727 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-15 18:17:34,727 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-15 18:17:34,727 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-15 18:17:34,728 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-15 18:17:34,728 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-15 18:17:34,728 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-15 18:17:34,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {21275#true} assume 4384 == #t~mem56;havoc #t~mem56; {21275#true} is VALID [2022-04-15 18:17:34,728 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-15 18:17:34,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {21275#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21275#true} is VALID [2022-04-15 18:17:34,728 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-15 18:17:34,728 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-15 18:17:34,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {21275#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {21275#true} is VALID [2022-04-15 18:17:34,728 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-15 18:17:34,729 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-15 18:17:34,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {21275#true} ~skip~0 := 0; {21275#true} is VALID [2022-04-15 18:17:34,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-15 18:17:34,729 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-15 18:17:34,729 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-15 18:17:34,729 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-15 18:17:34,729 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-15 18:17:34,729 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-15 18:17:34,729 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-15 18:17:34,729 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-15 18:17:34,730 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-15 18:17:34,730 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-15 18:17:34,730 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-15 18:17:34,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {21275#true} assume 4400 == #t~mem58;havoc #t~mem58; {21275#true} is VALID [2022-04-15 18:17:34,730 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-15 18:17:34,730 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-15 18:17:34,731 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-15 18:17:34,731 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-15 18:17:34,731 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-15 18:17:34,731 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-15 18:17:34,732 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-15 18:17:34,732 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-15 18:17:34,732 INFO L290 TraceCheckUtils]: 78: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:17:34,733 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-15 18:17:34,733 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-15 18:17:34,733 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-15 18:17:34,734 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-15 18:17:34,734 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-15 18:17:34,734 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-15 18:17:34,735 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-15 18:17:34,735 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-15 18:17:34,735 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-15 18:17:34,735 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-15 18:17:34,736 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-15 18:17:34,736 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-15 18:17:34,736 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-15 18:17:34,737 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-15 18:17:34,737 INFO L290 TraceCheckUtils]: 93: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(3 == ~blastFlag~0); {21276#false} is VALID [2022-04-15 18:17:34,737 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-15 18:17:34,737 INFO L290 TraceCheckUtils]: 95: Hoare triple {21276#false} assume !(0 == ~tmp___6~0); {21276#false} is VALID [2022-04-15 18:17:34,737 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-15 18:17:34,737 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-15 18:17:34,738 INFO L290 TraceCheckUtils]: 98: Hoare triple {21276#false} ~skip~0 := 0; {21276#false} is VALID [2022-04-15 18:17:34,738 INFO L290 TraceCheckUtils]: 99: Hoare triple {21276#false} assume !false; {21276#false} is VALID [2022-04-15 18:17:34,738 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-15 18:17:34,738 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-15 18:17:34,738 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-15 18:17:34,738 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-15 18:17:34,738 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-15 18:17:34,738 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-15 18:17:34,738 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-15 18:17:34,738 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-15 18:17:34,739 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-15 18:17:34,739 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-15 18:17:34,739 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-15 18:17:34,739 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-15 18:17:34,739 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-15 18:17:34,739 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-15 18:17:34,739 INFO L290 TraceCheckUtils]: 114: Hoare triple {21276#false} assume 4432 == #t~mem62;havoc #t~mem62; {21276#false} is VALID [2022-04-15 18:17:34,739 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-15 18:17:34,739 INFO L290 TraceCheckUtils]: 116: Hoare triple {21276#false} assume 5 == ~blastFlag~0; {21276#false} is VALID [2022-04-15 18:17:34,739 INFO L290 TraceCheckUtils]: 117: Hoare triple {21276#false} assume !false; {21276#false} is VALID [2022-04-15 18:17:34,741 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-15 18:17:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:34,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533111587] [2022-04-15 18:17:34,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533111587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:34,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:34,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:17:34,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:34,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1365544735] [2022-04-15 18:17:34,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1365544735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:34,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:34,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:17:34,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847492874] [2022-04-15 18:17:34,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:34,742 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-15 18:17:34,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:34,743 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-15 18:17:35,043 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-15 18:17:35,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:17:35,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:35,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:17:35,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:17:35,045 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-15 18:17:37,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:38,443 INFO L93 Difference]: Finished difference Result 1500 states and 2348 transitions. [2022-04-15 18:17:38,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:17:38,444 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-15 18:17:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:38,444 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-15 18:17:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 18:17:38,448 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-15 18:17:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 18:17:38,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-15 18:17:38,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:38,933 INFO L225 Difference]: With dead ends: 1500 [2022-04-15 18:17:38,934 INFO L226 Difference]: Without dead ends: 896 [2022-04-15 18:17:38,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:17:38,936 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 128 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:38,936 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.4s Time] [2022-04-15 18:17:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-04-15 18:17:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2022-04-15 18:17:38,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:38,968 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-15 18:17:38,970 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-15 18:17:38,972 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-15 18:17:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:39,011 INFO L93 Difference]: Finished difference Result 896 states and 1394 transitions. [2022-04-15 18:17:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1394 transitions. [2022-04-15 18:17:39,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:39,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:39,016 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-15 18:17:39,033 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-15 18:17:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:39,074 INFO L93 Difference]: Finished difference Result 896 states and 1394 transitions. [2022-04-15 18:17:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1394 transitions. [2022-04-15 18:17:39,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:39,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:39,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:39,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:39,078 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-15 18:17:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1394 transitions. [2022-04-15 18:17:39,134 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1394 transitions. Word has length 118 [2022-04-15 18:17:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:39,135 INFO L478 AbstractCegarLoop]: Abstraction has 896 states and 1394 transitions. [2022-04-15 18:17:39,135 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-15 18:17:39,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 896 states and 1394 transitions. [2022-04-15 18:17:40,225 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-15 18:17:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1394 transitions. [2022-04-15 18:17:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-15 18:17:40,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:40,230 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-15 18:17:40,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 18:17:40,230 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:40,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:40,231 INFO L85 PathProgramCache]: Analyzing trace with hash -154258084, now seen corresponding path program 1 times [2022-04-15 18:17:40,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:40,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [606007108] [2022-04-15 18:17:58,378 WARN L232 SmtUtils]: Spent 13.35s 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-15 18:18:08,543 WARN L232 SmtUtils]: Spent 5.69s 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-15 18:18:10,634 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:18:10,634 INFO L85 PathProgramCache]: Analyzing trace with hash -154258084, now seen corresponding path program 2 times [2022-04-15 18:18:10,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:18:10,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856311278] [2022-04-15 18:18:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:18:10,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:18:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:10,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:18:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:10,864 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-15 18:18:10,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {27868#true} assume true; {27868#true} is VALID [2022-04-15 18:18:10,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27868#true} {27868#true} #593#return; {27868#true} is VALID [2022-04-15 18:18:10,866 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-15 18:18:10,866 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-15 18:18:10,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {27868#true} assume true; {27868#true} is VALID [2022-04-15 18:18:10,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27868#true} {27868#true} #593#return; {27868#true} is VALID [2022-04-15 18:18:10,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {27868#true} call #t~ret158 := main(); {27868#true} is VALID [2022-04-15 18:18:10,866 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-15 18:18:10,866 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-15 18:18:10,867 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-15 18:18:10,867 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-15 18:18:10,867 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-15 18:18:10,867 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-15 18:18:10,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {27868#true} assume !false; {27868#true} is VALID [2022-04-15 18:18:10,867 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-15 18:18:10,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {27868#true} assume 12292 == #t~mem49;havoc #t~mem49; {27868#true} is VALID [2022-04-15 18:18:10,867 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-15 18:18:10,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {27868#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {27868#true} is VALID [2022-04-15 18:18:10,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {27868#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {27868#true} is VALID [2022-04-15 18:18:10,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {27868#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {27868#true} is VALID [2022-04-15 18:18:10,868 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-15 18:18:10,868 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-15 18:18:10,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {27868#true} assume !(0 == ~tmp___4~0); {27868#true} is VALID [2022-04-15 18:18:10,868 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-15 18:18:10,868 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-15 18:18:10,868 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-15 18:18:10,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {27868#true} ~skip~0 := 0; {27868#true} is VALID [2022-04-15 18:18:10,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {27868#true} assume !false; {27868#true} is VALID [2022-04-15 18:18:10,868 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-15 18:18:10,869 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-15 18:18:10,869 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-15 18:18:10,869 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-15 18:18:10,869 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-15 18:18:10,869 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-15 18:18:10,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {27868#true} assume 4368 == #t~mem54;havoc #t~mem54; {27868#true} is VALID [2022-04-15 18:18:10,869 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-15 18:18:10,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {27868#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27868#true} is VALID [2022-04-15 18:18:10,869 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-15 18:18:10,869 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-15 18:18:10,870 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-15 18:18:10,870 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-15 18:18:10,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {27868#true} ~skip~0 := 0; {27868#true} is VALID [2022-04-15 18:18:10,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {27868#true} assume !false; {27868#true} is VALID [2022-04-15 18:18:10,870 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-15 18:18:10,870 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-15 18:18:10,870 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-15 18:18:10,870 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-15 18:18:10,870 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-15 18:18:10,870 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-15 18:18:10,871 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-15 18:18:10,871 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-15 18:18:10,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {27868#true} assume 4384 == #t~mem56;havoc #t~mem56; {27868#true} is VALID [2022-04-15 18:18:10,871 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-15 18:18:10,871 INFO L290 TraceCheckUtils]: 51: Hoare triple {27868#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {27868#true} is VALID [2022-04-15 18:18:10,871 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-15 18:18:10,872 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-15 18:18:10,873 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-15 18:18:10,873 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-15 18:18:10,874 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-15 18:18:10,874 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-15 18:18:10,875 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-15 18:18:10,875 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-15 18:18:10,875 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-15 18:18:10,876 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-15 18:18:10,876 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-15 18:18:10,877 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-15 18:18:10,877 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-15 18:18:10,878 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-15 18:18:10,878 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-15 18:18:10,878 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-15 18:18:10,879 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-15 18:18:10,879 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-15 18:18:10,879 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-15 18:18:10,879 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-15 18:18:10,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {27869#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {27869#false} is VALID [2022-04-15 18:18:10,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {27869#false} assume !(~ret~0 <= 0); {27869#false} is VALID [2022-04-15 18:18:10,880 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-15 18:18:10,880 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-15 18:18:10,880 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-15 18:18:10,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-15 18:18:10,880 INFO L290 TraceCheckUtils]: 78: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-15 18:18:10,880 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-15 18:18:10,881 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-15 18:18:10,881 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-15 18:18:10,881 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-15 18:18:10,881 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-15 18:18:10,881 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-15 18:18:10,881 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-15 18:18:10,881 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-15 18:18:10,881 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-15 18:18:10,881 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-15 18:18:10,882 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-15 18:18:10,882 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-15 18:18:10,882 INFO L290 TraceCheckUtils]: 91: Hoare triple {27869#false} assume 4416 == #t~mem60;havoc #t~mem60; {27869#false} is VALID [2022-04-15 18:18:10,882 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-15 18:18:10,882 INFO L290 TraceCheckUtils]: 93: Hoare triple {27869#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {27869#false} is VALID [2022-04-15 18:18:10,882 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-15 18:18:10,882 INFO L290 TraceCheckUtils]: 95: Hoare triple {27869#false} assume !(0 == ~tmp___6~0); {27869#false} is VALID [2022-04-15 18:18:10,882 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-15 18:18:10,882 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-15 18:18:10,882 INFO L290 TraceCheckUtils]: 98: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-15 18:18:10,883 INFO L290 TraceCheckUtils]: 99: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-15 18:18:10,883 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-15 18:18:10,883 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-15 18:18:10,883 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-15 18:18:10,883 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-15 18:18:10,883 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-15 18:18:10,883 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-15 18:18:10,883 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-15 18:18:10,883 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-15 18:18:10,884 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-15 18:18:10,884 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-15 18:18:10,884 INFO L290 TraceCheckUtils]: 110: Hoare triple {27869#false} assume 4400 == #t~mem58;havoc #t~mem58; {27869#false} is VALID [2022-04-15 18:18:10,884 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-15 18:18:10,884 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-15 18:18:10,884 INFO L290 TraceCheckUtils]: 113: Hoare triple {27869#false} assume !(2 == ~blastFlag~0); {27869#false} is VALID [2022-04-15 18:18:10,884 INFO L290 TraceCheckUtils]: 114: Hoare triple {27869#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {27869#false} is VALID [2022-04-15 18:18:10,884 INFO L290 TraceCheckUtils]: 115: Hoare triple {27869#false} assume !(~ret~0 <= 0); {27869#false} is VALID [2022-04-15 18:18:10,884 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-15 18:18:10,884 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-15 18:18:10,885 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-15 18:18:10,885 INFO L290 TraceCheckUtils]: 119: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-15 18:18:10,885 INFO L290 TraceCheckUtils]: 120: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-15 18:18:10,885 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-15 18:18:10,885 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-15 18:18:10,885 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-15 18:18:10,885 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-15 18:18:10,885 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-15 18:18:10,885 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-15 18:18:10,885 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-15 18:18:10,886 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-15 18:18:10,886 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-15 18:18:10,886 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-15 18:18:10,886 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-15 18:18:10,886 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-15 18:18:10,886 INFO L290 TraceCheckUtils]: 133: Hoare triple {27869#false} assume 4416 == #t~mem60;havoc #t~mem60; {27869#false} is VALID [2022-04-15 18:18:10,886 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-15 18:18:10,886 INFO L290 TraceCheckUtils]: 135: Hoare triple {27869#false} assume !(3 == ~blastFlag~0); {27869#false} is VALID [2022-04-15 18:18:10,886 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-15 18:18:10,887 INFO L290 TraceCheckUtils]: 137: Hoare triple {27869#false} assume !(0 == ~tmp___6~0); {27869#false} is VALID [2022-04-15 18:18:10,887 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-15 18:18:10,887 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-15 18:18:10,887 INFO L290 TraceCheckUtils]: 140: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-15 18:18:10,887 INFO L290 TraceCheckUtils]: 141: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-15 18:18:10,887 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-15 18:18:10,887 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-15 18:18:10,887 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-15 18:18:10,887 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-15 18:18:10,888 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-15 18:18:10,888 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-15 18:18:10,888 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-15 18:18:10,888 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-15 18:18:10,888 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-15 18:18:10,888 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-15 18:18:10,888 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-15 18:18:10,888 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-15 18:18:10,888 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-15 18:18:10,888 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-15 18:18:10,888 INFO L290 TraceCheckUtils]: 156: Hoare triple {27869#false} assume 4432 == #t~mem62;havoc #t~mem62; {27869#false} is VALID [2022-04-15 18:18:10,889 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-15 18:18:10,889 INFO L290 TraceCheckUtils]: 158: Hoare triple {27869#false} assume 5 == ~blastFlag~0; {27869#false} is VALID [2022-04-15 18:18:10,889 INFO L290 TraceCheckUtils]: 159: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-15 18:18:10,889 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-15 18:18:10,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:18:10,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856311278] [2022-04-15 18:18:10,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856311278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:10,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:10,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:18:10,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:18:10,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [606007108] [2022-04-15 18:18:10,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [606007108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:10,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:10,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:18:10,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471209834] [2022-04-15 18:18:10,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:18:10,901 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-15 18:18:10,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:18:10,901 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-15 18:18:10,987 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-15 18:18:10,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:18:10,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:10,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:18:10,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:18:10,988 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-15 18:18:13,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:14,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:14,564 INFO L93 Difference]: Finished difference Result 2294 states and 3524 transitions. [2022-04-15 18:18:14,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:18:14,565 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-15 18:18:14,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:18:14,565 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-15 18:18:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:18:14,568 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-15 18:18:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:18:14,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 18:18:14,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:15,086 INFO L225 Difference]: With dead ends: 2294 [2022-04-15 18:18:15,087 INFO L226 Difference]: Without dead ends: 1414 [2022-04-15 18:18:15,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:18:15,089 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 111 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:18:15,089 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.5s Time] [2022-04-15 18:18:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2022-04-15 18:18:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1001. [2022-04-15 18:18:15,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:18:15,140 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-15 18:18:15,142 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-15 18:18:15,144 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-15 18:18:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:15,238 INFO L93 Difference]: Finished difference Result 1414 states and 2139 transitions. [2022-04-15 18:18:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2139 transitions. [2022-04-15 18:18:15,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:18:15,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:18:15,242 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-15 18:18:15,244 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-15 18:18:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:15,324 INFO L93 Difference]: Finished difference Result 1414 states and 2139 transitions. [2022-04-15 18:18:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2139 transitions. [2022-04-15 18:18:15,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:18:15,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:18:15,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:18:15,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:18:15,328 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-15 18:18:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1563 transitions. [2022-04-15 18:18:15,381 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1563 transitions. Word has length 160 [2022-04-15 18:18:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:18:15,382 INFO L478 AbstractCegarLoop]: Abstraction has 1001 states and 1563 transitions. [2022-04-15 18:18:15,382 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-15 18:18:15,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1001 states and 1563 transitions. [2022-04-15 18:18:16,637 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-15 18:18:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1563 transitions. [2022-04-15 18:18:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-15 18:18:16,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:18:16,644 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-15 18:18:16,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 18:18:16,644 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:18:16,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:18:16,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1057182855, now seen corresponding path program 1 times [2022-04-15 18:18:16,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:16,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1156047505] [2022-04-15 18:18:31,753 WARN L232 SmtUtils]: Spent 10.79s 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-15 18:18:40,955 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:18:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1057182855, now seen corresponding path program 2 times [2022-04-15 18:18:40,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:18:40,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284965925] [2022-04-15 18:18:40,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:18:40,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:18:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:41,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:18:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:41,348 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-15 18:18:41,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {37298#true} assume true; {37298#true} is VALID [2022-04-15 18:18:41,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37298#true} {37298#true} #593#return; {37298#true} is VALID [2022-04-15 18:18:41,349 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-15 18:18:41,349 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-15 18:18:41,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {37298#true} assume true; {37298#true} is VALID [2022-04-15 18:18:41,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37298#true} {37298#true} #593#return; {37298#true} is VALID [2022-04-15 18:18:41,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {37298#true} call #t~ret158 := main(); {37298#true} is VALID [2022-04-15 18:18:41,349 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-15 18:18:41,350 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-15 18:18:41,350 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-15 18:18:41,350 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-15 18:18:41,350 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-15 18:18:41,350 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-15 18:18:41,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-15 18:18:41,350 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-15 18:18:41,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {37298#true} assume 12292 == #t~mem49;havoc #t~mem49; {37298#true} is VALID [2022-04-15 18:18:41,350 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-15 18:18:41,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {37298#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {37298#true} is VALID [2022-04-15 18:18:41,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {37298#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {37298#true} is VALID [2022-04-15 18:18:41,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {37298#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37298#true} is VALID [2022-04-15 18:18:41,359 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-15 18:18:41,359 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-15 18:18:41,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {37298#true} assume !(0 == ~tmp___4~0); {37298#true} is VALID [2022-04-15 18:18:41,359 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-15 18:18:41,359 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-15 18:18:41,359 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-15 18:18:41,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-15 18:18:41,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-15 18:18:41,359 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-15 18:18:41,360 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-15 18:18:41,360 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-15 18:18:41,360 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-15 18:18:41,360 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-15 18:18:41,360 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-15 18:18:41,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {37298#true} assume 4368 == #t~mem54;havoc #t~mem54; {37298#true} is VALID [2022-04-15 18:18:41,360 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-15 18:18:41,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {37298#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37298#true} is VALID [2022-04-15 18:18:41,360 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-15 18:18:41,360 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-15 18:18:41,361 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-15 18:18:41,361 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-15 18:18:41,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-15 18:18:41,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-15 18:18:41,361 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-15 18:18:41,361 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-15 18:18:41,361 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-15 18:18:41,361 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-15 18:18:41,361 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-15 18:18:41,361 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-15 18:18:41,362 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-15 18:18:41,362 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-15 18:18:41,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {37298#true} assume 4384 == #t~mem56;havoc #t~mem56; {37298#true} is VALID [2022-04-15 18:18:41,362 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-15 18:18:41,362 INFO L290 TraceCheckUtils]: 51: Hoare triple {37298#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37298#true} is VALID [2022-04-15 18:18:41,362 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-15 18:18:41,362 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-15 18:18:41,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {37298#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {37298#true} is VALID [2022-04-15 18:18:41,362 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-15 18:18:41,363 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-15 18:18:41,363 INFO L290 TraceCheckUtils]: 57: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-15 18:18:41,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-15 18:18:41,363 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-15 18:18:41,363 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-15 18:18:41,363 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-15 18:18:41,363 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-15 18:18:41,363 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-15 18:18:41,363 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-15 18:18:41,363 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-15 18:18:41,364 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-15 18:18:41,364 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-15 18:18:41,364 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-15 18:18:41,364 INFO L290 TraceCheckUtils]: 69: Hoare triple {37298#true} assume 4400 == #t~mem58;havoc #t~mem58; {37298#true} is VALID [2022-04-15 18:18:41,364 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-15 18:18:41,364 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-15 18:18:41,364 INFO L290 TraceCheckUtils]: 72: Hoare triple {37298#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {37298#true} is VALID [2022-04-15 18:18:41,364 INFO L290 TraceCheckUtils]: 73: Hoare triple {37298#true} assume !(~ret~0 <= 0); {37298#true} is VALID [2022-04-15 18:18:41,364 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-15 18:18:41,364 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-15 18:18:41,365 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-15 18:18:41,365 INFO L290 TraceCheckUtils]: 77: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-15 18:18:41,365 INFO L290 TraceCheckUtils]: 78: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-15 18:18:41,365 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-15 18:18:41,365 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-15 18:18:41,365 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-15 18:18:41,365 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-15 18:18:41,365 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-15 18:18:41,365 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-15 18:18:41,366 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-15 18:18:41,366 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-15 18:18:41,366 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-15 18:18:41,366 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-15 18:18:41,366 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-15 18:18:41,366 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-15 18:18:41,366 INFO L290 TraceCheckUtils]: 91: Hoare triple {37298#true} assume 4416 == #t~mem60;havoc #t~mem60; {37298#true} is VALID [2022-04-15 18:18:41,366 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-15 18:18:41,366 INFO L290 TraceCheckUtils]: 93: Hoare triple {37298#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37298#true} is VALID [2022-04-15 18:18:41,368 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-15 18:18:41,368 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-15 18:18:41,369 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-15 18:18:41,369 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-15 18:18:41,369 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-15 18:18:41,370 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-15 18:18:41,370 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-15 18:18:41,370 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-15 18:18:41,371 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-15 18:18:41,371 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-15 18:18:41,372 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-15 18:18:41,372 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-15 18:18:41,372 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-15 18:18:41,373 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-15 18:18:41,373 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-15 18:18:41,374 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-15 18:18:41,374 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-15 18:18:41,375 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-15 18:18:41,375 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-15 18:18:41,375 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-15 18:18:41,375 INFO L290 TraceCheckUtils]: 114: Hoare triple {37299#false} assume !(2 == ~blastFlag~0); {37299#false} is VALID [2022-04-15 18:18:41,375 INFO L290 TraceCheckUtils]: 115: Hoare triple {37299#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {37299#false} is VALID [2022-04-15 18:18:41,375 INFO L290 TraceCheckUtils]: 116: Hoare triple {37299#false} assume !(~ret~0 <= 0); {37299#false} is VALID [2022-04-15 18:18:41,375 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-15 18:18:41,375 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-15 18:18:41,375 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-15 18:18:41,376 INFO L290 TraceCheckUtils]: 120: Hoare triple {37299#false} ~skip~0 := 0; {37299#false} is VALID [2022-04-15 18:18:41,376 INFO L290 TraceCheckUtils]: 121: Hoare triple {37299#false} assume !false; {37299#false} is VALID [2022-04-15 18:18:41,376 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-15 18:18:41,376 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-15 18:18:41,376 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-15 18:18:41,376 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-15 18:18:41,376 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-15 18:18:41,376 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-15 18:18:41,376 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-15 18:18:41,376 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-15 18:18:41,377 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-15 18:18:41,377 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-15 18:18:41,377 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-15 18:18:41,377 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-15 18:18:41,377 INFO L290 TraceCheckUtils]: 134: Hoare triple {37299#false} assume 4416 == #t~mem60;havoc #t~mem60; {37299#false} is VALID [2022-04-15 18:18:41,377 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-15 18:18:41,377 INFO L290 TraceCheckUtils]: 136: Hoare triple {37299#false} assume !(3 == ~blastFlag~0); {37299#false} is VALID [2022-04-15 18:18:41,377 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-15 18:18:41,377 INFO L290 TraceCheckUtils]: 138: Hoare triple {37299#false} assume !(0 == ~tmp___6~0); {37299#false} is VALID [2022-04-15 18:18:41,377 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-15 18:18:41,378 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-15 18:18:41,378 INFO L290 TraceCheckUtils]: 141: Hoare triple {37299#false} ~skip~0 := 0; {37299#false} is VALID [2022-04-15 18:18:41,378 INFO L290 TraceCheckUtils]: 142: Hoare triple {37299#false} assume !false; {37299#false} is VALID [2022-04-15 18:18:41,378 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-15 18:18:41,378 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-15 18:18:41,378 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-15 18:18:41,378 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-15 18:18:41,378 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-15 18:18:41,378 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-15 18:18:41,378 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-15 18:18:41,378 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-15 18:18:41,379 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-15 18:18:41,379 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-15 18:18:41,379 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-15 18:18:41,379 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-15 18:18:41,379 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-15 18:18:41,379 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-15 18:18:41,379 INFO L290 TraceCheckUtils]: 157: Hoare triple {37299#false} assume 4432 == #t~mem62;havoc #t~mem62; {37299#false} is VALID [2022-04-15 18:18:41,379 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-15 18:18:41,379 INFO L290 TraceCheckUtils]: 159: Hoare triple {37299#false} assume 5 == ~blastFlag~0; {37299#false} is VALID [2022-04-15 18:18:41,380 INFO L290 TraceCheckUtils]: 160: Hoare triple {37299#false} assume !false; {37299#false} is VALID [2022-04-15 18:18:41,380 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-15 18:18:41,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:18:41,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284965925] [2022-04-15 18:18:41,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284965925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:41,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:41,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:18:41,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:18:41,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1156047505] [2022-04-15 18:18:41,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1156047505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:41,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:41,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:18:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894809778] [2022-04-15 18:18:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:18:41,382 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-15 18:18:41,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:18:41,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:41,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:41,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:18:41,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:18:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:18:41,472 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-15 18:18:45,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:47,274 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:49,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:51,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:52,788 INFO L93 Difference]: Finished difference Result 2368 states and 3635 transitions. [2022-04-15 18:18:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:18:52,788 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-15 18:18:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:18:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 18:18:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 18:18:52,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 18:18:53,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:53,315 INFO L225 Difference]: With dead ends: 2368 [2022-04-15 18:18:53,315 INFO L226 Difference]: Without dead ends: 1383 [2022-04-15 18:18:53,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:18:53,317 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 109 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 46 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 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, 8.2s IncrementalHoareTripleChecker+Time [2022-04-15 18:18:53,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 278 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 383 Invalid, 3 Unknown, 0 Unchecked, 8.2s Time] [2022-04-15 18:18:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-04-15 18:18:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1001. [2022-04-15 18:18:53,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:18:53,371 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-15 18:18:53,372 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-15 18:18:53,374 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-15 18:18:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:53,450 INFO L93 Difference]: Finished difference Result 1383 states and 2081 transitions. [2022-04-15 18:18:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2081 transitions. [2022-04-15 18:18:53,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:18:53,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:18:53,454 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-15 18:18:53,455 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-15 18:18:53,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:53,569 INFO L93 Difference]: Finished difference Result 1383 states and 2081 transitions. [2022-04-15 18:18:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2081 transitions. [2022-04-15 18:18:53,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:18:53,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:18:53,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:18:53,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:18:53,572 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-15 18:18:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1552 transitions. [2022-04-15 18:18:53,672 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1552 transitions. Word has length 161 [2022-04-15 18:18:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:18:53,672 INFO L478 AbstractCegarLoop]: Abstraction has 1001 states and 1552 transitions. [2022-04-15 18:18:53,672 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:53,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1001 states and 1552 transitions. [2022-04-15 18:18:55,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1552 edges. 1552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1552 transitions. [2022-04-15 18:18:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-15 18:18:55,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:18:55,555 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-15 18:18:55,556 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 18:18:55,556 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:18:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:18:55,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1464555500, now seen corresponding path program 1 times [2022-04-15 18:18:55,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:55,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1251689834] [2022-04-15 18:19:09,266 WARN L232 SmtUtils]: Spent 8.34s 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-15 18:19:21,037 WARN L232 SmtUtils]: Spent 6.59s 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-15 18:19:23,550 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:19:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1464555500, now seen corresponding path program 2 times [2022-04-15 18:19:23,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:19:23,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134724837] [2022-04-15 18:19:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:19:23,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:19:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:19:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:23,780 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-15 18:19:23,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {46814#true} assume true; {46814#true} is VALID [2022-04-15 18:19:23,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46814#true} {46814#true} #593#return; {46814#true} is VALID [2022-04-15 18:19:23,781 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-15 18:19:23,781 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-15 18:19:23,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {46814#true} assume true; {46814#true} is VALID [2022-04-15 18:19:23,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46814#true} {46814#true} #593#return; {46814#true} is VALID [2022-04-15 18:19:23,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {46814#true} call #t~ret158 := main(); {46814#true} is VALID [2022-04-15 18:19:23,781 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-15 18:19:23,782 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-15 18:19:23,782 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-15 18:19:23,782 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-15 18:19:23,782 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-15 18:19:23,782 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-15 18:19:23,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-15 18:19:23,782 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-15 18:19:23,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {46814#true} assume 12292 == #t~mem49;havoc #t~mem49; {46814#true} is VALID [2022-04-15 18:19:23,782 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-15 18:19:23,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {46814#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {46814#true} is VALID [2022-04-15 18:19:23,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {46814#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {46814#true} is VALID [2022-04-15 18:19:23,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {46814#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {46814#true} is VALID [2022-04-15 18:19:23,783 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-15 18:19:23,783 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-15 18:19:23,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {46814#true} assume !(0 == ~tmp___4~0); {46814#true} is VALID [2022-04-15 18:19:23,783 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-15 18:19:23,783 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-15 18:19:23,783 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-15 18:19:23,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-15 18:19:23,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-15 18:19:23,784 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-15 18:19:23,784 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-15 18:19:23,784 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-15 18:19:23,784 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-15 18:19:23,784 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-15 18:19:23,784 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-15 18:19:23,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {46814#true} assume 4368 == #t~mem54;havoc #t~mem54; {46814#true} is VALID [2022-04-15 18:19:23,784 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-15 18:19:23,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {46814#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {46814#true} is VALID [2022-04-15 18:19:23,785 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-15 18:19:23,785 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-15 18:19:23,785 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-15 18:19:23,785 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-15 18:19:23,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-15 18:19:23,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-15 18:19:23,785 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-15 18:19:23,785 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-15 18:19:23,785 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-15 18:19:23,786 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-15 18:19:23,786 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-15 18:19:23,786 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-15 18:19:23,786 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-15 18:19:23,786 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-15 18:19:23,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {46814#true} assume 4384 == #t~mem56;havoc #t~mem56; {46814#true} is VALID [2022-04-15 18:19:23,786 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-15 18:19:23,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {46814#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {46814#true} is VALID [2022-04-15 18:19:23,786 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-15 18:19:23,786 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-15 18:19:23,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {46814#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {46814#true} is VALID [2022-04-15 18:19:23,787 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-15 18:19:23,787 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-15 18:19:23,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-15 18:19:23,787 INFO L290 TraceCheckUtils]: 58: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-15 18:19:23,787 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-15 18:19:23,787 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-15 18:19:23,787 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-15 18:19:23,787 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-15 18:19:23,787 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-15 18:19:23,788 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-15 18:19:23,788 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-15 18:19:23,788 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-15 18:19:23,788 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-15 18:19:23,788 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-15 18:19:23,788 INFO L290 TraceCheckUtils]: 69: Hoare triple {46814#true} assume 4400 == #t~mem58;havoc #t~mem58; {46814#true} is VALID [2022-04-15 18:19:23,788 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-15 18:19:23,788 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-15 18:19:23,788 INFO L290 TraceCheckUtils]: 72: Hoare triple {46814#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {46814#true} is VALID [2022-04-15 18:19:23,789 INFO L290 TraceCheckUtils]: 73: Hoare triple {46814#true} assume !(~ret~0 <= 0); {46814#true} is VALID [2022-04-15 18:19:23,789 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-15 18:19:23,789 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-15 18:19:23,789 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-15 18:19:23,789 INFO L290 TraceCheckUtils]: 77: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-15 18:19:23,789 INFO L290 TraceCheckUtils]: 78: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-15 18:19:23,789 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-15 18:19:23,789 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-15 18:19:23,789 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-15 18:19:23,789 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-15 18:19:23,790 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-15 18:19:23,790 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-15 18:19:23,790 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-15 18:19:23,790 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-15 18:19:23,790 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-15 18:19:23,790 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-15 18:19:23,790 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-15 18:19:23,790 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-15 18:19:23,790 INFO L290 TraceCheckUtils]: 91: Hoare triple {46814#true} assume 4416 == #t~mem60;havoc #t~mem60; {46814#true} is VALID [2022-04-15 18:19:23,791 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-15 18:19:23,791 INFO L290 TraceCheckUtils]: 93: Hoare triple {46814#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {46814#true} is VALID [2022-04-15 18:19:23,792 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-15 18:19:23,792 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-15 18:19:23,793 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-15 18:19:23,793 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-15 18:19:23,793 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-15 18:19:23,794 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-15 18:19:23,794 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-15 18:19:23,794 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-15 18:19:23,794 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-15 18:19:23,795 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-15 18:19:23,795 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-15 18:19:23,795 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-15 18:19:23,796 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-15 18:19:23,796 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-15 18:19:23,797 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-15 18:19:23,797 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-15 18:19:23,797 INFO L290 TraceCheckUtils]: 110: Hoare triple {46815#false} assume !(1 == ~blastFlag~0); {46815#false} is VALID [2022-04-15 18:19:23,797 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-15 18:19:23,797 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-15 18:19:23,797 INFO L290 TraceCheckUtils]: 113: Hoare triple {46815#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {46815#false} is VALID [2022-04-15 18:19:23,797 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-15 18:19:23,798 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-15 18:19:23,798 INFO L290 TraceCheckUtils]: 116: Hoare triple {46815#false} ~skip~0 := 0; {46815#false} is VALID [2022-04-15 18:19:23,798 INFO L290 TraceCheckUtils]: 117: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-15 18:19:23,798 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-15 18:19:23,798 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-15 18:19:23,798 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-15 18:19:23,798 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-15 18:19:23,798 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-15 18:19:23,799 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-15 18:19:23,799 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-15 18:19:23,799 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-15 18:19:23,799 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-15 18:19:23,799 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-15 18:19:23,799 INFO L290 TraceCheckUtils]: 128: Hoare triple {46815#false} assume 4400 == #t~mem58;havoc #t~mem58; {46815#false} is VALID [2022-04-15 18:19:23,799 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-15 18:19:23,799 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-15 18:19:23,799 INFO L290 TraceCheckUtils]: 131: Hoare triple {46815#false} assume !(2 == ~blastFlag~0); {46815#false} is VALID [2022-04-15 18:19:23,800 INFO L290 TraceCheckUtils]: 132: Hoare triple {46815#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {46815#false} is VALID [2022-04-15 18:19:23,800 INFO L290 TraceCheckUtils]: 133: Hoare triple {46815#false} assume !(~ret~0 <= 0); {46815#false} is VALID [2022-04-15 18:19:23,800 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-15 18:19:23,800 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-15 18:19:23,800 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-15 18:19:23,800 INFO L290 TraceCheckUtils]: 137: Hoare triple {46815#false} ~skip~0 := 0; {46815#false} is VALID [2022-04-15 18:19:23,800 INFO L290 TraceCheckUtils]: 138: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-15 18:19:23,800 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-15 18:19:23,800 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-15 18:19:23,801 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-15 18:19:23,801 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-15 18:19:23,801 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-15 18:19:23,801 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-15 18:19:23,801 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-15 18:19:23,801 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-15 18:19:23,801 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-15 18:19:23,801 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-15 18:19:23,801 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-15 18:19:23,801 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-15 18:19:23,802 INFO L290 TraceCheckUtils]: 151: Hoare triple {46815#false} assume 4416 == #t~mem60;havoc #t~mem60; {46815#false} is VALID [2022-04-15 18:19:23,802 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-15 18:19:23,802 INFO L290 TraceCheckUtils]: 153: Hoare triple {46815#false} assume !(3 == ~blastFlag~0); {46815#false} is VALID [2022-04-15 18:19:23,802 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-15 18:19:23,802 INFO L290 TraceCheckUtils]: 155: Hoare triple {46815#false} assume !(0 == ~tmp___6~0); {46815#false} is VALID [2022-04-15 18:19:23,802 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-15 18:19:23,802 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-15 18:19:23,802 INFO L290 TraceCheckUtils]: 158: Hoare triple {46815#false} ~skip~0 := 0; {46815#false} is VALID [2022-04-15 18:19:23,802 INFO L290 TraceCheckUtils]: 159: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-15 18:19:23,803 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-15 18:19:23,803 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-15 18:19:23,803 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-15 18:19:23,803 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-15 18:19:23,803 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-15 18:19:23,803 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-15 18:19:23,803 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-15 18:19:23,803 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-15 18:19:23,803 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-15 18:19:23,804 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-15 18:19:23,804 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-15 18:19:23,804 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-15 18:19:23,804 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-15 18:19:23,804 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-15 18:19:23,804 INFO L290 TraceCheckUtils]: 174: Hoare triple {46815#false} assume 4432 == #t~mem62;havoc #t~mem62; {46815#false} is VALID [2022-04-15 18:19:23,804 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-15 18:19:23,804 INFO L290 TraceCheckUtils]: 176: Hoare triple {46815#false} assume 5 == ~blastFlag~0; {46815#false} is VALID [2022-04-15 18:19:23,804 INFO L290 TraceCheckUtils]: 177: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-15 18:19:23,805 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-15 18:19:23,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:19:23,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134724837] [2022-04-15 18:19:23,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134724837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:23,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:23,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:23,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:19:23,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1251689834] [2022-04-15 18:19:23,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1251689834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:23,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:23,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:23,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897473553] [2022-04-15 18:19:23,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:19:23,807 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-15 18:19:23,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:19:23,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:23,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:23,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:19:23,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:23,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:19:23,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:19:23,902 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-15 18:19:25,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:27,337 INFO L93 Difference]: Finished difference Result 2493 states and 3818 transitions. [2022-04-15 18:19:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:27,337 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-15 18:19:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:19:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:19:27,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 18:19:27,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:27,766 INFO L225 Difference]: With dead ends: 2493 [2022-04-15 18:19:27,766 INFO L226 Difference]: Without dead ends: 1508 [2022-04-15 18:19:27,768 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:19:27,769 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-15 18:19:27,769 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-15 18:19:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-04-15 18:19:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1091. [2022-04-15 18:19:27,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:27,833 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-15 18:19:27,835 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-15 18:19:27,836 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-15 18:19:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:27,929 INFO L93 Difference]: Finished difference Result 1508 states and 2270 transitions. [2022-04-15 18:19:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2270 transitions. [2022-04-15 18:19:27,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:27,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:27,933 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-15 18:19:27,935 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-15 18:19:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:28,027 INFO L93 Difference]: Finished difference Result 1508 states and 2270 transitions. [2022-04-15 18:19:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2270 transitions. [2022-04-15 18:19:28,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:28,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:28,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:28,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:28,031 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-15 18:19:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1691 transitions. [2022-04-15 18:19:28,112 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1691 transitions. Word has length 178 [2022-04-15 18:19:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:28,113 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1691 transitions. [2022-04-15 18:19:28,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:28,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1691 transitions. [2022-04-15 18:19:29,583 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-15 18:19:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1691 transitions. [2022-04-15 18:19:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-04-15 18:19:29,585 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:29,585 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-15 18:19:29,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 18:19:29,586 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:29,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:29,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1065449955, now seen corresponding path program 1 times [2022-04-15 18:19:29,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:29,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [592819945] [2022-04-15 18:19:51,234 WARN L232 SmtUtils]: Spent 15.81s 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-15 18:20:02,830 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:20:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1065449955, now seen corresponding path program 2 times [2022-04-15 18:20:02,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:20:02,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018507630] [2022-04-15 18:20:02,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:20:02,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:20:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:20:03,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:20:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:20:03,204 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-15 18:20:03,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {57010#true} assume true; {57010#true} is VALID [2022-04-15 18:20:03,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57010#true} {57010#true} #593#return; {57010#true} is VALID [2022-04-15 18:20:03,205 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-15 18:20:03,205 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-15 18:20:03,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {57010#true} assume true; {57010#true} is VALID [2022-04-15 18:20:03,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57010#true} {57010#true} #593#return; {57010#true} is VALID [2022-04-15 18:20:03,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {57010#true} call #t~ret158 := main(); {57010#true} is VALID [2022-04-15 18:20:03,205 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-15 18:20:03,205 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-15 18:20:03,205 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-15 18:20:03,205 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-15 18:20:03,206 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-15 18:20:03,206 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-15 18:20:03,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-15 18:20:03,206 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-15 18:20:03,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {57010#true} assume 12292 == #t~mem49;havoc #t~mem49; {57010#true} is VALID [2022-04-15 18:20:03,206 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-15 18:20:03,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {57010#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {57010#true} is VALID [2022-04-15 18:20:03,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {57010#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {57010#true} is VALID [2022-04-15 18:20:03,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {57010#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {57010#true} is VALID [2022-04-15 18:20:03,206 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-15 18:20:03,207 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-15 18:20:03,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {57010#true} assume !(0 == ~tmp___4~0); {57010#true} is VALID [2022-04-15 18:20:03,207 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-15 18:20:03,207 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-15 18:20:03,207 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-15 18:20:03,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-15 18:20:03,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-15 18:20:03,207 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-15 18:20:03,207 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-15 18:20:03,207 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-15 18:20:03,207 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-15 18:20:03,208 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-15 18:20:03,208 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-15 18:20:03,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {57010#true} assume 4368 == #t~mem54;havoc #t~mem54; {57010#true} is VALID [2022-04-15 18:20:03,208 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-15 18:20:03,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {57010#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {57010#true} is VALID [2022-04-15 18:20:03,208 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-15 18:20:03,208 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-15 18:20:03,208 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-15 18:20:03,208 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-15 18:20:03,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-15 18:20:03,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-15 18:20:03,209 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-15 18:20:03,209 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-15 18:20:03,209 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-15 18:20:03,209 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-15 18:20:03,209 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-15 18:20:03,209 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-15 18:20:03,209 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-15 18:20:03,209 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-15 18:20:03,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {57010#true} assume 4384 == #t~mem56;havoc #t~mem56; {57010#true} is VALID [2022-04-15 18:20:03,209 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-15 18:20:03,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {57010#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {57010#true} is VALID [2022-04-15 18:20:03,210 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-15 18:20:03,210 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-15 18:20:03,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {57010#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {57010#true} is VALID [2022-04-15 18:20:03,210 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-15 18:20:03,210 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-15 18:20:03,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-15 18:20:03,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-15 18:20:03,210 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-15 18:20:03,210 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-15 18:20:03,210 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-15 18:20:03,211 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-15 18:20:03,211 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-15 18:20:03,211 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-15 18:20:03,211 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-15 18:20:03,211 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-15 18:20:03,211 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-15 18:20:03,211 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-15 18:20:03,211 INFO L290 TraceCheckUtils]: 69: Hoare triple {57010#true} assume 4400 == #t~mem58;havoc #t~mem58; {57010#true} is VALID [2022-04-15 18:20:03,211 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-15 18:20:03,211 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-15 18:20:03,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {57010#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {57010#true} is VALID [2022-04-15 18:20:03,212 INFO L290 TraceCheckUtils]: 73: Hoare triple {57010#true} assume !(~ret~0 <= 0); {57010#true} is VALID [2022-04-15 18:20:03,212 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-15 18:20:03,212 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-15 18:20:03,212 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-15 18:20:03,212 INFO L290 TraceCheckUtils]: 77: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-15 18:20:03,212 INFO L290 TraceCheckUtils]: 78: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-15 18:20:03,212 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-15 18:20:03,212 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-15 18:20:03,212 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-15 18:20:03,212 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-15 18:20:03,212 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-15 18:20:03,213 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-15 18:20:03,213 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-15 18:20:03,213 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-15 18:20:03,213 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-15 18:20:03,213 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-15 18:20:03,213 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-15 18:20:03,213 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-15 18:20:03,213 INFO L290 TraceCheckUtils]: 91: Hoare triple {57010#true} assume 4416 == #t~mem60;havoc #t~mem60; {57010#true} is VALID [2022-04-15 18:20:03,213 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-15 18:20:03,221 INFO L290 TraceCheckUtils]: 93: Hoare triple {57010#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {57010#true} is VALID [2022-04-15 18:20:03,222 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-15 18:20:03,222 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-15 18:20:03,223 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-15 18:20:03,223 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-15 18:20:03,223 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-15 18:20:03,224 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-15 18:20:03,239 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-15 18:20:03,240 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-15 18:20:03,240 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-15 18:20:03,241 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-15 18:20:03,241 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-15 18:20:03,241 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-15 18:20:03,242 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-15 18:20:03,242 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-15 18:20:03,243 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-15 18:20:03,243 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-15 18:20:03,243 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-15 18:20:03,243 INFO L290 TraceCheckUtils]: 111: Hoare triple {57011#false} assume !(1 == ~blastFlag~0); {57011#false} is VALID [2022-04-15 18:20:03,243 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-15 18:20:03,243 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-15 18:20:03,244 INFO L290 TraceCheckUtils]: 114: Hoare triple {57011#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {57011#false} is VALID [2022-04-15 18:20:03,244 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-15 18:20:03,244 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-15 18:20:03,244 INFO L290 TraceCheckUtils]: 117: Hoare triple {57011#false} ~skip~0 := 0; {57011#false} is VALID [2022-04-15 18:20:03,244 INFO L290 TraceCheckUtils]: 118: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-15 18:20:03,244 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-15 18:20:03,244 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-15 18:20:03,244 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-15 18:20:03,244 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-15 18:20:03,244 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-15 18:20:03,245 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-15 18:20:03,245 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-15 18:20:03,245 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-15 18:20:03,245 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-15 18:20:03,245 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-15 18:20:03,245 INFO L290 TraceCheckUtils]: 129: Hoare triple {57011#false} assume 4400 == #t~mem58;havoc #t~mem58; {57011#false} is VALID [2022-04-15 18:20:03,245 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-15 18:20:03,245 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-15 18:20:03,245 INFO L290 TraceCheckUtils]: 132: Hoare triple {57011#false} assume !(2 == ~blastFlag~0); {57011#false} is VALID [2022-04-15 18:20:03,245 INFO L290 TraceCheckUtils]: 133: Hoare triple {57011#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {57011#false} is VALID [2022-04-15 18:20:03,245 INFO L290 TraceCheckUtils]: 134: Hoare triple {57011#false} assume !(~ret~0 <= 0); {57011#false} is VALID [2022-04-15 18:20:03,246 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-15 18:20:03,246 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-15 18:20:03,246 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-15 18:20:03,246 INFO L290 TraceCheckUtils]: 138: Hoare triple {57011#false} ~skip~0 := 0; {57011#false} is VALID [2022-04-15 18:20:03,246 INFO L290 TraceCheckUtils]: 139: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-15 18:20:03,246 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-15 18:20:03,246 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-15 18:20:03,246 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-15 18:20:03,246 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-15 18:20:03,246 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-15 18:20:03,247 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-15 18:20:03,247 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-15 18:20:03,247 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-15 18:20:03,247 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-15 18:20:03,247 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-15 18:20:03,247 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-15 18:20:03,247 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-15 18:20:03,247 INFO L290 TraceCheckUtils]: 152: Hoare triple {57011#false} assume 4416 == #t~mem60;havoc #t~mem60; {57011#false} is VALID [2022-04-15 18:20:03,247 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-15 18:20:03,247 INFO L290 TraceCheckUtils]: 154: Hoare triple {57011#false} assume !(3 == ~blastFlag~0); {57011#false} is VALID [2022-04-15 18:20:03,247 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-15 18:20:03,248 INFO L290 TraceCheckUtils]: 156: Hoare triple {57011#false} assume !(0 == ~tmp___6~0); {57011#false} is VALID [2022-04-15 18:20:03,248 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-15 18:20:03,248 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-15 18:20:03,248 INFO L290 TraceCheckUtils]: 159: Hoare triple {57011#false} ~skip~0 := 0; {57011#false} is VALID [2022-04-15 18:20:03,248 INFO L290 TraceCheckUtils]: 160: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-15 18:20:03,248 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-15 18:20:03,248 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-15 18:20:03,248 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-15 18:20:03,248 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-15 18:20:03,248 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-15 18:20:03,248 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-15 18:20:03,249 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-15 18:20:03,249 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-15 18:20:03,249 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-15 18:20:03,249 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-15 18:20:03,249 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-15 18:20:03,249 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-15 18:20:03,249 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-15 18:20:03,249 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-15 18:20:03,249 INFO L290 TraceCheckUtils]: 175: Hoare triple {57011#false} assume 4432 == #t~mem62;havoc #t~mem62; {57011#false} is VALID [2022-04-15 18:20:03,249 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-15 18:20:03,249 INFO L290 TraceCheckUtils]: 177: Hoare triple {57011#false} assume 5 == ~blastFlag~0; {57011#false} is VALID [2022-04-15 18:20:03,250 INFO L290 TraceCheckUtils]: 178: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-15 18:20:03,250 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-15 18:20:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:20:03,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018507630] [2022-04-15 18:20:03,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018507630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:20:03,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:20:03,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:20:03,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:20:03,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [592819945] [2022-04-15 18:20:03,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [592819945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:20:03,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:20:03,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:20:03,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359781305] [2022-04-15 18:20:03,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:20:03,252 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-15 18:20:03,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:20:03,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:03,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:20:03,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:20:03,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:20:03,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:20:03,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:20:03,344 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-15 18:20:05,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:20:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:07,481 INFO L93 Difference]: Finished difference Result 2452 states and 3760 transitions. [2022-04-15 18:20:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:20:07,481 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-15 18:20:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:20:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-15 18:20:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-15 18:20:07,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 456 transitions. [2022-04-15 18:20:07,854 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-15 18:20:08,022 INFO L225 Difference]: With dead ends: 2452 [2022-04-15 18:20:08,022 INFO L226 Difference]: Without dead ends: 1377 [2022-04-15 18:20:08,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:20:08,025 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 86 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 18:20:08,025 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.6s Time] [2022-04-15 18:20:08,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2022-04-15 18:20:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1091. [2022-04-15 18:20:08,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:20:08,127 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-15 18:20:08,133 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-15 18:20:08,134 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-15 18:20:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:08,204 INFO L93 Difference]: Finished difference Result 1377 states and 2084 transitions. [2022-04-15 18:20:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2084 transitions. [2022-04-15 18:20:08,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:20:08,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:20:08,221 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-15 18:20:08,232 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-15 18:20:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:08,361 INFO L93 Difference]: Finished difference Result 1377 states and 2084 transitions. [2022-04-15 18:20:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2084 transitions. [2022-04-15 18:20:08,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:20:08,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:20:08,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:20:08,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:20:08,374 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-15 18:20:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1686 transitions. [2022-04-15 18:20:08,554 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1686 transitions. Word has length 179 [2022-04-15 18:20:08,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:20:08,554 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1686 transitions. [2022-04-15 18:20:08,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:08,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1686 transitions. [2022-04-15 18:20:10,656 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-15 18:20:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1686 transitions. [2022-04-15 18:20:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-15 18:20:10,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:20:10,659 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-15 18:20:10,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 18:20:10,659 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:20:10,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:20:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash 624136773, now seen corresponding path program 3 times [2022-04-15 18:20:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:20:10,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1891161442] [2022-04-15 18:20:25,872 WARN L232 SmtUtils]: Spent 14.31s 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-15 18:20:36,365 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:20:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash 624136773, now seen corresponding path program 4 times [2022-04-15 18:20:36,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:20:36,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162188742] [2022-04-15 18:20:36,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:20:36,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:20:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:20:36,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:20:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:20:36,812 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-15 18:20:36,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {66862#true} assume true; {66862#true} is VALID [2022-04-15 18:20:36,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66862#true} {66862#true} #593#return; {66862#true} is VALID [2022-04-15 18:20:36,813 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-15 18:20:36,814 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-15 18:20:36,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {66862#true} assume true; {66862#true} is VALID [2022-04-15 18:20:36,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66862#true} {66862#true} #593#return; {66862#true} is VALID [2022-04-15 18:20:36,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {66862#true} call #t~ret158 := main(); {66862#true} is VALID [2022-04-15 18:20:36,814 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-15 18:20:36,814 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-15 18:20:36,814 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-15 18:20:36,814 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-15 18:20:36,814 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-15 18:20:36,815 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-15 18:20:36,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-15 18:20:36,815 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-15 18:20:36,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {66862#true} assume 12292 == #t~mem49;havoc #t~mem49; {66862#true} is VALID [2022-04-15 18:20:36,815 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-15 18:20:36,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {66862#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {66862#true} is VALID [2022-04-15 18:20:36,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {66862#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {66862#true} is VALID [2022-04-15 18:20:36,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {66862#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {66862#true} is VALID [2022-04-15 18:20:36,815 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-15 18:20:36,816 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-15 18:20:36,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {66862#true} assume !(0 == ~tmp___4~0); {66862#true} is VALID [2022-04-15 18:20:36,816 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-15 18:20:36,816 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-15 18:20:36,816 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-15 18:20:36,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-15 18:20:36,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-15 18:20:36,816 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-15 18:20:36,816 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-15 18:20:36,817 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-15 18:20:36,817 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-15 18:20:36,817 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-15 18:20:36,817 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-15 18:20:36,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {66862#true} assume 4368 == #t~mem54;havoc #t~mem54; {66862#true} is VALID [2022-04-15 18:20:36,817 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-15 18:20:36,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {66862#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66862#true} is VALID [2022-04-15 18:20:36,817 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-15 18:20:36,817 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-15 18:20:36,817 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-15 18:20:36,818 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-15 18:20:36,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-15 18:20:36,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-15 18:20:36,818 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-15 18:20:36,818 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-15 18:20:36,818 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-15 18:20:36,818 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-15 18:20:36,818 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-15 18:20:36,818 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-15 18:20:36,819 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-15 18:20:36,819 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-15 18:20:36,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {66862#true} assume 4384 == #t~mem56;havoc #t~mem56; {66862#true} is VALID [2022-04-15 18:20:36,819 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-15 18:20:36,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {66862#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {66862#true} is VALID [2022-04-15 18:20:36,819 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-15 18:20:36,819 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-15 18:20:36,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {66862#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66862#true} is VALID [2022-04-15 18:20:36,819 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-15 18:20:36,820 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-15 18:20:36,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-15 18:20:36,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-15 18:20:36,820 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-15 18:20:36,820 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-15 18:20:36,823 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-15 18:20:36,823 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-15 18:20:36,823 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-15 18:20:36,823 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-15 18:20:36,824 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-15 18:20:36,824 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-15 18:20:36,824 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-15 18:20:36,824 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-15 18:20:36,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {66862#true} assume 4400 == #t~mem58;havoc #t~mem58; {66862#true} is VALID [2022-04-15 18:20:36,824 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-15 18:20:36,824 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-15 18:20:36,824 INFO L290 TraceCheckUtils]: 72: Hoare triple {66862#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {66862#true} is VALID [2022-04-15 18:20:36,824 INFO L290 TraceCheckUtils]: 73: Hoare triple {66862#true} assume !(~ret~0 <= 0); {66862#true} is VALID [2022-04-15 18:20:36,824 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-15 18:20:36,825 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-15 18:20:36,825 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-15 18:20:36,825 INFO L290 TraceCheckUtils]: 77: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-15 18:20:36,825 INFO L290 TraceCheckUtils]: 78: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-15 18:20:36,825 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-15 18:20:36,825 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-15 18:20:36,825 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-15 18:20:36,825 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-15 18:20:36,825 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-15 18:20:36,826 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-15 18:20:36,826 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-15 18:20:36,826 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-15 18:20:36,826 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-15 18:20:36,826 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-15 18:20:36,826 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-15 18:20:36,847 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-15 18:20:36,847 INFO L290 TraceCheckUtils]: 91: Hoare triple {66862#true} assume 4416 == #t~mem60;havoc #t~mem60; {66862#true} is VALID [2022-04-15 18:20:36,848 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-15 18:20:36,848 INFO L290 TraceCheckUtils]: 93: Hoare triple {66862#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {66862#true} is VALID [2022-04-15 18:20:36,864 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-15 18:20:36,865 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-15 18:20:36,865 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-15 18:20:36,865 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-15 18:20:36,866 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-15 18:20:36,866 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-15 18:20:36,866 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-15 18:20:36,867 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-15 18:20:36,867 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-15 18:20:36,867 INFO L290 TraceCheckUtils]: 103: Hoare triple {66863#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {66863#false} is VALID [2022-04-15 18:20:36,867 INFO L290 TraceCheckUtils]: 104: Hoare triple {66863#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {66863#false} is VALID [2022-04-15 18:20:36,867 INFO L290 TraceCheckUtils]: 105: Hoare triple {66863#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {66863#false} is VALID [2022-04-15 18:20:36,867 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-15 18:20:36,867 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-15 18:20:36,867 INFO L290 TraceCheckUtils]: 108: Hoare triple {66863#false} assume !(0 == ~tmp___4~0); {66863#false} is VALID [2022-04-15 18:20:36,867 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-15 18:20:36,868 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-15 18:20:36,868 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-15 18:20:36,868 INFO L290 TraceCheckUtils]: 112: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-15 18:20:36,868 INFO L290 TraceCheckUtils]: 113: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-15 18:20:36,868 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-15 18:20:36,868 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-15 18:20:36,868 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-15 18:20:36,868 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-15 18:20:36,868 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-15 18:20:36,868 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-15 18:20:36,869 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-15 18:20:36,869 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-15 18:20:36,869 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-15 18:20:36,869 INFO L290 TraceCheckUtils]: 123: Hoare triple {66863#false} assume 4385 == #t~mem57;havoc #t~mem57; {66863#false} is VALID [2022-04-15 18:20:36,869 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-15 18:20:36,869 INFO L290 TraceCheckUtils]: 125: Hoare triple {66863#false} assume !(1 == ~blastFlag~0); {66863#false} is VALID [2022-04-15 18:20:36,869 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-15 18:20:36,869 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-15 18:20:36,869 INFO L290 TraceCheckUtils]: 128: Hoare triple {66863#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66863#false} is VALID [2022-04-15 18:20:36,869 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-15 18:20:36,870 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-15 18:20:36,870 INFO L290 TraceCheckUtils]: 131: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-15 18:20:36,870 INFO L290 TraceCheckUtils]: 132: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-15 18:20:36,870 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-15 18:20:36,870 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-15 18:20:36,870 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-15 18:20:36,870 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-15 18:20:36,870 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-15 18:20:36,870 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-15 18:20:36,870 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-15 18:20:36,871 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-15 18:20:36,871 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-15 18:20:36,871 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-15 18:20:36,871 INFO L290 TraceCheckUtils]: 143: Hoare triple {66863#false} assume 4400 == #t~mem58;havoc #t~mem58; {66863#false} is VALID [2022-04-15 18:20:36,871 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-15 18:20:36,871 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-15 18:20:36,871 INFO L290 TraceCheckUtils]: 146: Hoare triple {66863#false} assume !(2 == ~blastFlag~0); {66863#false} is VALID [2022-04-15 18:20:36,871 INFO L290 TraceCheckUtils]: 147: Hoare triple {66863#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {66863#false} is VALID [2022-04-15 18:20:36,871 INFO L290 TraceCheckUtils]: 148: Hoare triple {66863#false} assume !(~ret~0 <= 0); {66863#false} is VALID [2022-04-15 18:20:36,871 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-15 18:20:36,872 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-15 18:20:36,872 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-15 18:20:36,872 INFO L290 TraceCheckUtils]: 152: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-15 18:20:36,872 INFO L290 TraceCheckUtils]: 153: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-15 18:20:36,872 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-15 18:20:36,872 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-15 18:20:36,872 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-15 18:20:36,872 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-15 18:20:36,872 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-15 18:20:36,872 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-15 18:20:36,873 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-15 18:20:36,873 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-15 18:20:36,873 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-15 18:20:36,873 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-15 18:20:36,873 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-15 18:20:36,873 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-15 18:20:36,873 INFO L290 TraceCheckUtils]: 166: Hoare triple {66863#false} assume 4416 == #t~mem60;havoc #t~mem60; {66863#false} is VALID [2022-04-15 18:20:36,873 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-15 18:20:36,873 INFO L290 TraceCheckUtils]: 168: Hoare triple {66863#false} assume !(3 == ~blastFlag~0); {66863#false} is VALID [2022-04-15 18:20:36,873 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-15 18:20:36,873 INFO L290 TraceCheckUtils]: 170: Hoare triple {66863#false} assume !(0 == ~tmp___6~0); {66863#false} is VALID [2022-04-15 18:20:36,874 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-15 18:20:36,874 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-15 18:20:36,874 INFO L290 TraceCheckUtils]: 173: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-15 18:20:36,874 INFO L290 TraceCheckUtils]: 174: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-15 18:20:36,874 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-15 18:20:36,874 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-15 18:20:36,874 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-15 18:20:36,874 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-15 18:20:36,874 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-15 18:20:36,874 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-15 18:20:36,875 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-15 18:20:36,875 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-15 18:20:36,875 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-15 18:20:36,875 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-15 18:20:36,875 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-15 18:20:36,875 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-15 18:20:36,875 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-15 18:20:36,875 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-15 18:20:36,875 INFO L290 TraceCheckUtils]: 189: Hoare triple {66863#false} assume 4432 == #t~mem62;havoc #t~mem62; {66863#false} is VALID [2022-04-15 18:20:36,875 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-15 18:20:36,875 INFO L290 TraceCheckUtils]: 191: Hoare triple {66863#false} assume 5 == ~blastFlag~0; {66863#false} is VALID [2022-04-15 18:20:36,876 INFO L290 TraceCheckUtils]: 192: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-15 18:20:36,876 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-15 18:20:36,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:20:36,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162188742] [2022-04-15 18:20:36,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162188742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:20:36,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:20:36,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:20:36,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:20:36,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1891161442] [2022-04-15 18:20:36,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1891161442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:20:36,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:20:36,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:20:36,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282056085] [2022-04-15 18:20:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:20:36,878 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-15 18:20:36,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:20:36,878 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-15 18:20:37,007 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-15 18:20:37,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:20:37,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:20:37,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:20:37,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:20:37,008 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-15 18:20:39,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:20:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:40,348 INFO L93 Difference]: Finished difference Result 2542 states and 3875 transitions. [2022-04-15 18:20:40,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:20:40,349 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-15 18:20:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:20:40,349 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-15 18:20:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 18:20:40,355 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-15 18:20:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 18:20:40,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-15 18:20:40,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:20:40,756 INFO L225 Difference]: With dead ends: 2542 [2022-04-15 18:20:40,756 INFO L226 Difference]: Without dead ends: 1467 [2022-04-15 18:20:40,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:20:40,758 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-15 18:20:40,758 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-15 18:20:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-04-15 18:20:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1091. [2022-04-15 18:20:40,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:20:40,836 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-15 18:20:40,838 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-15 18:20:40,839 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-15 18:20:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:40,904 INFO L93 Difference]: Finished difference Result 1467 states and 2188 transitions. [2022-04-15 18:20:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2188 transitions. [2022-04-15 18:20:40,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:20:40,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:20:40,907 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-15 18:20:40,909 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-15 18:20:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:40,997 INFO L93 Difference]: Finished difference Result 1467 states and 2188 transitions. [2022-04-15 18:20:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2188 transitions. [2022-04-15 18:20:40,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:20:40,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:20:40,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:20:40,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:20:41,000 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-15 18:20:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1665 transitions. [2022-04-15 18:20:41,078 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1665 transitions. Word has length 193 [2022-04-15 18:20:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:20:41,078 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1665 transitions. [2022-04-15 18:20:41,078 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-15 18:20:41,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1665 transitions. [2022-04-15 18:20:42,650 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-15 18:20:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1665 transitions. [2022-04-15 18:20:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-15 18:20:42,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:20:42,652 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-15 18:20:42,652 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 18:20:42,652 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:20:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:20:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 1 times [2022-04-15 18:20:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:20:42,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [707269987] [2022-04-15 18:20:57,735 WARN L232 SmtUtils]: Spent 8.67s 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-15 18:21:06,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:21:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 2 times [2022-04-15 18:21:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:21:06,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985244883] [2022-04-15 18:21:06,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:21:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:21:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:21:06,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:21:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:21:06,454 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-15 18:21:06,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {77074#true} assume true; {77074#true} is VALID [2022-04-15 18:21:06,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77074#true} {77074#true} #593#return; {77074#true} is VALID [2022-04-15 18:21:06,455 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-15 18:21:06,456 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-15 18:21:06,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {77074#true} assume true; {77074#true} is VALID [2022-04-15 18:21:06,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77074#true} {77074#true} #593#return; {77074#true} is VALID [2022-04-15 18:21:06,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {77074#true} call #t~ret158 := main(); {77074#true} is VALID [2022-04-15 18:21:06,456 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-15 18:21:06,456 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-15 18:21:06,456 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-15 18:21:06,456 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-15 18:21:06,457 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-15 18:21:06,457 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-15 18:21:06,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-15 18:21:06,457 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-15 18:21:06,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {77074#true} assume 12292 == #t~mem49;havoc #t~mem49; {77074#true} is VALID [2022-04-15 18:21:06,457 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-15 18:21:06,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {77074#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {77074#true} is VALID [2022-04-15 18:21:06,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {77074#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {77074#true} is VALID [2022-04-15 18:21:06,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {77074#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {77074#true} is VALID [2022-04-15 18:21:06,457 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-15 18:21:06,458 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-15 18:21:06,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {77074#true} assume !(0 == ~tmp___4~0); {77074#true} is VALID [2022-04-15 18:21:06,458 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-15 18:21:06,458 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-15 18:21:06,458 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-15 18:21:06,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-15 18:21:06,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-15 18:21:06,458 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-15 18:21:06,458 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-15 18:21:06,458 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-15 18:21:06,458 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-15 18:21:06,459 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-15 18:21:06,459 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-15 18:21:06,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {77074#true} assume 4368 == #t~mem54;havoc #t~mem54; {77074#true} is VALID [2022-04-15 18:21:06,459 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-15 18:21:06,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {77074#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {77074#true} is VALID [2022-04-15 18:21:06,459 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-15 18:21:06,459 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-15 18:21:06,459 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-15 18:21:06,459 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-15 18:21:06,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-15 18:21:06,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-15 18:21:06,460 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-15 18:21:06,460 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-15 18:21:06,460 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-15 18:21:06,460 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-15 18:21:06,460 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-15 18:21:06,460 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-15 18:21:06,460 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-15 18:21:06,460 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-15 18:21:06,460 INFO L290 TraceCheckUtils]: 49: Hoare triple {77074#true} assume 4384 == #t~mem56;havoc #t~mem56; {77074#true} is VALID [2022-04-15 18:21:06,461 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-15 18:21:06,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {77074#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {77074#true} is VALID [2022-04-15 18:21:06,461 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-15 18:21:06,461 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-15 18:21:06,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {77074#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {77074#true} is VALID [2022-04-15 18:21:06,461 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-15 18:21:06,461 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-15 18:21:06,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-15 18:21:06,461 INFO L290 TraceCheckUtils]: 58: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-15 18:21:06,461 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-15 18:21:06,462 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-15 18:21:06,462 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-15 18:21:06,462 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-15 18:21:06,462 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-15 18:21:06,462 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-15 18:21:06,462 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-15 18:21:06,462 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-15 18:21:06,462 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-15 18:21:06,462 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-15 18:21:06,462 INFO L290 TraceCheckUtils]: 69: Hoare triple {77074#true} assume 4400 == #t~mem58;havoc #t~mem58; {77074#true} is VALID [2022-04-15 18:21:06,463 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-15 18:21:06,463 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-15 18:21:06,463 INFO L290 TraceCheckUtils]: 72: Hoare triple {77074#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {77074#true} is VALID [2022-04-15 18:21:06,463 INFO L290 TraceCheckUtils]: 73: Hoare triple {77074#true} assume !(~ret~0 <= 0); {77074#true} is VALID [2022-04-15 18:21:06,463 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-15 18:21:06,463 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-15 18:21:06,463 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-15 18:21:06,463 INFO L290 TraceCheckUtils]: 77: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-15 18:21:06,463 INFO L290 TraceCheckUtils]: 78: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-15 18:21:06,464 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-15 18:21:06,464 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-15 18:21:06,464 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-15 18:21:06,464 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-15 18:21:06,464 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-15 18:21:06,464 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-15 18:21:06,464 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-15 18:21:06,464 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-15 18:21:06,464 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-15 18:21:06,464 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-15 18:21:06,464 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-15 18:21:06,465 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-15 18:21:06,465 INFO L290 TraceCheckUtils]: 91: Hoare triple {77074#true} assume 4416 == #t~mem60;havoc #t~mem60; {77074#true} is VALID [2022-04-15 18:21:06,465 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-15 18:21:06,465 INFO L290 TraceCheckUtils]: 93: Hoare triple {77074#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {77074#true} is VALID [2022-04-15 18:21:06,466 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-15 18:21:06,467 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-15 18:21:06,467 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-15 18:21:06,467 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-15 18:21:06,468 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-15 18:21:06,468 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-15 18:21:06,469 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-15 18:21:06,469 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-15 18:21:06,469 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-15 18:21:06,470 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-15 18:21:06,470 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-15 18:21:06,471 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-15 18:21:06,471 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-15 18:21:06,471 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-15 18:21:06,471 INFO L290 TraceCheckUtils]: 108: Hoare triple {77075#false} assume !(0 == ~blastFlag~0); {77075#false} is VALID [2022-04-15 18:21:06,471 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-15 18:21:06,471 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-15 18:21:06,471 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-15 18:21:06,472 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-15 18:21:06,472 INFO L290 TraceCheckUtils]: 113: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-15 18:21:06,472 INFO L290 TraceCheckUtils]: 114: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-15 18:21:06,472 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-15 18:21:06,472 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-15 18:21:06,472 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-15 18:21:06,472 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-15 18:21:06,472 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-15 18:21:06,472 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-15 18:21:06,472 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-15 18:21:06,473 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-15 18:21:06,473 INFO L290 TraceCheckUtils]: 123: Hoare triple {77075#false} assume 4384 == #t~mem56;havoc #t~mem56; {77075#false} is VALID [2022-04-15 18:21:06,473 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-15 18:21:06,473 INFO L290 TraceCheckUtils]: 125: Hoare triple {77075#false} assume !(1 == ~blastFlag~0); {77075#false} is VALID [2022-04-15 18:21:06,473 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-15 18:21:06,473 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-15 18:21:06,473 INFO L290 TraceCheckUtils]: 128: Hoare triple {77075#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {77075#false} is VALID [2022-04-15 18:21:06,473 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-15 18:21:06,473 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-15 18:21:06,473 INFO L290 TraceCheckUtils]: 131: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-15 18:21:06,474 INFO L290 TraceCheckUtils]: 132: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-15 18:21:06,474 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-15 18:21:06,474 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-15 18:21:06,474 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-15 18:21:06,474 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-15 18:21:06,474 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-15 18:21:06,474 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-15 18:21:06,474 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-15 18:21:06,474 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-15 18:21:06,474 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-15 18:21:06,475 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-15 18:21:06,475 INFO L290 TraceCheckUtils]: 143: Hoare triple {77075#false} assume 4400 == #t~mem58;havoc #t~mem58; {77075#false} is VALID [2022-04-15 18:21:06,475 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-15 18:21:06,475 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-15 18:21:06,475 INFO L290 TraceCheckUtils]: 146: Hoare triple {77075#false} assume !(2 == ~blastFlag~0); {77075#false} is VALID [2022-04-15 18:21:06,475 INFO L290 TraceCheckUtils]: 147: Hoare triple {77075#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {77075#false} is VALID [2022-04-15 18:21:06,475 INFO L290 TraceCheckUtils]: 148: Hoare triple {77075#false} assume !(~ret~0 <= 0); {77075#false} is VALID [2022-04-15 18:21:06,475 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-15 18:21:06,475 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-15 18:21:06,475 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-15 18:21:06,476 INFO L290 TraceCheckUtils]: 152: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-15 18:21:06,476 INFO L290 TraceCheckUtils]: 153: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-15 18:21:06,476 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-15 18:21:06,476 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-15 18:21:06,476 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-15 18:21:06,476 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-15 18:21:06,476 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-15 18:21:06,476 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-15 18:21:06,476 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-15 18:21:06,476 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-15 18:21:06,476 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-15 18:21:06,477 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-15 18:21:06,477 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-15 18:21:06,477 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-15 18:21:06,477 INFO L290 TraceCheckUtils]: 166: Hoare triple {77075#false} assume 4416 == #t~mem60;havoc #t~mem60; {77075#false} is VALID [2022-04-15 18:21:06,477 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-15 18:21:06,477 INFO L290 TraceCheckUtils]: 168: Hoare triple {77075#false} assume !(3 == ~blastFlag~0); {77075#false} is VALID [2022-04-15 18:21:06,477 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-15 18:21:06,477 INFO L290 TraceCheckUtils]: 170: Hoare triple {77075#false} assume !(0 == ~tmp___6~0); {77075#false} is VALID [2022-04-15 18:21:06,477 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-15 18:21:06,478 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-15 18:21:06,478 INFO L290 TraceCheckUtils]: 173: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-15 18:21:06,478 INFO L290 TraceCheckUtils]: 174: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-15 18:21:06,478 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-15 18:21:06,478 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-15 18:21:06,478 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-15 18:21:06,478 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-15 18:21:06,478 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-15 18:21:06,478 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-15 18:21:06,478 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-15 18:21:06,478 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-15 18:21:06,479 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-15 18:21:06,479 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-15 18:21:06,479 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-15 18:21:06,479 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-15 18:21:06,479 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-15 18:21:06,479 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-15 18:21:06,479 INFO L290 TraceCheckUtils]: 189: Hoare triple {77075#false} assume 4432 == #t~mem62;havoc #t~mem62; {77075#false} is VALID [2022-04-15 18:21:06,479 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-15 18:21:06,479 INFO L290 TraceCheckUtils]: 191: Hoare triple {77075#false} assume 5 == ~blastFlag~0; {77075#false} is VALID [2022-04-15 18:21:06,480 INFO L290 TraceCheckUtils]: 192: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-15 18:21:06,480 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-15 18:21:06,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:21:06,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985244883] [2022-04-15 18:21:06,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985244883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:21:06,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:21:06,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:21:06,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:21:06,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [707269987] [2022-04-15 18:21:06,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [707269987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:21:06,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:21:06,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:21:06,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302259477] [2022-04-15 18:21:06,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:21:06,482 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-15 18:21:06,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:21:06,483 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-15 18:21:06,580 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-15 18:21:06,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:21:06,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:21:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:21:06,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:21:06,581 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-15 18:21:08,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:21:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:10,203 INFO L93 Difference]: Finished difference Result 2278 states and 3446 transitions. [2022-04-15 18:21:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:21:10,204 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-15 18:21:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:21:10,204 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-15 18:21:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-15 18:21:10,206 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-15 18:21:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-15 18:21:10,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-15 18:21:10,511 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-15 18:21:10,588 INFO L225 Difference]: With dead ends: 2278 [2022-04-15 18:21:10,589 INFO L226 Difference]: Without dead ends: 1372 [2022-04-15 18:21:10,590 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:21:10,591 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 87 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:21:10,591 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.5s Time] [2022-04-15 18:21:10,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-04-15 18:21:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1091. [2022-04-15 18:21:10,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:21:10,647 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-15 18:21:10,648 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-15 18:21:10,649 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-15 18:21:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:10,707 INFO L93 Difference]: Finished difference Result 1372 states and 2053 transitions. [2022-04-15 18:21:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2053 transitions. [2022-04-15 18:21:10,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:21:10,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:21:10,710 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-15 18:21:10,711 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-15 18:21:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:10,770 INFO L93 Difference]: Finished difference Result 1372 states and 2053 transitions. [2022-04-15 18:21:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2053 transitions. [2022-04-15 18:21:10,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:21:10,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:21:10,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:21:10,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:21:10,773 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-15 18:21:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1660 transitions. [2022-04-15 18:21:10,858 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1660 transitions. Word has length 193 [2022-04-15 18:21:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:21:10,858 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1660 transitions. [2022-04-15 18:21:10,858 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-15 18:21:10,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1660 transitions. [2022-04-15 18:21:12,359 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-15 18:21:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1660 transitions. [2022-04-15 18:21:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-15 18:21:12,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:21:12,361 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-15 18:21:12,361 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 18:21:12,361 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:21:12,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:21:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1223374947, now seen corresponding path program 1 times [2022-04-15 18:21:12,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:21:12,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247168788] [2022-04-15 18:21:26,756 WARN L232 SmtUtils]: Spent 8.72s 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-15 18:21:35,277 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:21:35,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1223374947, now seen corresponding path program 2 times [2022-04-15 18:21:35,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:21:35,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179287434] [2022-04-15 18:21:35,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:21:35,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:21:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:21:35,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:21:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:21:35,501 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-15 18:21:35,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {86568#true} assume true; {86568#true} is VALID [2022-04-15 18:21:35,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86568#true} {86568#true} #593#return; {86568#true} is VALID [2022-04-15 18:21:35,503 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-15 18:21:35,503 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-15 18:21:35,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {86568#true} assume true; {86568#true} is VALID [2022-04-15 18:21:35,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86568#true} {86568#true} #593#return; {86568#true} is VALID [2022-04-15 18:21:35,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {86568#true} call #t~ret158 := main(); {86568#true} is VALID [2022-04-15 18:21:35,503 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-15 18:21:35,503 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-15 18:21:35,503 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-15 18:21:35,504 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-15 18:21:35,504 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-15 18:21:35,504 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-15 18:21:35,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-15 18:21:35,504 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-15 18:21:35,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {86568#true} assume 12292 == #t~mem49;havoc #t~mem49; {86568#true} is VALID [2022-04-15 18:21:35,504 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-15 18:21:35,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {86568#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {86568#true} is VALID [2022-04-15 18:21:35,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {86568#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {86568#true} is VALID [2022-04-15 18:21:35,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {86568#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {86568#true} is VALID [2022-04-15 18:21:35,505 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-15 18:21:35,505 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-15 18:21:35,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {86568#true} assume !(0 == ~tmp___4~0); {86568#true} is VALID [2022-04-15 18:21:35,505 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-15 18:21:35,505 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-15 18:21:35,505 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-15 18:21:35,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-15 18:21:35,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-15 18:21:35,505 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-15 18:21:35,506 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-15 18:21:35,506 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-15 18:21:35,506 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-15 18:21:35,506 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-15 18:21:35,506 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-15 18:21:35,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {86568#true} assume 4368 == #t~mem54;havoc #t~mem54; {86568#true} is VALID [2022-04-15 18:21:35,506 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-15 18:21:35,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {86568#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {86568#true} is VALID [2022-04-15 18:21:35,506 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-15 18:21:35,506 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-15 18:21:35,507 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-15 18:21:35,507 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-15 18:21:35,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-15 18:21:35,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-15 18:21:35,507 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-15 18:21:35,507 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-15 18:21:35,507 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-15 18:21:35,507 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-15 18:21:35,507 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-15 18:21:35,507 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-15 18:21:35,508 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-15 18:21:35,508 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-15 18:21:35,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {86568#true} assume 4384 == #t~mem56;havoc #t~mem56; {86568#true} is VALID [2022-04-15 18:21:35,508 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-15 18:21:35,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {86568#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {86568#true} is VALID [2022-04-15 18:21:35,508 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-15 18:21:35,508 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-15 18:21:35,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {86568#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {86568#true} is VALID [2022-04-15 18:21:35,508 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-15 18:21:35,508 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-15 18:21:35,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-15 18:21:35,509 INFO L290 TraceCheckUtils]: 58: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-15 18:21:35,509 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-15 18:21:35,509 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-15 18:21:35,509 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-15 18:21:35,509 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-15 18:21:35,509 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-15 18:21:35,509 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-15 18:21:35,509 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-15 18:21:35,509 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-15 18:21:35,510 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-15 18:21:35,510 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-15 18:21:35,510 INFO L290 TraceCheckUtils]: 69: Hoare triple {86568#true} assume 4400 == #t~mem58;havoc #t~mem58; {86568#true} is VALID [2022-04-15 18:21:35,510 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-15 18:21:35,510 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-15 18:21:35,510 INFO L290 TraceCheckUtils]: 72: Hoare triple {86568#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {86568#true} is VALID [2022-04-15 18:21:35,510 INFO L290 TraceCheckUtils]: 73: Hoare triple {86568#true} assume !(~ret~0 <= 0); {86568#true} is VALID [2022-04-15 18:21:35,510 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-15 18:21:35,510 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-15 18:21:35,510 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-15 18:21:35,511 INFO L290 TraceCheckUtils]: 77: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-15 18:21:35,511 INFO L290 TraceCheckUtils]: 78: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-15 18:21:35,511 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-15 18:21:35,511 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-15 18:21:35,511 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-15 18:21:35,511 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-15 18:21:35,511 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-15 18:21:35,511 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-15 18:21:35,511 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-15 18:21:35,512 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-15 18:21:35,512 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-15 18:21:35,512 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-15 18:21:35,512 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-15 18:21:35,512 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-15 18:21:35,512 INFO L290 TraceCheckUtils]: 91: Hoare triple {86568#true} assume 4416 == #t~mem60;havoc #t~mem60; {86568#true} is VALID [2022-04-15 18:21:35,512 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-15 18:21:35,512 INFO L290 TraceCheckUtils]: 93: Hoare triple {86568#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {86568#true} is VALID [2022-04-15 18:21:35,513 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-15 18:21:35,514 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-15 18:21:35,514 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-15 18:21:35,515 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-15 18:21:35,515 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-15 18:21:35,516 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-15 18:21:35,516 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-15 18:21:35,516 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-15 18:21:35,517 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-15 18:21:35,517 INFO L290 TraceCheckUtils]: 103: Hoare triple {86569#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {86569#false} is VALID [2022-04-15 18:21:35,517 INFO L290 TraceCheckUtils]: 104: Hoare triple {86569#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {86569#false} is VALID [2022-04-15 18:21:35,517 INFO L290 TraceCheckUtils]: 105: Hoare triple {86569#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {86569#false} is VALID [2022-04-15 18:21:35,517 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-15 18:21:35,517 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-15 18:21:35,518 INFO L290 TraceCheckUtils]: 108: Hoare triple {86569#false} assume !(0 == ~tmp___4~0); {86569#false} is VALID [2022-04-15 18:21:35,518 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-15 18:21:35,518 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-15 18:21:35,518 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-15 18:21:35,518 INFO L290 TraceCheckUtils]: 112: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-15 18:21:35,518 INFO L290 TraceCheckUtils]: 113: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-15 18:21:35,518 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-15 18:21:35,518 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-15 18:21:35,518 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-15 18:21:35,519 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-15 18:21:35,519 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-15 18:21:35,519 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-15 18:21:35,519 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-15 18:21:35,519 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-15 18:21:35,519 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-15 18:21:35,519 INFO L290 TraceCheckUtils]: 123: Hoare triple {86569#false} assume 4385 == #t~mem57;havoc #t~mem57; {86569#false} is VALID [2022-04-15 18:21:35,519 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-15 18:21:35,519 INFO L290 TraceCheckUtils]: 125: Hoare triple {86569#false} assume !(1 == ~blastFlag~0); {86569#false} is VALID [2022-04-15 18:21:35,520 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-15 18:21:35,520 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-15 18:21:35,520 INFO L290 TraceCheckUtils]: 128: Hoare triple {86569#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {86569#false} is VALID [2022-04-15 18:21:35,520 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-15 18:21:35,520 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-15 18:21:35,520 INFO L290 TraceCheckUtils]: 131: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-15 18:21:35,520 INFO L290 TraceCheckUtils]: 132: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-15 18:21:35,520 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-15 18:21:35,520 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-15 18:21:35,520 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-15 18:21:35,521 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-15 18:21:35,521 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-15 18:21:35,521 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-15 18:21:35,521 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-15 18:21:35,521 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-15 18:21:35,521 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-15 18:21:35,521 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-15 18:21:35,521 INFO L290 TraceCheckUtils]: 143: Hoare triple {86569#false} assume 4400 == #t~mem58;havoc #t~mem58; {86569#false} is VALID [2022-04-15 18:21:35,521 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-15 18:21:35,521 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-15 18:21:35,522 INFO L290 TraceCheckUtils]: 146: Hoare triple {86569#false} assume !(2 == ~blastFlag~0); {86569#false} is VALID [2022-04-15 18:21:35,522 INFO L290 TraceCheckUtils]: 147: Hoare triple {86569#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {86569#false} is VALID [2022-04-15 18:21:35,522 INFO L290 TraceCheckUtils]: 148: Hoare triple {86569#false} assume !(~ret~0 <= 0); {86569#false} is VALID [2022-04-15 18:21:35,522 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-15 18:21:35,522 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-15 18:21:35,522 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-15 18:21:35,522 INFO L290 TraceCheckUtils]: 152: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-15 18:21:35,522 INFO L290 TraceCheckUtils]: 153: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-15 18:21:35,522 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-15 18:21:35,522 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-15 18:21:35,523 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-15 18:21:35,523 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-15 18:21:35,523 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-15 18:21:35,523 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-15 18:21:35,523 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-15 18:21:35,523 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-15 18:21:35,523 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-15 18:21:35,523 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-15 18:21:35,524 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-15 18:21:35,524 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-15 18:21:35,524 INFO L290 TraceCheckUtils]: 166: Hoare triple {86569#false} assume 4416 == #t~mem60;havoc #t~mem60; {86569#false} is VALID [2022-04-15 18:21:35,524 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-15 18:21:35,524 INFO L290 TraceCheckUtils]: 168: Hoare triple {86569#false} assume !(3 == ~blastFlag~0); {86569#false} is VALID [2022-04-15 18:21:35,524 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-15 18:21:35,524 INFO L290 TraceCheckUtils]: 170: Hoare triple {86569#false} assume !(0 == ~tmp___6~0); {86569#false} is VALID [2022-04-15 18:21:35,524 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-15 18:21:35,524 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-15 18:21:35,525 INFO L290 TraceCheckUtils]: 173: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-15 18:21:35,525 INFO L290 TraceCheckUtils]: 174: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-15 18:21:35,525 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-15 18:21:35,525 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-15 18:21:35,525 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-15 18:21:35,525 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-15 18:21:35,525 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-15 18:21:35,525 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-15 18:21:35,525 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-15 18:21:35,526 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-15 18:21:35,526 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-15 18:21:35,526 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-15 18:21:35,526 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-15 18:21:35,526 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-15 18:21:35,526 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-15 18:21:35,526 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-15 18:21:35,526 INFO L290 TraceCheckUtils]: 189: Hoare triple {86569#false} assume 4432 == #t~mem62;havoc #t~mem62; {86569#false} is VALID [2022-04-15 18:21:35,526 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-15 18:21:35,526 INFO L290 TraceCheckUtils]: 191: Hoare triple {86569#false} assume 5 == ~blastFlag~0; {86569#false} is VALID [2022-04-15 18:21:35,527 INFO L290 TraceCheckUtils]: 192: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-15 18:21:35,527 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-15 18:21:35,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:21:35,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179287434] [2022-04-15 18:21:35,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179287434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:21:35,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:21:35,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:21:35,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:21:35,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247168788] [2022-04-15 18:21:35,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247168788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:21:35,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:21:35,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:21:35,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182100231] [2022-04-15 18:21:35,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:21:35,529 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-15 18:21:35,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:21:35,530 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-15 18:21:35,628 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-15 18:21:35,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:21:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:21:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:21:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:21:35,629 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-15 18:21:37,652 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:21:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:39,284 INFO L93 Difference]: Finished difference Result 2447 states and 3693 transitions. [2022-04-15 18:21:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:21:39,284 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-15 18:21:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:21:39,285 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-15 18:21:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-15 18:21:39,288 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-15 18:21:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-15 18:21:39,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-15 18:21:39,600 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-15 18:21:39,679 INFO L225 Difference]: With dead ends: 2447 [2022-04-15 18:21:39,679 INFO L226 Difference]: Without dead ends: 1372 [2022-04-15 18:21:39,681 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:21:39,682 INFO L913 BasicCegarLoop]: 223 mSDtfsCounter, 90 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:21:39,682 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.5s Time] [2022-04-15 18:21:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-04-15 18:21:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1091. [2022-04-15 18:21:39,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:21:39,754 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-15 18:21:39,754 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-15 18:21:39,755 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-15 18:21:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:39,803 INFO L93 Difference]: Finished difference Result 1372 states and 2048 transitions. [2022-04-15 18:21:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2048 transitions. [2022-04-15 18:21:39,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:21:39,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:21:39,806 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-15 18:21:39,807 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-15 18:21:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:39,867 INFO L93 Difference]: Finished difference Result 1372 states and 2048 transitions. [2022-04-15 18:21:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2048 transitions. [2022-04-15 18:21:39,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:21:39,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:21:39,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:21:39,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:21:39,870 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-15 18:21:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1655 transitions. [2022-04-15 18:21:39,929 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1655 transitions. Word has length 193 [2022-04-15 18:21:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:21:39,929 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1655 transitions. [2022-04-15 18:21:39,929 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-15 18:21:39,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1655 transitions. [2022-04-15 18:21:41,481 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-15 18:21:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1655 transitions. [2022-04-15 18:21:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-15 18:21:41,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:21:41,483 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-15 18:21:41,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 18:21:41,483 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:21:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:21:41,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1166019930, now seen corresponding path program 1 times [2022-04-15 18:21:41,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:21:41,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2104614748] [2022-04-15 18:21:53,371 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-15 18:22:07,533 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:22:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1166019930, now seen corresponding path program 2 times [2022-04-15 18:22:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:22:07,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080759292] [2022-04-15 18:22:07,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:22:07,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:22:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:07,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:22:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:07,759 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-15 18:22:07,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {96400#true} assume true; {96400#true} is VALID [2022-04-15 18:22:07,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96400#true} {96400#true} #593#return; {96400#true} is VALID [2022-04-15 18:22:07,760 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-15 18:22:07,760 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-15 18:22:07,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {96400#true} assume true; {96400#true} is VALID [2022-04-15 18:22:07,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96400#true} {96400#true} #593#return; {96400#true} is VALID [2022-04-15 18:22:07,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {96400#true} call #t~ret158 := main(); {96400#true} is VALID [2022-04-15 18:22:07,761 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-15 18:22:07,761 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-15 18:22:07,761 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-15 18:22:07,761 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-15 18:22:07,761 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-15 18:22:07,761 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-15 18:22:07,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-15 18:22:07,762 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-15 18:22:07,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {96400#true} assume 12292 == #t~mem49;havoc #t~mem49; {96400#true} is VALID [2022-04-15 18:22:07,762 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-15 18:22:07,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {96400#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {96400#true} is VALID [2022-04-15 18:22:07,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {96400#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {96400#true} is VALID [2022-04-15 18:22:07,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {96400#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {96400#true} is VALID [2022-04-15 18:22:07,762 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-15 18:22:07,762 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-15 18:22:07,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {96400#true} assume !(0 == ~tmp___4~0); {96400#true} is VALID [2022-04-15 18:22:07,763 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-15 18:22:07,763 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-15 18:22:07,763 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-15 18:22:07,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-15 18:22:07,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-15 18:22:07,763 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-15 18:22:07,763 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-15 18:22:07,763 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-15 18:22:07,763 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-15 18:22:07,763 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-15 18:22:07,764 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-15 18:22:07,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {96400#true} assume 4368 == #t~mem54;havoc #t~mem54; {96400#true} is VALID [2022-04-15 18:22:07,764 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-15 18:22:07,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {96400#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96400#true} is VALID [2022-04-15 18:22:07,764 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-15 18:22:07,764 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-15 18:22:07,764 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-15 18:22:07,764 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-15 18:22:07,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-15 18:22:07,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-15 18:22:07,765 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-15 18:22:07,765 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-15 18:22:07,765 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-15 18:22:07,765 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-15 18:22:07,765 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-15 18:22:07,765 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-15 18:22:07,765 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-15 18:22:07,765 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-15 18:22:07,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {96400#true} assume 4384 == #t~mem56;havoc #t~mem56; {96400#true} is VALID [2022-04-15 18:22:07,765 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-15 18:22:07,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {96400#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {96400#true} is VALID [2022-04-15 18:22:07,766 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-15 18:22:07,766 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-15 18:22:07,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {96400#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96400#true} is VALID [2022-04-15 18:22:07,766 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-15 18:22:07,766 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-15 18:22:07,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-15 18:22:07,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-15 18:22:07,766 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-15 18:22:07,766 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-15 18:22:07,766 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-15 18:22:07,766 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-15 18:22:07,767 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-15 18:22:07,767 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-15 18:22:07,767 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-15 18:22:07,767 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-15 18:22:07,767 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-15 18:22:07,767 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-15 18:22:07,767 INFO L290 TraceCheckUtils]: 69: Hoare triple {96400#true} assume 4400 == #t~mem58;havoc #t~mem58; {96400#true} is VALID [2022-04-15 18:22:07,767 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-15 18:22:07,768 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-15 18:22:07,768 INFO L290 TraceCheckUtils]: 72: Hoare triple {96400#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {96400#true} is VALID [2022-04-15 18:22:07,768 INFO L290 TraceCheckUtils]: 73: Hoare triple {96400#true} assume !(~ret~0 <= 0); {96400#true} is VALID [2022-04-15 18:22:07,768 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-15 18:22:07,768 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-15 18:22:07,768 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-15 18:22:07,768 INFO L290 TraceCheckUtils]: 77: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-15 18:22:07,768 INFO L290 TraceCheckUtils]: 78: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-15 18:22:07,768 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-15 18:22:07,768 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-15 18:22:07,769 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-15 18:22:07,769 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-15 18:22:07,769 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-15 18:22:07,769 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-15 18:22:07,769 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-15 18:22:07,769 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-15 18:22:07,769 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-15 18:22:07,769 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-15 18:22:07,769 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-15 18:22:07,770 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-15 18:22:07,770 INFO L290 TraceCheckUtils]: 91: Hoare triple {96400#true} assume 4416 == #t~mem60;havoc #t~mem60; {96400#true} is VALID [2022-04-15 18:22:07,770 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-15 18:22:07,770 INFO L290 TraceCheckUtils]: 93: Hoare triple {96400#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {96400#true} is VALID [2022-04-15 18:22:07,771 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-15 18:22:07,772 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-15 18:22:07,772 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-15 18:22:07,773 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-15 18:22:07,773 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-15 18:22:07,773 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-15 18:22:07,774 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-15 18:22:07,774 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-15 18:22:07,774 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-15 18:22:07,775 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-15 18:22:07,775 INFO L290 TraceCheckUtils]: 104: Hoare triple {96401#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {96401#false} is VALID [2022-04-15 18:22:07,775 INFO L290 TraceCheckUtils]: 105: Hoare triple {96401#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {96401#false} is VALID [2022-04-15 18:22:07,775 INFO L290 TraceCheckUtils]: 106: Hoare triple {96401#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {96401#false} is VALID [2022-04-15 18:22:07,775 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-15 18:22:07,775 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-15 18:22:07,775 INFO L290 TraceCheckUtils]: 109: Hoare triple {96401#false} assume !(0 == ~tmp___4~0); {96401#false} is VALID [2022-04-15 18:22:07,775 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-15 18:22:07,775 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-15 18:22:07,776 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-15 18:22:07,776 INFO L290 TraceCheckUtils]: 113: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-15 18:22:07,776 INFO L290 TraceCheckUtils]: 114: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-15 18:22:07,776 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-15 18:22:07,776 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-15 18:22:07,776 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-15 18:22:07,776 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-15 18:22:07,776 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-15 18:22:07,777 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-15 18:22:07,777 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-15 18:22:07,777 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-15 18:22:07,777 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-15 18:22:07,777 INFO L290 TraceCheckUtils]: 124: Hoare triple {96401#false} assume 4385 == #t~mem57;havoc #t~mem57; {96401#false} is VALID [2022-04-15 18:22:07,777 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-15 18:22:07,777 INFO L290 TraceCheckUtils]: 126: Hoare triple {96401#false} assume !(1 == ~blastFlag~0); {96401#false} is VALID [2022-04-15 18:22:07,777 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-15 18:22:07,778 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-15 18:22:07,778 INFO L290 TraceCheckUtils]: 129: Hoare triple {96401#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96401#false} is VALID [2022-04-15 18:22:07,778 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-15 18:22:07,778 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-15 18:22:07,778 INFO L290 TraceCheckUtils]: 132: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-15 18:22:07,778 INFO L290 TraceCheckUtils]: 133: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-15 18:22:07,778 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-15 18:22:07,778 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-15 18:22:07,778 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-15 18:22:07,779 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-15 18:22:07,779 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-15 18:22:07,779 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-15 18:22:07,779 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-15 18:22:07,779 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-15 18:22:07,779 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-15 18:22:07,779 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-15 18:22:07,779 INFO L290 TraceCheckUtils]: 144: Hoare triple {96401#false} assume 4400 == #t~mem58;havoc #t~mem58; {96401#false} is VALID [2022-04-15 18:22:07,779 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-15 18:22:07,779 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-15 18:22:07,780 INFO L290 TraceCheckUtils]: 147: Hoare triple {96401#false} assume !(2 == ~blastFlag~0); {96401#false} is VALID [2022-04-15 18:22:07,780 INFO L290 TraceCheckUtils]: 148: Hoare triple {96401#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {96401#false} is VALID [2022-04-15 18:22:07,780 INFO L290 TraceCheckUtils]: 149: Hoare triple {96401#false} assume !(~ret~0 <= 0); {96401#false} is VALID [2022-04-15 18:22:07,780 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-15 18:22:07,780 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-15 18:22:07,780 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-15 18:22:07,780 INFO L290 TraceCheckUtils]: 153: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-15 18:22:07,780 INFO L290 TraceCheckUtils]: 154: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-15 18:22:07,780 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-15 18:22:07,780 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-15 18:22:07,781 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-15 18:22:07,781 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-15 18:22:07,781 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-15 18:22:07,781 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-15 18:22:07,781 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-15 18:22:07,781 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-15 18:22:07,781 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-15 18:22:07,781 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-15 18:22:07,781 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-15 18:22:07,781 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-15 18:22:07,782 INFO L290 TraceCheckUtils]: 167: Hoare triple {96401#false} assume 4416 == #t~mem60;havoc #t~mem60; {96401#false} is VALID [2022-04-15 18:22:07,782 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-15 18:22:07,782 INFO L290 TraceCheckUtils]: 169: Hoare triple {96401#false} assume !(3 == ~blastFlag~0); {96401#false} is VALID [2022-04-15 18:22:07,782 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-15 18:22:07,782 INFO L290 TraceCheckUtils]: 171: Hoare triple {96401#false} assume !(0 == ~tmp___6~0); {96401#false} is VALID [2022-04-15 18:22:07,782 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-15 18:22:07,782 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-15 18:22:07,782 INFO L290 TraceCheckUtils]: 174: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-15 18:22:07,782 INFO L290 TraceCheckUtils]: 175: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-15 18:22:07,783 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-15 18:22:07,783 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-15 18:22:07,783 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-15 18:22:07,783 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-15 18:22:07,783 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-15 18:22:07,783 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-15 18:22:07,783 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-15 18:22:07,783 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-15 18:22:07,783 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-15 18:22:07,784 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-15 18:22:07,784 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-15 18:22:07,784 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-15 18:22:07,784 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-15 18:22:07,784 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-15 18:22:07,784 INFO L290 TraceCheckUtils]: 190: Hoare triple {96401#false} assume 4432 == #t~mem62;havoc #t~mem62; {96401#false} is VALID [2022-04-15 18:22:07,784 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-15 18:22:07,784 INFO L290 TraceCheckUtils]: 192: Hoare triple {96401#false} assume 5 == ~blastFlag~0; {96401#false} is VALID [2022-04-15 18:22:07,784 INFO L290 TraceCheckUtils]: 193: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-15 18:22:07,785 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-15 18:22:07,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:22:07,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080759292] [2022-04-15 18:22:07,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080759292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:22:07,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:22:07,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:22:07,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:22:07,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2104614748] [2022-04-15 18:22:07,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2104614748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:22:07,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:22:07,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:22:07,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465366893] [2022-04-15 18:22:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:22:07,787 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-15 18:22:07,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:22:07,787 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-15 18:22:07,896 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-15 18:22:07,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:22:07,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:22:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:22:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:22:07,897 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-15 18:22:09,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:22:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:11,555 INFO L93 Difference]: Finished difference Result 2447 states and 3683 transitions. [2022-04-15 18:22:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:22:11,555 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-15 18:22:11,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:22:11,556 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-15 18:22:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-15 18:22:11,558 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-15 18:22:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-15 18:22:11,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-15 18:22:11,873 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-15 18:22:11,942 INFO L225 Difference]: With dead ends: 2447 [2022-04-15 18:22:11,942 INFO L226 Difference]: Without dead ends: 1372 [2022-04-15 18:22:11,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:22:11,945 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 88 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:22:11,945 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.5s Time] [2022-04-15 18:22:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-04-15 18:22:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1091. [2022-04-15 18:22:12,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:22:12,013 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-15 18:22:12,027 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-15 18:22:12,028 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-15 18:22:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:12,087 INFO L93 Difference]: Finished difference Result 1372 states and 2043 transitions. [2022-04-15 18:22:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2043 transitions. [2022-04-15 18:22:12,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:22:12,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:22:12,090 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-15 18:22:12,090 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-15 18:22:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:12,137 INFO L93 Difference]: Finished difference Result 1372 states and 2043 transitions. [2022-04-15 18:22:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2043 transitions. [2022-04-15 18:22:12,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:22:12,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:22:12,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:22:12,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:22:12,140 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-15 18:22:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1650 transitions. [2022-04-15 18:22:12,186 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1650 transitions. Word has length 194 [2022-04-15 18:22:12,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:22:12,186 INFO L478 AbstractCegarLoop]: Abstraction has 1091 states and 1650 transitions. [2022-04-15 18:22:12,186 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-15 18:22:12,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1650 transitions. [2022-04-15 18:22:13,749 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-15 18:22:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1650 transitions. [2022-04-15 18:22:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-15 18:22:13,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:22:13,751 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-15 18:22:13,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 18:22:13,751 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:22:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:22:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 164938377, now seen corresponding path program 1 times [2022-04-15 18:22:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:22:13,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1799509383] [2022-04-15 18:22:27,817 WARN L232 SmtUtils]: Spent 8.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-15 18:22:37,537 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:22:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash 164938377, now seen corresponding path program 2 times [2022-04-15 18:22:37,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:22:37,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066860405] [2022-04-15 18:22:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:22:37,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:22:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:37,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:22:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:37,739 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-15 18:22:37,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {106232#true} assume true; {106232#true} is VALID [2022-04-15 18:22:37,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106232#true} {106232#true} #593#return; {106232#true} is VALID [2022-04-15 18:22:37,740 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-15 18:22:37,741 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-15 18:22:37,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {106232#true} assume true; {106232#true} is VALID [2022-04-15 18:22:37,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106232#true} {106232#true} #593#return; {106232#true} is VALID [2022-04-15 18:22:37,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {106232#true} call #t~ret158 := main(); {106232#true} is VALID [2022-04-15 18:22:37,741 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-15 18:22:37,741 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-15 18:22:37,741 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-15 18:22:37,741 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-15 18:22:37,741 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-15 18:22:37,742 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-15 18:22:37,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-15 18:22:37,742 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-15 18:22:37,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {106232#true} assume 12292 == #t~mem49;havoc #t~mem49; {106232#true} is VALID [2022-04-15 18:22:37,742 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-15 18:22:37,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {106232#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {106232#true} is VALID [2022-04-15 18:22:37,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {106232#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {106232#true} is VALID [2022-04-15 18:22:37,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {106232#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {106232#true} is VALID [2022-04-15 18:22:37,742 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-15 18:22:37,742 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-15 18:22:37,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {106232#true} assume !(0 == ~tmp___4~0); {106232#true} is VALID [2022-04-15 18:22:37,743 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-15 18:22:37,743 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-15 18:22:37,743 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-15 18:22:37,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-15 18:22:37,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-15 18:22:37,743 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-15 18:22:37,743 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-15 18:22:37,743 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-15 18:22:37,743 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-15 18:22:37,743 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-15 18:22:37,744 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-15 18:22:37,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {106232#true} assume 4368 == #t~mem54;havoc #t~mem54; {106232#true} is VALID [2022-04-15 18:22:37,744 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-15 18:22:37,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {106232#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {106232#true} is VALID [2022-04-15 18:22:37,744 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-15 18:22:37,744 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-15 18:22:37,744 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-15 18:22:37,744 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-15 18:22:37,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-15 18:22:37,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-15 18:22:37,745 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-15 18:22:37,745 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-15 18:22:37,745 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-15 18:22:37,745 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-15 18:22:37,745 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-15 18:22:37,745 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-15 18:22:37,745 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-15 18:22:37,745 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-15 18:22:37,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {106232#true} assume 4384 == #t~mem56;havoc #t~mem56; {106232#true} is VALID [2022-04-15 18:22:37,745 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-15 18:22:37,745 INFO L290 TraceCheckUtils]: 51: Hoare triple {106232#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {106232#true} is VALID [2022-04-15 18:22:37,746 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-15 18:22:37,746 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-15 18:22:37,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {106232#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {106232#true} is VALID [2022-04-15 18:22:37,746 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-15 18:22:37,746 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-15 18:22:37,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-15 18:22:37,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-15 18:22:37,746 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-15 18:22:37,746 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-15 18:22:37,746 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-15 18:22:37,746 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-15 18:22:37,747 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-15 18:22:37,747 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-15 18:22:37,747 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-15 18:22:37,747 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-15 18:22:37,747 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-15 18:22:37,747 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-15 18:22:37,747 INFO L290 TraceCheckUtils]: 69: Hoare triple {106232#true} assume 4400 == #t~mem58;havoc #t~mem58; {106232#true} is VALID [2022-04-15 18:22:37,747 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-15 18:22:37,747 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-15 18:22:37,747 INFO L290 TraceCheckUtils]: 72: Hoare triple {106232#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {106232#true} is VALID [2022-04-15 18:22:37,748 INFO L290 TraceCheckUtils]: 73: Hoare triple {106232#true} assume !(~ret~0 <= 0); {106232#true} is VALID [2022-04-15 18:22:37,748 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-15 18:22:37,748 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-15 18:22:37,748 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-15 18:22:37,748 INFO L290 TraceCheckUtils]: 77: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-15 18:22:37,748 INFO L290 TraceCheckUtils]: 78: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-15 18:22:37,748 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-15 18:22:37,748 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-15 18:22:37,748 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-15 18:22:37,778 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-15 18:22:37,778 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-15 18:22:37,778 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-15 18:22:37,779 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-15 18:22:37,779 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-15 18:22:37,779 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-15 18:22:37,779 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-15 18:22:37,779 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-15 18:22:37,779 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-15 18:22:37,779 INFO L290 TraceCheckUtils]: 91: Hoare triple {106232#true} assume 4416 == #t~mem60;havoc #t~mem60; {106232#true} is VALID [2022-04-15 18:22:37,779 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-15 18:22:37,779 INFO L290 TraceCheckUtils]: 93: Hoare triple {106232#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {106232#true} is VALID [2022-04-15 18:22:37,782 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-15 18:22:37,782 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-15 18:22:37,783 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-15 18:22:37,783 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-15 18:22:37,784 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-15 18:22:37,784 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-15 18:22:37,785 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-15 18:22:37,785 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-15 18:22:37,785 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-15 18:22:37,786 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-15 18:22:37,786 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-15 18:22:37,787 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-15 18:22:37,787 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-15 18:22:37,787 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-15 18:22:37,788 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-15 18:22:37,788 INFO L290 TraceCheckUtils]: 109: Hoare triple {106233#false} assume !(0 == ~blastFlag~0); {106233#false} is VALID [2022-04-15 18:22:37,788 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-15 18:22:37,788 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-15 18:22:37,788 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-15 18:22:37,788 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-15 18:22:37,788 INFO L290 TraceCheckUtils]: 114: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-15 18:22:37,788 INFO L290 TraceCheckUtils]: 115: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-15 18:22:37,788 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-15 18:22:37,788 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-15 18:22:37,789 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-15 18:22:37,789 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-15 18:22:37,789 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-15 18:22:37,789 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-15 18:22:37,789 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-15 18:22:37,789 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-15 18:22:37,789 INFO L290 TraceCheckUtils]: 124: Hoare triple {106233#false} assume 4384 == #t~mem56;havoc #t~mem56; {106233#false} is VALID [2022-04-15 18:22:37,789 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-15 18:22:37,789 INFO L290 TraceCheckUtils]: 126: Hoare triple {106233#false} assume !(1 == ~blastFlag~0); {106233#false} is VALID [2022-04-15 18:22:37,789 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-15 18:22:37,789 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-15 18:22:37,790 INFO L290 TraceCheckUtils]: 129: Hoare triple {106233#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {106233#false} is VALID [2022-04-15 18:22:37,790 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-15 18:22:37,790 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-15 18:22:37,790 INFO L290 TraceCheckUtils]: 132: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-15 18:22:37,790 INFO L290 TraceCheckUtils]: 133: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-15 18:22:37,790 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-15 18:22:37,790 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-15 18:22:37,790 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-15 18:22:37,790 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-15 18:22:37,790 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-15 18:22:37,791 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-15 18:22:37,791 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-15 18:22:37,791 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-15 18:22:37,791 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-15 18:22:37,791 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-15 18:22:37,791 INFO L290 TraceCheckUtils]: 144: Hoare triple {106233#false} assume 4400 == #t~mem58;havoc #t~mem58; {106233#false} is VALID [2022-04-15 18:22:37,791 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-15 18:22:37,791 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-15 18:22:37,791 INFO L290 TraceCheckUtils]: 147: Hoare triple {106233#false} assume !(2 == ~blastFlag~0); {106233#false} is VALID [2022-04-15 18:22:37,791 INFO L290 TraceCheckUtils]: 148: Hoare triple {106233#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {106233#false} is VALID [2022-04-15 18:22:37,792 INFO L290 TraceCheckUtils]: 149: Hoare triple {106233#false} assume !(~ret~0 <= 0); {106233#false} is VALID [2022-04-15 18:22:37,792 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-15 18:22:37,792 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-15 18:22:37,792 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-15 18:22:37,792 INFO L290 TraceCheckUtils]: 153: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-15 18:22:37,792 INFO L290 TraceCheckUtils]: 154: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-15 18:22:37,792 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-15 18:22:37,792 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-15 18:22:37,792 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-15 18:22:37,792 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-15 18:22:37,792 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-15 18:22:37,793 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-15 18:22:37,793 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-15 18:22:37,793 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-15 18:22:37,793 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-15 18:22:37,793 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-15 18:22:37,793 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-15 18:22:37,793 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-15 18:22:37,793 INFO L290 TraceCheckUtils]: 167: Hoare triple {106233#false} assume 4416 == #t~mem60;havoc #t~mem60; {106233#false} is VALID [2022-04-15 18:22:37,793 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-15 18:22:37,793 INFO L290 TraceCheckUtils]: 169: Hoare triple {106233#false} assume !(3 == ~blastFlag~0); {106233#false} is VALID [2022-04-15 18:22:37,793 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-15 18:22:37,794 INFO L290 TraceCheckUtils]: 171: Hoare triple {106233#false} assume !(0 == ~tmp___6~0); {106233#false} is VALID [2022-04-15 18:22:37,794 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-15 18:22:37,794 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-15 18:22:37,794 INFO L290 TraceCheckUtils]: 174: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-15 18:22:37,794 INFO L290 TraceCheckUtils]: 175: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-15 18:22:37,794 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-15 18:22:37,794 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-15 18:22:37,794 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-15 18:22:37,794 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-15 18:22:37,794 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-15 18:22:37,795 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-15 18:22:37,795 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-15 18:22:37,795 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-15 18:22:37,795 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-15 18:22:37,795 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-15 18:22:37,795 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-15 18:22:37,795 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-15 18:22:37,795 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-15 18:22:37,795 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-15 18:22:37,796 INFO L290 TraceCheckUtils]: 190: Hoare triple {106233#false} assume 4432 == #t~mem62;havoc #t~mem62; {106233#false} is VALID [2022-04-15 18:22:37,796 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-15 18:22:37,796 INFO L290 TraceCheckUtils]: 192: Hoare triple {106233#false} assume 5 == ~blastFlag~0; {106233#false} is VALID [2022-04-15 18:22:37,796 INFO L290 TraceCheckUtils]: 193: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-15 18:22:37,796 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-15 18:22:37,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:22:37,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066860405] [2022-04-15 18:22:37,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066860405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:22:37,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:22:37,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:22:37,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:22:37,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1799509383] [2022-04-15 18:22:37,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1799509383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:22:37,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:22:37,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:22:37,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102250683] [2022-04-15 18:22:37,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:22:37,798 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-15 18:22:37,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:22:37,799 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-15 18:22:37,905 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-15 18:22:37,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:22:37,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:22:37,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:22:37,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:22:37,906 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-15 18:22:39,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:22:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:41,538 INFO L93 Difference]: Finished difference Result 2524 states and 3784 transitions. [2022-04-15 18:22:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:22:41,539 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-15 18:22:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:22:41,539 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-15 18:22:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:22:41,541 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-15 18:22:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:22:41,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 18:22:41,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:22:41,976 INFO L225 Difference]: With dead ends: 2524 [2022-04-15 18:22:41,977 INFO L226 Difference]: Without dead ends: 1618 [2022-04-15 18:22:41,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:22:41,978 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 112 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:22:41,978 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.5s Time] [2022-04-15 18:22:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2022-04-15 18:22:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1193. [2022-04-15 18:22:42,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:22:42,065 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-15 18:22:42,066 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-15 18:22:42,067 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-15 18:22:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:42,142 INFO L93 Difference]: Finished difference Result 1618 states and 2387 transitions. [2022-04-15 18:22:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2387 transitions. [2022-04-15 18:22:42,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:22:42,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:22:42,145 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-15 18:22:42,146 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-15 18:22:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:42,226 INFO L93 Difference]: Finished difference Result 1618 states and 2387 transitions. [2022-04-15 18:22:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2387 transitions. [2022-04-15 18:22:42,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:22:42,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:22:42,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:22:42,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:22:42,229 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-15 18:22:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1797 transitions. [2022-04-15 18:22:42,298 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1797 transitions. Word has length 194 [2022-04-15 18:22:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:22:42,298 INFO L478 AbstractCegarLoop]: Abstraction has 1193 states and 1797 transitions. [2022-04-15 18:22:42,299 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-15 18:22:42,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1193 states and 1797 transitions. [2022-04-15 18:22:44,011 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-15 18:22:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1797 transitions. [2022-04-15 18:22:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-15 18:22:44,013 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:22:44,014 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-15 18:22:44,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 18:22:44,014 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:22:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:22:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1168473336, now seen corresponding path program 1 times [2022-04-15 18:22:44,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:22:44,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1793524375] [2022-04-15 18:22:58,661 WARN L232 SmtUtils]: Spent 9.29s 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-15 18:23:08,700 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:23:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1168473336, now seen corresponding path program 2 times [2022-04-15 18:23:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:23:08,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047919109] [2022-04-15 18:23:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:23:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:23:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:23:08,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:23:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:23:08,929 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-15 18:23:08,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {116914#true} assume true; {116914#true} is VALID [2022-04-15 18:23:08,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116914#true} {116914#true} #593#return; {116914#true} is VALID [2022-04-15 18:23:08,930 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-15 18:23:08,930 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-15 18:23:08,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {116914#true} assume true; {116914#true} is VALID [2022-04-15 18:23:08,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116914#true} {116914#true} #593#return; {116914#true} is VALID [2022-04-15 18:23:08,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {116914#true} call #t~ret158 := main(); {116914#true} is VALID [2022-04-15 18:23:08,931 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-15 18:23:08,931 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-15 18:23:08,931 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-15 18:23:08,931 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-15 18:23:08,931 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-15 18:23:08,931 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-15 18:23:08,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-15 18:23:08,932 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-15 18:23:08,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {116914#true} assume 12292 == #t~mem49;havoc #t~mem49; {116914#true} is VALID [2022-04-15 18:23:08,932 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-15 18:23:08,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {116914#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {116914#true} is VALID [2022-04-15 18:23:08,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {116914#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {116914#true} is VALID [2022-04-15 18:23:08,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {116914#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116914#true} is VALID [2022-04-15 18:23:08,932 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-15 18:23:08,932 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-15 18:23:08,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {116914#true} assume !(0 == ~tmp___4~0); {116914#true} is VALID [2022-04-15 18:23:08,932 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-15 18:23:08,933 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-15 18:23:08,933 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-15 18:23:08,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-15 18:23:08,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-15 18:23:08,933 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-15 18:23:08,933 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-15 18:23:08,933 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-15 18:23:08,933 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-15 18:23:08,933 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-15 18:23:08,933 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-15 18:23:08,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {116914#true} assume 4368 == #t~mem54;havoc #t~mem54; {116914#true} is VALID [2022-04-15 18:23:08,934 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-15 18:23:08,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {116914#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116914#true} is VALID [2022-04-15 18:23:08,934 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-15 18:23:08,934 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-15 18:23:08,934 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-15 18:23:08,934 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-15 18:23:08,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-15 18:23:08,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-15 18:23:08,934 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-15 18:23:08,934 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-15 18:23:08,935 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-15 18:23:08,935 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-15 18:23:08,935 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-15 18:23:08,935 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-15 18:23:08,935 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-15 18:23:08,935 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-15 18:23:08,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {116914#true} assume 4384 == #t~mem56;havoc #t~mem56; {116914#true} is VALID [2022-04-15 18:23:08,935 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-15 18:23:08,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {116914#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116914#true} is VALID [2022-04-15 18:23:08,935 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-15 18:23:08,935 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-15 18:23:08,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {116914#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {116914#true} is VALID [2022-04-15 18:23:08,936 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-15 18:23:08,936 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-15 18:23:08,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-15 18:23:08,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-15 18:23:08,936 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-15 18:23:08,936 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-15 18:23:08,936 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-15 18:23:08,936 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-15 18:23:08,936 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-15 18:23:08,937 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-15 18:23:08,937 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-15 18:23:08,937 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-15 18:23:08,937 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-15 18:23:08,937 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-15 18:23:08,937 INFO L290 TraceCheckUtils]: 69: Hoare triple {116914#true} assume 4400 == #t~mem58;havoc #t~mem58; {116914#true} is VALID [2022-04-15 18:23:08,937 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-15 18:23:08,937 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-15 18:23:08,937 INFO L290 TraceCheckUtils]: 72: Hoare triple {116914#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116914#true} is VALID [2022-04-15 18:23:08,937 INFO L290 TraceCheckUtils]: 73: Hoare triple {116914#true} assume !(~ret~0 <= 0); {116914#true} is VALID [2022-04-15 18:23:08,937 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-15 18:23:08,938 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-15 18:23:08,938 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-15 18:23:08,938 INFO L290 TraceCheckUtils]: 77: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-15 18:23:08,938 INFO L290 TraceCheckUtils]: 78: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-15 18:23:08,938 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-15 18:23:08,938 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-15 18:23:08,938 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-15 18:23:08,938 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-15 18:23:08,938 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-15 18:23:08,938 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-15 18:23:08,939 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-15 18:23:08,939 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-15 18:23:08,939 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-15 18:23:08,939 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-15 18:23:08,939 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-15 18:23:08,939 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-15 18:23:08,939 INFO L290 TraceCheckUtils]: 91: Hoare triple {116914#true} assume 4416 == #t~mem60;havoc #t~mem60; {116914#true} is VALID [2022-04-15 18:23:08,939 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-15 18:23:08,939 INFO L290 TraceCheckUtils]: 93: Hoare triple {116914#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116914#true} is VALID [2022-04-15 18:23:08,940 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-15 18:23:08,941 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-15 18:23:08,941 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-15 18:23:08,942 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-15 18:23:08,942 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-15 18:23:08,943 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-15 18:23:08,943 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-15 18:23:08,943 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-15 18:23:08,944 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-15 18:23:08,944 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-15 18:23:08,945 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-15 18:23:08,945 INFO L290 TraceCheckUtils]: 105: Hoare triple {116915#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {116915#false} is VALID [2022-04-15 18:23:08,945 INFO L290 TraceCheckUtils]: 106: Hoare triple {116915#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {116915#false} is VALID [2022-04-15 18:23:08,945 INFO L290 TraceCheckUtils]: 107: Hoare triple {116915#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116915#false} is VALID [2022-04-15 18:23:08,945 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-15 18:23:08,945 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-15 18:23:08,945 INFO L290 TraceCheckUtils]: 110: Hoare triple {116915#false} assume !(0 == ~tmp___4~0); {116915#false} is VALID [2022-04-15 18:23:08,945 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-15 18:23:08,945 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-15 18:23:08,945 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-15 18:23:08,946 INFO L290 TraceCheckUtils]: 114: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-15 18:23:08,946 INFO L290 TraceCheckUtils]: 115: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-15 18:23:08,946 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-15 18:23:08,946 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-15 18:23:08,946 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-15 18:23:08,946 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-15 18:23:08,946 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-15 18:23:08,946 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-15 18:23:08,946 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-15 18:23:08,946 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-15 18:23:08,946 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-15 18:23:08,947 INFO L290 TraceCheckUtils]: 125: Hoare triple {116915#false} assume 4385 == #t~mem57;havoc #t~mem57; {116915#false} is VALID [2022-04-15 18:23:08,947 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-15 18:23:08,947 INFO L290 TraceCheckUtils]: 127: Hoare triple {116915#false} assume !(1 == ~blastFlag~0); {116915#false} is VALID [2022-04-15 18:23:08,947 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-15 18:23:08,947 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-15 18:23:08,947 INFO L290 TraceCheckUtils]: 130: Hoare triple {116915#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {116915#false} is VALID [2022-04-15 18:23:08,947 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-15 18:23:08,947 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-15 18:23:08,947 INFO L290 TraceCheckUtils]: 133: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-15 18:23:08,947 INFO L290 TraceCheckUtils]: 134: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-15 18:23:08,947 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-15 18:23:08,948 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-15 18:23:08,948 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-15 18:23:08,948 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-15 18:23:08,948 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-15 18:23:08,948 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-15 18:23:08,948 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-15 18:23:08,948 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-15 18:23:08,948 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-15 18:23:08,948 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-15 18:23:08,948 INFO L290 TraceCheckUtils]: 145: Hoare triple {116915#false} assume 4400 == #t~mem58;havoc #t~mem58; {116915#false} is VALID [2022-04-15 18:23:08,949 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-15 18:23:08,949 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-15 18:23:08,949 INFO L290 TraceCheckUtils]: 148: Hoare triple {116915#false} assume !(2 == ~blastFlag~0); {116915#false} is VALID [2022-04-15 18:23:08,949 INFO L290 TraceCheckUtils]: 149: Hoare triple {116915#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116915#false} is VALID [2022-04-15 18:23:08,949 INFO L290 TraceCheckUtils]: 150: Hoare triple {116915#false} assume !(~ret~0 <= 0); {116915#false} is VALID [2022-04-15 18:23:08,949 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-15 18:23:08,949 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-15 18:23:08,949 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-15 18:23:08,949 INFO L290 TraceCheckUtils]: 154: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-15 18:23:08,949 INFO L290 TraceCheckUtils]: 155: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-15 18:23:08,949 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-15 18:23:08,950 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-15 18:23:08,950 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-15 18:23:08,950 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-15 18:23:08,950 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-15 18:23:08,950 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-15 18:23:08,950 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-15 18:23:08,950 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-15 18:23:08,950 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-15 18:23:08,950 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-15 18:23:08,950 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-15 18:23:08,950 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-15 18:23:08,951 INFO L290 TraceCheckUtils]: 168: Hoare triple {116915#false} assume 4416 == #t~mem60;havoc #t~mem60; {116915#false} is VALID [2022-04-15 18:23:08,951 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-15 18:23:08,951 INFO L290 TraceCheckUtils]: 170: Hoare triple {116915#false} assume !(3 == ~blastFlag~0); {116915#false} is VALID [2022-04-15 18:23:08,951 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-15 18:23:08,951 INFO L290 TraceCheckUtils]: 172: Hoare triple {116915#false} assume !(0 == ~tmp___6~0); {116915#false} is VALID [2022-04-15 18:23:08,951 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-15 18:23:08,951 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-15 18:23:08,951 INFO L290 TraceCheckUtils]: 175: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-15 18:23:08,951 INFO L290 TraceCheckUtils]: 176: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-15 18:23:08,951 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-15 18:23:08,952 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-15 18:23:08,952 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-15 18:23:08,952 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-15 18:23:08,952 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-15 18:23:08,952 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-15 18:23:08,952 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-15 18:23:08,952 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-15 18:23:08,952 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-15 18:23:08,952 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-15 18:23:08,952 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-15 18:23:08,953 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-15 18:23:08,953 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-15 18:23:08,953 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-15 18:23:08,953 INFO L290 TraceCheckUtils]: 191: Hoare triple {116915#false} assume 4432 == #t~mem62;havoc #t~mem62; {116915#false} is VALID [2022-04-15 18:23:08,953 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-15 18:23:08,953 INFO L290 TraceCheckUtils]: 193: Hoare triple {116915#false} assume 5 == ~blastFlag~0; {116915#false} is VALID [2022-04-15 18:23:08,953 INFO L290 TraceCheckUtils]: 194: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-15 18:23:08,954 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-15 18:23:08,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:23:08,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047919109] [2022-04-15 18:23:08,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047919109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:23:08,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:23:08,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:23:08,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:23:08,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1793524375] [2022-04-15 18:23:08,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1793524375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:23:08,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:23:08,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:23:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414430520] [2022-04-15 18:23:08,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:23:08,955 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-15 18:23:08,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:23:08,956 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-15 18:23:09,051 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-15 18:23:09,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:23:09,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:23:09,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:23:09,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:23:09,052 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-15 18:23:11,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:23:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:23:12,818 INFO L93 Difference]: Finished difference Result 2637 states and 3952 transitions. [2022-04-15 18:23:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:23:12,818 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-15 18:23:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:23:12,818 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-15 18:23:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-15 18:23:12,821 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-15 18:23:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-15 18:23:12,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-15 18:23:13,119 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-15 18:23:13,200 INFO L225 Difference]: With dead ends: 2637 [2022-04-15 18:23:13,200 INFO L226 Difference]: Without dead ends: 1460 [2022-04-15 18:23:13,202 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:23:13,202 INFO L913 BasicCegarLoop]: 218 mSDtfsCounter, 83 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:23:13,203 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.5s Time] [2022-04-15 18:23:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2022-04-15 18:23:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1193. [2022-04-15 18:23:13,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:23:13,292 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-15 18:23:13,293 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-15 18:23:13,294 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-15 18:23:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:23:13,353 INFO L93 Difference]: Finished difference Result 1460 states and 2170 transitions. [2022-04-15 18:23:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2170 transitions. [2022-04-15 18:23:13,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:23:13,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:23:13,357 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-15 18:23:13,358 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-15 18:23:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:23:13,412 INFO L93 Difference]: Finished difference Result 1460 states and 2170 transitions. [2022-04-15 18:23:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2170 transitions. [2022-04-15 18:23:13,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:23:13,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:23:13,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:23:13,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:23:13,415 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-15 18:23:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1792 transitions. [2022-04-15 18:23:13,479 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1792 transitions. Word has length 195 [2022-04-15 18:23:13,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:23:13,480 INFO L478 AbstractCegarLoop]: Abstraction has 1193 states and 1792 transitions. [2022-04-15 18:23:13,480 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-15 18:23:13,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1193 states and 1792 transitions. [2022-04-15 18:23:15,209 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-15 18:23:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1792 transitions. [2022-04-15 18:23:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-15 18:23:15,211 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:23:15,212 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-15 18:23:15,212 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 18:23:15,212 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:23:15,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:23:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1079808289, now seen corresponding path program 1 times [2022-04-15 18:23:15,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:23:15,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [834377519] [2022-04-15 18:23:28,677 WARN L232 SmtUtils]: Spent 7.72s 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-15 18:23:38,452 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:23:38,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1079808289, now seen corresponding path program 2 times [2022-04-15 18:23:38,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:23:38,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851558744] [2022-04-15 18:23:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:23:38,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:23:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:23:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:23:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:23:38,674 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-15 18:23:38,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {127506#true} assume true; {127506#true} is VALID [2022-04-15 18:23:38,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127506#true} {127506#true} #593#return; {127506#true} is VALID [2022-04-15 18:23:38,675 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-15 18:23:38,675 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-15 18:23:38,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {127506#true} assume true; {127506#true} is VALID [2022-04-15 18:23:38,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127506#true} {127506#true} #593#return; {127506#true} is VALID [2022-04-15 18:23:38,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {127506#true} call #t~ret158 := main(); {127506#true} is VALID [2022-04-15 18:23:38,676 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-15 18:23:38,676 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-15 18:23:38,676 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-15 18:23:38,676 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-15 18:23:38,676 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-15 18:23:38,676 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-15 18:23:38,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-15 18:23:38,676 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-15 18:23:38,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {127506#true} assume 12292 == #t~mem49;havoc #t~mem49; {127506#true} is VALID [2022-04-15 18:23:38,677 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-15 18:23:38,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {127506#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {127506#true} is VALID [2022-04-15 18:23:38,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {127506#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {127506#true} is VALID [2022-04-15 18:23:38,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {127506#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {127506#true} is VALID [2022-04-15 18:23:38,677 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-15 18:23:38,677 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-15 18:23:38,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {127506#true} assume !(0 == ~tmp___4~0); {127506#true} is VALID [2022-04-15 18:23:38,677 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-15 18:23:38,677 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-15 18:23:38,677 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-15 18:23:38,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-15 18:23:38,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-15 18:23:38,678 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-15 18:23:38,678 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-15 18:23:38,678 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-15 18:23:38,678 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-15 18:23:38,678 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-15 18:23:38,678 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-15 18:23:38,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {127506#true} assume 4368 == #t~mem54;havoc #t~mem54; {127506#true} is VALID [2022-04-15 18:23:38,678 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-15 18:23:38,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {127506#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {127506#true} is VALID [2022-04-15 18:23:38,679 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-15 18:23:38,679 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-15 18:23:38,679 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-15 18:23:38,679 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-15 18:23:38,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-15 18:23:38,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-15 18:23:38,679 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-15 18:23:38,679 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-15 18:23:38,679 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-15 18:23:38,680 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-15 18:23:38,680 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-15 18:23:38,680 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-15 18:23:38,680 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-15 18:23:38,680 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-15 18:23:38,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {127506#true} assume 4384 == #t~mem56;havoc #t~mem56; {127506#true} is VALID [2022-04-15 18:23:38,680 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-15 18:23:38,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {127506#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {127506#true} is VALID [2022-04-15 18:23:38,680 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-15 18:23:38,680 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-15 18:23:38,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {127506#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {127506#true} is VALID [2022-04-15 18:23:38,681 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-15 18:23:38,681 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-15 18:23:38,681 INFO L290 TraceCheckUtils]: 57: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-15 18:23:38,681 INFO L290 TraceCheckUtils]: 58: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-15 18:23:38,681 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-15 18:23:38,681 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-15 18:23:38,681 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-15 18:23:38,681 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-15 18:23:38,681 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-15 18:23:38,681 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-15 18:23:38,682 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-15 18:23:38,682 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-15 18:23:38,682 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-15 18:23:38,682 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-15 18:23:38,682 INFO L290 TraceCheckUtils]: 69: Hoare triple {127506#true} assume 4400 == #t~mem58;havoc #t~mem58; {127506#true} is VALID [2022-04-15 18:23:38,682 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-15 18:23:38,683 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-15 18:23:38,683 INFO L290 TraceCheckUtils]: 72: Hoare triple {127506#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {127506#true} is VALID [2022-04-15 18:23:38,683 INFO L290 TraceCheckUtils]: 73: Hoare triple {127506#true} assume !(~ret~0 <= 0); {127506#true} is VALID [2022-04-15 18:23:38,683 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-15 18:23:38,684 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-15 18:23:38,684 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-15 18:23:38,684 INFO L290 TraceCheckUtils]: 77: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-15 18:23:38,684 INFO L290 TraceCheckUtils]: 78: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-15 18:23:38,684 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-15 18:23:38,684 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-15 18:23:38,684 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-15 18:23:38,684 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-15 18:23:38,684 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-15 18:23:38,684 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-15 18:23:38,685 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-15 18:23:38,685 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-15 18:23:38,685 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-15 18:23:38,685 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-15 18:23:38,685 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-15 18:23:38,685 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-15 18:23:38,685 INFO L290 TraceCheckUtils]: 91: Hoare triple {127506#true} assume 4416 == #t~mem60;havoc #t~mem60; {127506#true} is VALID [2022-04-15 18:23:38,685 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-15 18:23:38,685 INFO L290 TraceCheckUtils]: 93: Hoare triple {127506#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {127506#true} is VALID [2022-04-15 18:23:38,687 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-15 18:23:38,687 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-15 18:23:38,687 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-15 18:23:38,688 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-15 18:23:38,688 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-15 18:23:38,689 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-15 18:23:38,689 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-15 18:23:38,689 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-15 18:23:38,690 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-15 18:23:38,690 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-15 18:23:38,691 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-15 18:23:38,691 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-15 18:23:38,691 INFO L290 TraceCheckUtils]: 106: Hoare triple {127507#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {127507#false} is VALID [2022-04-15 18:23:38,691 INFO L290 TraceCheckUtils]: 107: Hoare triple {127507#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {127507#false} is VALID [2022-04-15 18:23:38,691 INFO L290 TraceCheckUtils]: 108: Hoare triple {127507#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {127507#false} is VALID [2022-04-15 18:23:38,691 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-15 18:23:38,691 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-15 18:23:38,692 INFO L290 TraceCheckUtils]: 111: Hoare triple {127507#false} assume !(0 == ~tmp___4~0); {127507#false} is VALID [2022-04-15 18:23:38,692 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-15 18:23:38,692 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-15 18:23:38,692 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-15 18:23:38,692 INFO L290 TraceCheckUtils]: 115: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-15 18:23:38,692 INFO L290 TraceCheckUtils]: 116: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-15 18:23:38,692 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-15 18:23:38,692 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-15 18:23:38,692 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-15 18:23:38,692 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-15 18:23:38,693 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-15 18:23:38,693 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-15 18:23:38,693 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-15 18:23:38,693 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-15 18:23:38,693 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-15 18:23:38,693 INFO L290 TraceCheckUtils]: 126: Hoare triple {127507#false} assume 4385 == #t~mem57;havoc #t~mem57; {127507#false} is VALID [2022-04-15 18:23:38,693 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-15 18:23:38,693 INFO L290 TraceCheckUtils]: 128: Hoare triple {127507#false} assume !(1 == ~blastFlag~0); {127507#false} is VALID [2022-04-15 18:23:38,693 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-15 18:23:38,694 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-15 18:23:38,694 INFO L290 TraceCheckUtils]: 131: Hoare triple {127507#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {127507#false} is VALID [2022-04-15 18:23:38,694 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-15 18:23:38,694 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-15 18:23:38,694 INFO L290 TraceCheckUtils]: 134: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-15 18:23:38,694 INFO L290 TraceCheckUtils]: 135: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-15 18:23:38,694 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-15 18:23:38,694 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-15 18:23:38,694 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-15 18:23:38,694 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-15 18:23:38,694 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-15 18:23:38,695 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-15 18:23:38,695 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-15 18:23:38,695 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-15 18:23:38,695 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-15 18:23:38,695 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-15 18:23:38,695 INFO L290 TraceCheckUtils]: 146: Hoare triple {127507#false} assume 4400 == #t~mem58;havoc #t~mem58; {127507#false} is VALID [2022-04-15 18:23:38,695 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-15 18:23:38,695 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-15 18:23:38,695 INFO L290 TraceCheckUtils]: 149: Hoare triple {127507#false} assume !(2 == ~blastFlag~0); {127507#false} is VALID [2022-04-15 18:23:38,695 INFO L290 TraceCheckUtils]: 150: Hoare triple {127507#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {127507#false} is VALID [2022-04-15 18:23:38,696 INFO L290 TraceCheckUtils]: 151: Hoare triple {127507#false} assume !(~ret~0 <= 0); {127507#false} is VALID [2022-04-15 18:23:38,696 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-15 18:23:38,696 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-15 18:23:38,696 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-15 18:23:38,696 INFO L290 TraceCheckUtils]: 155: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-15 18:23:38,696 INFO L290 TraceCheckUtils]: 156: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-15 18:23:38,696 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-15 18:23:38,696 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-15 18:23:38,696 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-15 18:23:38,696 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-15 18:23:38,696 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-15 18:23:38,697 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-15 18:23:38,697 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-15 18:23:38,697 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-15 18:23:38,697 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-15 18:23:38,697 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-15 18:23:38,697 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-15 18:23:38,697 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-15 18:23:38,697 INFO L290 TraceCheckUtils]: 169: Hoare triple {127507#false} assume 4416 == #t~mem60;havoc #t~mem60; {127507#false} is VALID [2022-04-15 18:23:38,697 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-15 18:23:38,697 INFO L290 TraceCheckUtils]: 171: Hoare triple {127507#false} assume !(3 == ~blastFlag~0); {127507#false} is VALID [2022-04-15 18:23:38,698 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-15 18:23:38,698 INFO L290 TraceCheckUtils]: 173: Hoare triple {127507#false} assume !(0 == ~tmp___6~0); {127507#false} is VALID [2022-04-15 18:23:38,698 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-15 18:23:38,698 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-15 18:23:38,698 INFO L290 TraceCheckUtils]: 176: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-15 18:23:38,698 INFO L290 TraceCheckUtils]: 177: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-15 18:23:38,698 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-15 18:23:38,698 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-15 18:23:38,698 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-15 18:23:38,698 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-15 18:23:38,698 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-15 18:23:38,699 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-15 18:23:38,699 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-15 18:23:38,699 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-15 18:23:38,699 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-15 18:23:38,699 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-15 18:23:38,699 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-15 18:23:38,699 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-15 18:23:38,699 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-15 18:23:38,699 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-15 18:23:38,700 INFO L290 TraceCheckUtils]: 192: Hoare triple {127507#false} assume 4432 == #t~mem62;havoc #t~mem62; {127507#false} is VALID [2022-04-15 18:23:38,700 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-15 18:23:38,700 INFO L290 TraceCheckUtils]: 194: Hoare triple {127507#false} assume 5 == ~blastFlag~0; {127507#false} is VALID [2022-04-15 18:23:38,700 INFO L290 TraceCheckUtils]: 195: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-15 18:23:38,700 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-15 18:23:38,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:23:38,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851558744] [2022-04-15 18:23:38,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851558744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:23:38,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:23:38,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:23:38,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:23:38,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [834377519] [2022-04-15 18:23:38,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [834377519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:23:38,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:23:38,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:23:38,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184098396] [2022-04-15 18:23:38,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:23:38,702 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-15 18:23:38,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:23:38,703 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-15 18:23:38,795 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-15 18:23:38,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:23:38,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:23:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:23:38,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:23:38,796 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-15 18:23:40,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:23:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:23:42,370 INFO L93 Difference]: Finished difference Result 2592 states and 3887 transitions. [2022-04-15 18:23:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:23:42,370 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-15 18:23:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:23:42,370 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-15 18:23:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-15 18:23:42,372 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-15 18:23:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-15 18:23:42,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 433 transitions. [2022-04-15 18:23:42,657 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-15 18:23:42,735 INFO L225 Difference]: With dead ends: 2592 [2022-04-15 18:23:42,735 INFO L226 Difference]: Without dead ends: 1415 [2022-04-15 18:23:42,736 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:23:42,737 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-15 18:23:42,737 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-15 18:23:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2022-04-15 18:23:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1193. [2022-04-15 18:23:42,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:23:42,838 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-15 18:23:42,839 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-15 18:23:42,840 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-15 18:23:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:23:42,920 INFO L93 Difference]: Finished difference Result 1415 states and 2110 transitions. [2022-04-15 18:23:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2110 transitions. [2022-04-15 18:23:42,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:23:42,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:23:42,924 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-15 18:23:42,925 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-15 18:23:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:23:42,998 INFO L93 Difference]: Finished difference Result 1415 states and 2110 transitions. [2022-04-15 18:23:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2110 transitions. [2022-04-15 18:23:42,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:23:42,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:23:42,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:23:42,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:23:43,001 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-15 18:23:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1787 transitions. [2022-04-15 18:23:43,067 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1787 transitions. Word has length 196 [2022-04-15 18:23:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:23:43,067 INFO L478 AbstractCegarLoop]: Abstraction has 1193 states and 1787 transitions. [2022-04-15 18:23:43,067 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-15 18:23:43,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1193 states and 1787 transitions. [2022-04-15 18:23:44,775 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-15 18:23:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1787 transitions. [2022-04-15 18:23:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-15 18:23:44,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:23:44,778 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-15 18:23:44,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 18:23:44,778 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:23:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:23:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2125464036, now seen corresponding path program 1 times [2022-04-15 18:23:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:23:44,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039371183] [2022-04-15 18:23:59,714 WARN L232 SmtUtils]: Spent 7.72s 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-15 18:24:09,464 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:24:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2125464036, now seen corresponding path program 2 times [2022-04-15 18:24:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:24:09,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410273532] [2022-04-15 18:24:09,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:24:09,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:24:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:24:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:24:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:24:09,756 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-15 18:24:09,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {137918#true} assume true; {137918#true} is VALID [2022-04-15 18:24:09,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137918#true} {137918#true} #593#return; {137918#true} is VALID [2022-04-15 18:24:09,757 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-15 18:24:09,757 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-15 18:24:09,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {137918#true} assume true; {137918#true} is VALID [2022-04-15 18:24:09,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137918#true} {137918#true} #593#return; {137918#true} is VALID [2022-04-15 18:24:09,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {137918#true} call #t~ret158 := main(); {137918#true} is VALID [2022-04-15 18:24:09,758 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-15 18:24:09,758 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-15 18:24:09,758 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-15 18:24:09,758 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-15 18:24:09,758 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-15 18:24:09,758 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-15 18:24:09,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-15 18:24:09,759 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-15 18:24:09,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {137918#true} assume 12292 == #t~mem49;havoc #t~mem49; {137918#true} is VALID [2022-04-15 18:24:09,759 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-15 18:24:09,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {137918#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {137918#true} is VALID [2022-04-15 18:24:09,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {137918#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {137918#true} is VALID [2022-04-15 18:24:09,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {137918#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {137918#true} is VALID [2022-04-15 18:24:09,759 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-15 18:24:09,759 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-15 18:24:09,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {137918#true} assume !(0 == ~tmp___4~0); {137918#true} is VALID [2022-04-15 18:24:09,759 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-15 18:24:09,759 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-15 18:24:09,760 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-15 18:24:09,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-15 18:24:09,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-15 18:24:09,760 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-15 18:24:09,760 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-15 18:24:09,760 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-15 18:24:09,760 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-15 18:24:09,760 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-15 18:24:09,760 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-15 18:24:09,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {137918#true} assume 4368 == #t~mem54;havoc #t~mem54; {137918#true} is VALID [2022-04-15 18:24:09,760 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-15 18:24:09,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {137918#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {137918#true} is VALID [2022-04-15 18:24:09,760 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-15 18:24:09,760 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-15 18:24:09,761 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-15 18:24:09,761 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-15 18:24:09,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-15 18:24:09,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-15 18:24:09,761 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-15 18:24:09,761 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-15 18:24:09,761 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-15 18:24:09,761 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-15 18:24:09,761 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-15 18:24:09,761 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-15 18:24:09,761 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-15 18:24:09,761 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-15 18:24:09,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {137918#true} assume 4384 == #t~mem56;havoc #t~mem56; {137918#true} is VALID [2022-04-15 18:24:09,762 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-15 18:24:09,762 INFO L290 TraceCheckUtils]: 51: Hoare triple {137918#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {137918#true} is VALID [2022-04-15 18:24:09,762 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-15 18:24:09,762 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-15 18:24:09,762 INFO L290 TraceCheckUtils]: 54: Hoare triple {137918#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {137918#true} is VALID [2022-04-15 18:24:09,762 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-15 18:24:09,762 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-15 18:24:09,762 INFO L290 TraceCheckUtils]: 57: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-15 18:24:09,762 INFO L290 TraceCheckUtils]: 58: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-15 18:24:09,762 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-15 18:24:09,762 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-15 18:24:09,762 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-15 18:24:09,762 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-15 18:24:09,763 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-15 18:24:09,763 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-15 18:24:09,763 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-15 18:24:09,763 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-15 18:24:09,763 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-15 18:24:09,763 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-15 18:24:09,763 INFO L290 TraceCheckUtils]: 69: Hoare triple {137918#true} assume 4400 == #t~mem58;havoc #t~mem58; {137918#true} is VALID [2022-04-15 18:24:09,763 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-15 18:24:09,763 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-15 18:24:09,763 INFO L290 TraceCheckUtils]: 72: Hoare triple {137918#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {137918#true} is VALID [2022-04-15 18:24:09,763 INFO L290 TraceCheckUtils]: 73: Hoare triple {137918#true} assume !(~ret~0 <= 0); {137918#true} is VALID [2022-04-15 18:24:09,763 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-15 18:24:09,763 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-15 18:24:09,763 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-15 18:24:09,764 INFO L290 TraceCheckUtils]: 77: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-15 18:24:09,764 INFO L290 TraceCheckUtils]: 78: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-15 18:24:09,764 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-15 18:24:09,764 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-15 18:24:09,764 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-15 18:24:09,764 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-15 18:24:09,764 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-15 18:24:09,764 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-15 18:24:09,764 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-15 18:24:09,764 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-15 18:24:09,764 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-15 18:24:09,764 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-15 18:24:09,764 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-15 18:24:09,764 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-15 18:24:09,765 INFO L290 TraceCheckUtils]: 91: Hoare triple {137918#true} assume 4416 == #t~mem60;havoc #t~mem60; {137918#true} is VALID [2022-04-15 18:24:09,765 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-15 18:24:09,765 INFO L290 TraceCheckUtils]: 93: Hoare triple {137918#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {137918#true} is VALID [2022-04-15 18:24:09,766 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-15 18:24:09,766 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-15 18:24:09,766 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-15 18:24:09,767 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-15 18:24:09,767 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-15 18:24:09,768 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-15 18:24:09,768 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-15 18:24:09,768 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-15 18:24:09,769 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-15 18:24:09,769 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-15 18:24:09,769 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-15 18:24:09,770 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-15 18:24:09,770 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-15 18:24:09,770 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-15 18:24:09,771 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-15 18:24:09,771 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-15 18:24:09,771 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-15 18:24:09,772 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-15 18:24:09,772 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-15 18:24:09,772 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-15 18:24:09,773 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-15 18:24:09,773 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-15 18:24:09,774 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-15 18:24:09,774 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-15 18:24:09,774 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-15 18:24:09,775 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-15 18:24:09,775 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-15 18:24:09,775 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-15 18:24:09,776 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-15 18:24:09,776 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-15 18:24:09,777 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-15 18:24:09,777 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-15 18:24:09,777 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-15 18:24:09,777 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-15 18:24:09,777 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-15 18:24:09,778 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-15 18:24:09,778 INFO L290 TraceCheckUtils]: 130: Hoare triple {137919#false} assume !(0 == ~tmp___7~0); {137919#false} is VALID [2022-04-15 18:24:09,778 INFO L290 TraceCheckUtils]: 131: Hoare triple {137919#false} assume !(0 == ~tmp___8~0); {137919#false} is VALID [2022-04-15 18:24:09,778 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-15 18:24:09,778 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-15 18:24:09,778 INFO L290 TraceCheckUtils]: 134: Hoare triple {137919#false} ~skip~0 := 0; {137919#false} is VALID [2022-04-15 18:24:09,778 INFO L290 TraceCheckUtils]: 135: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-15 18:24:09,778 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-15 18:24:09,778 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-15 18:24:09,778 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-15 18:24:09,778 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-15 18:24:09,778 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-15 18:24:09,779 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-15 18:24:09,779 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-15 18:24:09,779 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-15 18:24:09,779 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-15 18:24:09,779 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-15 18:24:09,779 INFO L290 TraceCheckUtils]: 146: Hoare triple {137919#false} assume 4400 == #t~mem58;havoc #t~mem58; {137919#false} is VALID [2022-04-15 18:24:09,779 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-15 18:24:09,779 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-15 18:24:09,780 INFO L290 TraceCheckUtils]: 149: Hoare triple {137919#false} assume !(2 == ~blastFlag~0); {137919#false} is VALID [2022-04-15 18:24:09,780 INFO L290 TraceCheckUtils]: 150: Hoare triple {137919#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {137919#false} is VALID [2022-04-15 18:24:09,780 INFO L290 TraceCheckUtils]: 151: Hoare triple {137919#false} assume !(~ret~0 <= 0); {137919#false} is VALID [2022-04-15 18:24:09,780 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-15 18:24:09,780 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-15 18:24:09,780 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-15 18:24:09,780 INFO L290 TraceCheckUtils]: 155: Hoare triple {137919#false} ~skip~0 := 0; {137919#false} is VALID [2022-04-15 18:24:09,780 INFO L290 TraceCheckUtils]: 156: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-15 18:24:09,780 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-15 18:24:09,781 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-15 18:24:09,781 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-15 18:24:09,781 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-15 18:24:09,781 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-15 18:24:09,781 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-15 18:24:09,781 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-15 18:24:09,781 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-15 18:24:09,781 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-15 18:24:09,781 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-15 18:24:09,782 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-15 18:24:09,782 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-15 18:24:09,782 INFO L290 TraceCheckUtils]: 169: Hoare triple {137919#false} assume 4416 == #t~mem60;havoc #t~mem60; {137919#false} is VALID [2022-04-15 18:24:09,782 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-15 18:24:09,782 INFO L290 TraceCheckUtils]: 171: Hoare triple {137919#false} assume !(3 == ~blastFlag~0); {137919#false} is VALID [2022-04-15 18:24:09,782 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-15 18:24:09,782 INFO L290 TraceCheckUtils]: 173: Hoare triple {137919#false} assume !(0 == ~tmp___6~0); {137919#false} is VALID [2022-04-15 18:24:09,782 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-15 18:24:09,782 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-15 18:24:09,782 INFO L290 TraceCheckUtils]: 176: Hoare triple {137919#false} ~skip~0 := 0; {137919#false} is VALID [2022-04-15 18:24:09,783 INFO L290 TraceCheckUtils]: 177: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-15 18:24:09,783 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-15 18:24:09,783 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-15 18:24:09,783 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-15 18:24:09,783 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-15 18:24:09,783 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-15 18:24:09,783 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-15 18:24:09,783 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-15 18:24:09,783 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-15 18:24:09,784 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-15 18:24:09,784 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-15 18:24:09,784 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-15 18:24:09,784 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-15 18:24:09,784 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-15 18:24:09,784 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-15 18:24:09,784 INFO L290 TraceCheckUtils]: 192: Hoare triple {137919#false} assume 4432 == #t~mem62;havoc #t~mem62; {137919#false} is VALID [2022-04-15 18:24:09,784 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-15 18:24:09,784 INFO L290 TraceCheckUtils]: 194: Hoare triple {137919#false} assume 5 == ~blastFlag~0; {137919#false} is VALID [2022-04-15 18:24:09,784 INFO L290 TraceCheckUtils]: 195: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-15 18:24:09,785 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-15 18:24:09,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:24:09,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410273532] [2022-04-15 18:24:09,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410273532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:24:09,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:24:09,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:24:09,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:24:09,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039371183] [2022-04-15 18:24:09,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039371183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:24:09,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:24:09,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:24:09,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187014636] [2022-04-15 18:24:09,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:24:09,787 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-15 18:24:09,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:24:09,787 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-15 18:24:09,883 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-15 18:24:09,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:24:09,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:24:09,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:24:09,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:24:09,884 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-15 18:24:11,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:24:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:24:13,388 INFO L93 Difference]: Finished difference Result 2909 states and 4318 transitions. [2022-04-15 18:24:13,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:24:13,388 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-15 18:24:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:24:13,388 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-15 18:24:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:24:13,391 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-15 18:24:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:24:13,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 18:24:13,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:24:13,858 INFO L225 Difference]: With dead ends: 2909 [2022-04-15 18:24:13,858 INFO L226 Difference]: Without dead ends: 1732 [2022-04-15 18:24:13,859 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:24:13,860 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-15 18:24:13,860 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-15 18:24:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2022-04-15 18:24:13,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1421. [2022-04-15 18:24:13,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:24:13,987 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-15 18:24:13,989 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-15 18:24:13,990 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-15 18:24:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:24:14,096 INFO L93 Difference]: Finished difference Result 1732 states and 2545 transitions. [2022-04-15 18:24:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2545 transitions. [2022-04-15 18:24:14,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:24:14,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:24:14,099 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-15 18:24:14,100 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-15 18:24:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:24:14,183 INFO L93 Difference]: Finished difference Result 1732 states and 2545 transitions. [2022-04-15 18:24:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2545 transitions. [2022-04-15 18:24:14,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:24:14,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:24:14,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:24:14,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:24:14,187 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-15 18:24:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2153 transitions. [2022-04-15 18:24:14,271 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2153 transitions. Word has length 196 [2022-04-15 18:24:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:24:14,271 INFO L478 AbstractCegarLoop]: Abstraction has 1421 states and 2153 transitions. [2022-04-15 18:24:14,271 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-15 18:24:14,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1421 states and 2153 transitions. [2022-04-15 18:24:16,470 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-15 18:24:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2153 transitions. [2022-04-15 18:24:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-15 18:24:16,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:24:16,473 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-15 18:24:16,473 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 18:24:16,473 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:24:16,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:24:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1893395013, now seen corresponding path program 1 times [2022-04-15 18:24:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:24:16,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [363149667] [2022-04-15 18:24:34,639 WARN L232 SmtUtils]: Spent 11.21s 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-15 18:24:45,891 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:24:45,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1893395013, now seen corresponding path program 2 times [2022-04-15 18:24:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:24:45,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160045164] [2022-04-15 18:24:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:24:45,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:24:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:24:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:24:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:24:46,108 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-15 18:24:46,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {150054#true} assume true; {150054#true} is VALID [2022-04-15 18:24:46,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150054#true} {150054#true} #593#return; {150054#true} is VALID [2022-04-15 18:24:46,110 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-15 18:24:46,110 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-15 18:24:46,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {150054#true} assume true; {150054#true} is VALID [2022-04-15 18:24:46,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150054#true} {150054#true} #593#return; {150054#true} is VALID [2022-04-15 18:24:46,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {150054#true} call #t~ret158 := main(); {150054#true} is VALID [2022-04-15 18:24:46,110 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-15 18:24:46,110 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-15 18:24:46,110 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-15 18:24:46,110 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-15 18:24:46,110 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-15 18:24:46,110 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-15 18:24:46,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-15 18:24:46,111 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-15 18:24:46,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {150054#true} assume 12292 == #t~mem49;havoc #t~mem49; {150054#true} is VALID [2022-04-15 18:24:46,111 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-15 18:24:46,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {150054#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {150054#true} is VALID [2022-04-15 18:24:46,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {150054#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {150054#true} is VALID [2022-04-15 18:24:46,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {150054#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {150054#true} is VALID [2022-04-15 18:24:46,111 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-15 18:24:46,111 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-15 18:24:46,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {150054#true} assume !(0 == ~tmp___4~0); {150054#true} is VALID [2022-04-15 18:24:46,111 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-15 18:24:46,111 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-15 18:24:46,111 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-15 18:24:46,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-15 18:24:46,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-15 18:24:46,112 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-15 18:24:46,112 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-15 18:24:46,112 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-15 18:24:46,112 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-15 18:24:46,112 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-15 18:24:46,112 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-15 18:24:46,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {150054#true} assume 4368 == #t~mem54;havoc #t~mem54; {150054#true} is VALID [2022-04-15 18:24:46,112 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-15 18:24:46,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {150054#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {150054#true} is VALID [2022-04-15 18:24:46,112 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-15 18:24:46,112 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-15 18:24:46,112 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-15 18:24:46,112 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-15 18:24:46,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-15 18:24:46,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-15 18:24:46,113 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-15 18:24:46,113 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-15 18:24:46,113 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-15 18:24:46,113 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-15 18:24:46,113 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-15 18:24:46,113 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-15 18:24:46,113 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-15 18:24:46,113 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-15 18:24:46,113 INFO L290 TraceCheckUtils]: 49: Hoare triple {150054#true} assume 4384 == #t~mem56;havoc #t~mem56; {150054#true} is VALID [2022-04-15 18:24:46,113 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-15 18:24:46,113 INFO L290 TraceCheckUtils]: 51: Hoare triple {150054#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {150054#true} is VALID [2022-04-15 18:24:46,113 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-15 18:24:46,114 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-15 18:24:46,114 INFO L290 TraceCheckUtils]: 54: Hoare triple {150054#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {150054#true} is VALID [2022-04-15 18:24:46,114 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-15 18:24:46,114 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-15 18:24:46,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-15 18:24:46,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-15 18:24:46,114 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-15 18:24:46,114 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-15 18:24:46,114 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-15 18:24:46,114 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-15 18:24:46,114 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-15 18:24:46,114 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-15 18:24:46,114 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-15 18:24:46,114 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-15 18:24:46,115 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-15 18:24:46,115 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-15 18:24:46,115 INFO L290 TraceCheckUtils]: 69: Hoare triple {150054#true} assume 4400 == #t~mem58;havoc #t~mem58; {150054#true} is VALID [2022-04-15 18:24:46,115 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-15 18:24:46,115 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-15 18:24:46,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {150054#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {150054#true} is VALID [2022-04-15 18:24:46,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {150054#true} assume !(~ret~0 <= 0); {150054#true} is VALID [2022-04-15 18:24:46,115 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-15 18:24:46,115 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-15 18:24:46,115 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-15 18:24:46,115 INFO L290 TraceCheckUtils]: 77: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-15 18:24:46,115 INFO L290 TraceCheckUtils]: 78: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-15 18:24:46,115 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-15 18:24:46,115 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-15 18:24:46,116 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-15 18:24:46,116 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-15 18:24:46,116 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-15 18:24:46,116 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-15 18:24:46,116 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-15 18:24:46,116 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-15 18:24:46,116 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-15 18:24:46,116 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-15 18:24:46,116 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-15 18:24:46,116 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-15 18:24:46,116 INFO L290 TraceCheckUtils]: 91: Hoare triple {150054#true} assume 4416 == #t~mem60;havoc #t~mem60; {150054#true} is VALID [2022-04-15 18:24:46,116 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-15 18:24:46,116 INFO L290 TraceCheckUtils]: 93: Hoare triple {150054#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {150054#true} is VALID [2022-04-15 18:24:46,117 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-15 18:24:46,118 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-15 18:24:46,118 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-15 18:24:46,118 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-15 18:24:46,119 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-15 18:24:46,119 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-15 18:24:46,120 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-15 18:24:46,120 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-15 18:24:46,120 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-15 18:24:46,121 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-15 18:24:46,121 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-15 18:24:46,121 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-15 18:24:46,122 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-15 18:24:46,122 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-15 18:24:46,122 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-15 18:24:46,123 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-15 18:24:46,123 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-15 18:24:46,123 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-15 18:24:46,124 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-15 18:24:46,124 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,125 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-15 18:24:46,126 INFO L290 TraceCheckUtils]: 127: Hoare triple {150055#false} assume 4513 == #t~mem75;havoc #t~mem75; {150055#false} is VALID [2022-04-15 18:24:46,126 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-15 18:24:46,126 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-15 18:24:46,126 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-15 18:24:46,126 INFO L290 TraceCheckUtils]: 131: Hoare triple {150055#false} assume !(0 == ~tmp___7~0); {150055#false} is VALID [2022-04-15 18:24:46,126 INFO L290 TraceCheckUtils]: 132: Hoare triple {150055#false} assume !(0 == ~tmp___8~0); {150055#false} is VALID [2022-04-15 18:24:46,126 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-15 18:24:46,126 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-15 18:24:46,126 INFO L290 TraceCheckUtils]: 135: Hoare triple {150055#false} ~skip~0 := 0; {150055#false} is VALID [2022-04-15 18:24:46,126 INFO L290 TraceCheckUtils]: 136: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-15 18:24:46,126 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-15 18:24:46,126 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-15 18:24:46,126 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-15 18:24:46,126 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-15 18:24:46,127 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-15 18:24:46,127 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-15 18:24:46,127 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-15 18:24:46,127 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-15 18:24:46,127 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-15 18:24:46,127 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-15 18:24:46,127 INFO L290 TraceCheckUtils]: 147: Hoare triple {150055#false} assume 4400 == #t~mem58;havoc #t~mem58; {150055#false} is VALID [2022-04-15 18:24:46,127 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-15 18:24:46,127 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-15 18:24:46,127 INFO L290 TraceCheckUtils]: 150: Hoare triple {150055#false} assume !(2 == ~blastFlag~0); {150055#false} is VALID [2022-04-15 18:24:46,127 INFO L290 TraceCheckUtils]: 151: Hoare triple {150055#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {150055#false} is VALID [2022-04-15 18:24:46,127 INFO L290 TraceCheckUtils]: 152: Hoare triple {150055#false} assume !(~ret~0 <= 0); {150055#false} is VALID [2022-04-15 18:24:46,127 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-15 18:24:46,127 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-15 18:24:46,127 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-15 18:24:46,128 INFO L290 TraceCheckUtils]: 156: Hoare triple {150055#false} ~skip~0 := 0; {150055#false} is VALID [2022-04-15 18:24:46,128 INFO L290 TraceCheckUtils]: 157: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-15 18:24:46,128 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-15 18:24:46,128 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-15 18:24:46,128 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-15 18:24:46,128 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-15 18:24:46,128 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-15 18:24:46,128 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-15 18:24:46,128 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-15 18:24:46,128 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-15 18:24:46,128 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-15 18:24:46,128 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-15 18:24:46,129 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-15 18:24:46,129 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-15 18:24:46,129 INFO L290 TraceCheckUtils]: 170: Hoare triple {150055#false} assume 4416 == #t~mem60;havoc #t~mem60; {150055#false} is VALID [2022-04-15 18:24:46,129 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-15 18:24:46,129 INFO L290 TraceCheckUtils]: 172: Hoare triple {150055#false} assume !(3 == ~blastFlag~0); {150055#false} is VALID [2022-04-15 18:24:46,129 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-15 18:24:46,129 INFO L290 TraceCheckUtils]: 174: Hoare triple {150055#false} assume !(0 == ~tmp___6~0); {150055#false} is VALID [2022-04-15 18:24:46,129 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-15 18:24:46,129 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-15 18:24:46,129 INFO L290 TraceCheckUtils]: 177: Hoare triple {150055#false} ~skip~0 := 0; {150055#false} is VALID [2022-04-15 18:24:46,129 INFO L290 TraceCheckUtils]: 178: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-15 18:24:46,129 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-15 18:24:46,129 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-15 18:24:46,130 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-15 18:24:46,130 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-15 18:24:46,130 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-15 18:24:46,130 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-15 18:24:46,130 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-15 18:24:46,130 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-15 18:24:46,130 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-15 18:24:46,130 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-15 18:24:46,130 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-15 18:24:46,130 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-15 18:24:46,130 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-15 18:24:46,130 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-15 18:24:46,130 INFO L290 TraceCheckUtils]: 193: Hoare triple {150055#false} assume 4432 == #t~mem62;havoc #t~mem62; {150055#false} is VALID [2022-04-15 18:24:46,130 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-15 18:24:46,131 INFO L290 TraceCheckUtils]: 195: Hoare triple {150055#false} assume 5 == ~blastFlag~0; {150055#false} is VALID [2022-04-15 18:24:46,131 INFO L290 TraceCheckUtils]: 196: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-15 18:24:46,131 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-15 18:24:46,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:24:46,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160045164] [2022-04-15 18:24:46,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160045164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:24:46,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:24:46,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:24:46,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:24:46,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [363149667] [2022-04-15 18:24:46,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [363149667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:24:46,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:24:46,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:24:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958658359] [2022-04-15 18:24:46,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:24:46,133 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-15 18:24:46,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:24:46,133 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-15 18:24:46,238 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-15 18:24:46,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:24:46,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:24:46,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:24:46,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:24:46,238 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-15 18:24:48,266 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:24:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:24:49,565 INFO L93 Difference]: Finished difference Result 2858 states and 4319 transitions. [2022-04-15 18:24:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:24:49,565 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-15 18:24:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:24:49,566 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-15 18:24:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-04-15 18:24:49,567 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-15 18:24:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-04-15 18:24:49,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 374 transitions. [2022-04-15 18:24:49,812 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-15 18:24:49,895 INFO L225 Difference]: With dead ends: 2858 [2022-04-15 18:24:49,896 INFO L226 Difference]: Without dead ends: 1453 [2022-04-15 18:24:49,898 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:24:49,898 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 19 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:24:49,898 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.3s Time] [2022-04-15 18:24:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-04-15 18:24:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1421. [2022-04-15 18:24:49,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:24:49,994 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-15 18:24:49,995 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-15 18:24:49,996 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-15 18:24:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:24:50,049 INFO L93 Difference]: Finished difference Result 1453 states and 2181 transitions. [2022-04-15 18:24:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2181 transitions. [2022-04-15 18:24:50,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:24:50,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:24:50,053 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-15 18:24:50,054 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-15 18:24:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:24:50,106 INFO L93 Difference]: Finished difference Result 1453 states and 2181 transitions. [2022-04-15 18:24:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2181 transitions. [2022-04-15 18:24:50,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:24:50,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:24:50,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:24:50,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:24:50,110 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-15 18:24:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2148 transitions. [2022-04-15 18:24:50,196 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2148 transitions. Word has length 197 [2022-04-15 18:24:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:24:50,196 INFO L478 AbstractCegarLoop]: Abstraction has 1421 states and 2148 transitions. [2022-04-15 18:24:50,196 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-15 18:24:50,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1421 states and 2148 transitions. [2022-04-15 18:24:52,401 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-15 18:24:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2148 transitions. [2022-04-15 18:24:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-04-15 18:24:52,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:24:52,403 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-15 18:24:52,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 18:24:52,403 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:24:52,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:24:52,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1803608870, now seen corresponding path program 1 times [2022-04-15 18:24:52,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:24:52,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [674496621] [2022-04-15 18:25:06,107 WARN L232 SmtUtils]: Spent 8.57s 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-15 18:25:14,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:25:14,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1803608870, now seen corresponding path program 2 times [2022-04-15 18:25:14,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:25:14,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816166590] [2022-04-15 18:25:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:25:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:25:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:25:15,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:25:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:25:15,091 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-15 18:25:15,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {161530#true} assume true; {161530#true} is VALID [2022-04-15 18:25:15,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161530#true} {161530#true} #593#return; {161530#true} is VALID [2022-04-15 18:25:15,092 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-15 18:25:15,093 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-15 18:25:15,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {161530#true} assume true; {161530#true} is VALID [2022-04-15 18:25:15,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161530#true} {161530#true} #593#return; {161530#true} is VALID [2022-04-15 18:25:15,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {161530#true} call #t~ret158 := main(); {161530#true} is VALID [2022-04-15 18:25:15,093 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-15 18:25:15,093 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-15 18:25:15,093 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-15 18:25:15,093 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-15 18:25:15,093 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-15 18:25:15,094 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-15 18:25:15,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-15 18:25:15,094 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-15 18:25:15,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {161530#true} assume 12292 == #t~mem49;havoc #t~mem49; {161530#true} is VALID [2022-04-15 18:25:15,094 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-15 18:25:15,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {161530#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {161530#true} is VALID [2022-04-15 18:25:15,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {161530#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {161530#true} is VALID [2022-04-15 18:25:15,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {161530#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {161530#true} is VALID [2022-04-15 18:25:15,094 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-15 18:25:15,094 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-15 18:25:15,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {161530#true} assume !(0 == ~tmp___4~0); {161530#true} is VALID [2022-04-15 18:25:15,095 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-15 18:25:15,095 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-15 18:25:15,095 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-15 18:25:15,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-15 18:25:15,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-15 18:25:15,095 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-15 18:25:15,095 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-15 18:25:15,095 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-15 18:25:15,095 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-15 18:25:15,096 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-15 18:25:15,096 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-15 18:25:15,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {161530#true} assume 4368 == #t~mem54;havoc #t~mem54; {161530#true} is VALID [2022-04-15 18:25:15,096 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-15 18:25:15,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {161530#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {161530#true} is VALID [2022-04-15 18:25:15,096 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-15 18:25:15,096 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-15 18:25:15,096 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-15 18:25:15,096 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-15 18:25:15,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-15 18:25:15,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-15 18:25:15,097 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-15 18:25:15,097 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-15 18:25:15,097 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-15 18:25:15,097 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-15 18:25:15,097 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-15 18:25:15,097 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-15 18:25:15,097 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-15 18:25:15,097 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-15 18:25:15,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {161530#true} assume 4384 == #t~mem56;havoc #t~mem56; {161530#true} is VALID [2022-04-15 18:25:15,097 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-15 18:25:15,098 INFO L290 TraceCheckUtils]: 51: Hoare triple {161530#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {161530#true} is VALID [2022-04-15 18:25:15,098 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-15 18:25:15,098 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-15 18:25:15,098 INFO L290 TraceCheckUtils]: 54: Hoare triple {161530#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {161530#true} is VALID [2022-04-15 18:25:15,098 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-15 18:25:15,098 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-15 18:25:15,098 INFO L290 TraceCheckUtils]: 57: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-15 18:25:15,098 INFO L290 TraceCheckUtils]: 58: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-15 18:25:15,098 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-15 18:25:15,098 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-15 18:25:15,098 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-15 18:25:15,099 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-15 18:25:15,099 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-15 18:25:15,099 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-15 18:25:15,099 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-15 18:25:15,099 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-15 18:25:15,099 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-15 18:25:15,099 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-15 18:25:15,099 INFO L290 TraceCheckUtils]: 69: Hoare triple {161530#true} assume 4400 == #t~mem58;havoc #t~mem58; {161530#true} is VALID [2022-04-15 18:25:15,099 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-15 18:25:15,099 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-15 18:25:15,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {161530#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {161530#true} is VALID [2022-04-15 18:25:15,100 INFO L290 TraceCheckUtils]: 73: Hoare triple {161530#true} assume !(~ret~0 <= 0); {161530#true} is VALID [2022-04-15 18:25:15,100 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-15 18:25:15,100 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-15 18:25:15,100 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-15 18:25:15,100 INFO L290 TraceCheckUtils]: 77: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-15 18:25:15,100 INFO L290 TraceCheckUtils]: 78: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-15 18:25:15,100 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-15 18:25:15,100 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-15 18:25:15,100 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-15 18:25:15,101 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-15 18:25:15,101 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-15 18:25:15,101 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-15 18:25:15,101 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-15 18:25:15,101 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-15 18:25:15,101 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-15 18:25:15,101 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-15 18:25:15,101 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-15 18:25:15,101 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-15 18:25:15,101 INFO L290 TraceCheckUtils]: 91: Hoare triple {161530#true} assume 4416 == #t~mem60;havoc #t~mem60; {161530#true} is VALID [2022-04-15 18:25:15,101 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-15 18:25:15,102 INFO L290 TraceCheckUtils]: 93: Hoare triple {161530#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {161530#true} is VALID [2022-04-15 18:25:15,102 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-15 18:25:15,102 INFO L290 TraceCheckUtils]: 95: Hoare triple {161530#true} assume !(0 == ~tmp___6~0); {161530#true} is VALID [2022-04-15 18:25:15,102 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-15 18:25:15,102 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-15 18:25:15,102 INFO L290 TraceCheckUtils]: 98: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-15 18:25:15,102 INFO L290 TraceCheckUtils]: 99: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-15 18:25:15,102 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-15 18:25:15,102 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-15 18:25:15,102 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-15 18:25:15,103 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-15 18:25:15,103 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-15 18:25:15,103 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-15 18:25:15,103 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-15 18:25:15,103 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-15 18:25:15,103 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-15 18:25:15,103 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-15 18:25:15,103 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-15 18:25:15,103 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-15 18:25:15,103 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-15 18:25:15,104 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-15 18:25:15,104 INFO L290 TraceCheckUtils]: 114: Hoare triple {161530#true} assume 4432 == #t~mem62;havoc #t~mem62; {161530#true} is VALID [2022-04-15 18:25:15,104 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-15 18:25:15,104 INFO L290 TraceCheckUtils]: 116: Hoare triple {161530#true} assume !(5 == ~blastFlag~0); {161530#true} is VALID [2022-04-15 18:25:15,106 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-15 18:25:15,107 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-15 18:25:15,107 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-15 18:25:15,107 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-15 18:25:15,107 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-15 18:25:15,108 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-15 18:25:15,108 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-15 18:25:15,108 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-15 18:25:15,109 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-15 18:25:15,109 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-15 18:25:15,109 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-15 18:25:15,110 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-15 18:25:15,110 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-15 18:25:15,110 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-15 18:25:15,111 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-15 18:25:15,111 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-15 18:25:15,111 INFO L290 TraceCheckUtils]: 133: Hoare triple {161531#false} assume !(1 == ~blastFlag~0); {161531#false} is VALID [2022-04-15 18:25:15,111 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-15 18:25:15,111 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-15 18:25:15,111 INFO L290 TraceCheckUtils]: 136: Hoare triple {161531#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {161531#false} is VALID [2022-04-15 18:25:15,111 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-15 18:25:15,111 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-15 18:25:15,112 INFO L290 TraceCheckUtils]: 139: Hoare triple {161531#false} ~skip~0 := 0; {161531#false} is VALID [2022-04-15 18:25:15,112 INFO L290 TraceCheckUtils]: 140: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-15 18:25:15,112 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-15 18:25:15,112 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-15 18:25:15,112 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-15 18:25:15,112 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-15 18:25:15,112 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-15 18:25:15,112 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-15 18:25:15,112 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-15 18:25:15,112 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-15 18:25:15,113 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-15 18:25:15,113 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-15 18:25:15,113 INFO L290 TraceCheckUtils]: 151: Hoare triple {161531#false} assume 4400 == #t~mem58;havoc #t~mem58; {161531#false} is VALID [2022-04-15 18:25:15,113 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-15 18:25:15,113 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-15 18:25:15,113 INFO L290 TraceCheckUtils]: 154: Hoare triple {161531#false} assume !(2 == ~blastFlag~0); {161531#false} is VALID [2022-04-15 18:25:15,113 INFO L290 TraceCheckUtils]: 155: Hoare triple {161531#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {161531#false} is VALID [2022-04-15 18:25:15,113 INFO L290 TraceCheckUtils]: 156: Hoare triple {161531#false} assume !(~ret~0 <= 0); {161531#false} is VALID [2022-04-15 18:25:15,113 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-15 18:25:15,113 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-15 18:25:15,114 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-15 18:25:15,114 INFO L290 TraceCheckUtils]: 160: Hoare triple {161531#false} ~skip~0 := 0; {161531#false} is VALID [2022-04-15 18:25:15,114 INFO L290 TraceCheckUtils]: 161: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-15 18:25:15,114 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-15 18:25:15,114 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-15 18:25:15,114 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-15 18:25:15,114 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-15 18:25:15,114 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-15 18:25:15,114 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-15 18:25:15,114 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-15 18:25:15,115 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-15 18:25:15,115 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-15 18:25:15,115 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-15 18:25:15,115 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-15 18:25:15,115 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-15 18:25:15,115 INFO L290 TraceCheckUtils]: 174: Hoare triple {161531#false} assume 4416 == #t~mem60;havoc #t~mem60; {161531#false} is VALID [2022-04-15 18:25:15,115 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-15 18:25:15,115 INFO L290 TraceCheckUtils]: 176: Hoare triple {161531#false} assume !(3 == ~blastFlag~0); {161531#false} is VALID [2022-04-15 18:25:15,115 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-15 18:25:15,115 INFO L290 TraceCheckUtils]: 178: Hoare triple {161531#false} assume !(0 == ~tmp___6~0); {161531#false} is VALID [2022-04-15 18:25:15,116 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-15 18:25:15,116 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-15 18:25:15,116 INFO L290 TraceCheckUtils]: 181: Hoare triple {161531#false} ~skip~0 := 0; {161531#false} is VALID [2022-04-15 18:25:15,116 INFO L290 TraceCheckUtils]: 182: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-15 18:25:15,116 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-15 18:25:15,116 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-15 18:25:15,116 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-15 18:25:15,116 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-15 18:25:15,116 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-15 18:25:15,116 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-15 18:25:15,116 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-15 18:25:15,117 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-15 18:25:15,117 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-15 18:25:15,117 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-15 18:25:15,117 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-15 18:25:15,117 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-15 18:25:15,117 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-15 18:25:15,117 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-15 18:25:15,117 INFO L290 TraceCheckUtils]: 197: Hoare triple {161531#false} assume 4432 == #t~mem62;havoc #t~mem62; {161531#false} is VALID [2022-04-15 18:25:15,117 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-15 18:25:15,117 INFO L290 TraceCheckUtils]: 199: Hoare triple {161531#false} assume 5 == ~blastFlag~0; {161531#false} is VALID [2022-04-15 18:25:15,118 INFO L290 TraceCheckUtils]: 200: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-15 18:25:15,118 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-15 18:25:15,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:25:15,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816166590] [2022-04-15 18:25:15,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816166590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:25:15,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:25:15,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:25:15,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:25:15,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [674496621] [2022-04-15 18:25:15,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [674496621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:25:15,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:25:15,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:25:15,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129681918] [2022-04-15 18:25:15,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:25:15,120 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-15 18:25:15,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:25:15,121 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-15 18:25:15,214 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-15 18:25:15,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:25:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:25:15,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:25:15,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:25:15,216 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-15 18:25:17,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:25:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:25:19,197 INFO L93 Difference]: Finished difference Result 3286 states and 4942 transitions. [2022-04-15 18:25:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:25:19,197 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-15 18:25:19,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:25:19,198 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-15 18:25:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-15 18:25:19,200 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-15 18:25:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-15 18:25:19,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-04-15 18:25:19,501 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-15 18:25:19,647 INFO L225 Difference]: With dead ends: 3286 [2022-04-15 18:25:19,647 INFO L226 Difference]: Without dead ends: 1881 [2022-04-15 18:25:19,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:25:19,649 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 78 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:25:19,650 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.5s Time] [2022-04-15 18:25:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2022-04-15 18:25:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1535. [2022-04-15 18:25:19,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:25:19,762 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-15 18:25:19,763 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-15 18:25:19,764 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-15 18:25:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:25:19,862 INFO L93 Difference]: Finished difference Result 1881 states and 2808 transitions. [2022-04-15 18:25:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2808 transitions. [2022-04-15 18:25:19,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:25:19,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:25:19,866 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-15 18:25:19,867 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-15 18:25:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:25:19,989 INFO L93 Difference]: Finished difference Result 1881 states and 2808 transitions. [2022-04-15 18:25:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2808 transitions. [2022-04-15 18:25:19,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:25:19,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:25:19,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:25:19,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:25:20,001 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-15 18:25:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2322 transitions. [2022-04-15 18:25:20,086 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2322 transitions. Word has length 201 [2022-04-15 18:25:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:25:20,086 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2322 transitions. [2022-04-15 18:25:20,086 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-15 18:25:20,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2322 transitions. [2022-04-15 18:25:22,482 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-15 18:25:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2322 transitions. [2022-04-15 18:25:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-04-15 18:25:22,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:25:22,484 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-15 18:25:22,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 18:25:22,484 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:25:22,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:25:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash 255429711, now seen corresponding path program 1 times [2022-04-15 18:25:22,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:25:22,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1642163501] [2022-04-15 18:25:47,154 WARN L232 SmtUtils]: Spent 17.64s 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-15 18:25:57,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:25:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash 255429711, now seen corresponding path program 2 times [2022-04-15 18:25:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:25:57,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625795602] [2022-04-15 18:25:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:25:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:25:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:25:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:25:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:25:57,631 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-15 18:25:57,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {174946#true} assume true; {174946#true} is VALID [2022-04-15 18:25:57,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {174946#true} {174946#true} #593#return; {174946#true} is VALID [2022-04-15 18:25:57,632 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-15 18:25:57,632 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-15 18:25:57,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {174946#true} assume true; {174946#true} is VALID [2022-04-15 18:25:57,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174946#true} {174946#true} #593#return; {174946#true} is VALID [2022-04-15 18:25:57,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {174946#true} call #t~ret158 := main(); {174946#true} is VALID [2022-04-15 18:25:57,633 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-15 18:25:57,633 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-15 18:25:57,633 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-15 18:25:57,633 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-15 18:25:57,633 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-15 18:25:57,633 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-15 18:25:57,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-15 18:25:57,633 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-15 18:25:57,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {174946#true} assume 12292 == #t~mem49;havoc #t~mem49; {174946#true} is VALID [2022-04-15 18:25:57,634 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-15 18:25:57,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {174946#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {174946#true} is VALID [2022-04-15 18:25:57,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {174946#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {174946#true} is VALID [2022-04-15 18:25:57,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {174946#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {174946#true} is VALID [2022-04-15 18:25:57,634 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-15 18:25:57,634 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-15 18:25:57,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {174946#true} assume !(0 == ~tmp___4~0); {174946#true} is VALID [2022-04-15 18:25:57,634 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-15 18:25:57,634 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-15 18:25:57,634 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-15 18:25:57,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-15 18:25:57,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-15 18:25:57,635 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-15 18:25:57,635 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-15 18:25:57,635 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-15 18:25:57,635 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-15 18:25:57,635 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-15 18:25:57,635 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-15 18:25:57,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {174946#true} assume 4368 == #t~mem54;havoc #t~mem54; {174946#true} is VALID [2022-04-15 18:25:57,635 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-15 18:25:57,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {174946#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {174946#true} is VALID [2022-04-15 18:25:57,636 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-15 18:25:57,636 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-15 18:25:57,636 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-15 18:25:57,636 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-15 18:25:57,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-15 18:25:57,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-15 18:25:57,636 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-15 18:25:57,636 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-15 18:25:57,636 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-15 18:25:57,637 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-15 18:25:57,637 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-15 18:25:57,637 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-15 18:25:57,637 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-15 18:25:57,637 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-15 18:25:57,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {174946#true} assume 4384 == #t~mem56;havoc #t~mem56; {174946#true} is VALID [2022-04-15 18:25:57,637 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-15 18:25:57,637 INFO L290 TraceCheckUtils]: 51: Hoare triple {174946#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {174946#true} is VALID [2022-04-15 18:25:57,637 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-15 18:25:57,637 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-15 18:25:57,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {174946#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {174946#true} is VALID [2022-04-15 18:25:57,638 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-15 18:25:57,638 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-15 18:25:57,638 INFO L290 TraceCheckUtils]: 57: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-15 18:25:57,638 INFO L290 TraceCheckUtils]: 58: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-15 18:25:57,638 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-15 18:25:57,638 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-15 18:25:57,638 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-15 18:25:57,638 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-15 18:25:57,638 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-15 18:25:57,639 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-15 18:25:57,639 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-15 18:25:57,639 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-15 18:25:57,639 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-15 18:25:57,639 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-15 18:25:57,639 INFO L290 TraceCheckUtils]: 69: Hoare triple {174946#true} assume 4400 == #t~mem58;havoc #t~mem58; {174946#true} is VALID [2022-04-15 18:25:57,639 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-15 18:25:57,639 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-15 18:25:57,639 INFO L290 TraceCheckUtils]: 72: Hoare triple {174946#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {174946#true} is VALID [2022-04-15 18:25:57,639 INFO L290 TraceCheckUtils]: 73: Hoare triple {174946#true} assume !(~ret~0 <= 0); {174946#true} is VALID [2022-04-15 18:25:57,639 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-15 18:25:57,640 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-15 18:25:57,640 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-15 18:25:57,640 INFO L290 TraceCheckUtils]: 77: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-15 18:25:57,640 INFO L290 TraceCheckUtils]: 78: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-15 18:25:57,640 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-15 18:25:57,640 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-15 18:25:57,640 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-15 18:25:57,640 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-15 18:25:57,640 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-15 18:25:57,640 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-15 18:25:57,641 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-15 18:25:57,641 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-15 18:25:57,641 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-15 18:25:57,641 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-15 18:25:57,641 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-15 18:25:57,641 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-15 18:25:57,641 INFO L290 TraceCheckUtils]: 91: Hoare triple {174946#true} assume 4416 == #t~mem60;havoc #t~mem60; {174946#true} is VALID [2022-04-15 18:25:57,641 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-15 18:25:57,641 INFO L290 TraceCheckUtils]: 93: Hoare triple {174946#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {174946#true} is VALID [2022-04-15 18:25:57,641 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-15 18:25:57,642 INFO L290 TraceCheckUtils]: 95: Hoare triple {174946#true} assume !(0 == ~tmp___6~0); {174946#true} is VALID [2022-04-15 18:25:57,642 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-15 18:25:57,642 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-15 18:25:57,642 INFO L290 TraceCheckUtils]: 98: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-15 18:25:57,642 INFO L290 TraceCheckUtils]: 99: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-15 18:25:57,642 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-15 18:25:57,642 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-15 18:25:57,642 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-15 18:25:57,642 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-15 18:25:57,642 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-15 18:25:57,643 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-15 18:25:57,643 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-15 18:25:57,643 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-15 18:25:57,643 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-15 18:25:57,643 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-15 18:25:57,643 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-15 18:25:57,643 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-15 18:25:57,643 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-15 18:25:57,643 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-15 18:25:57,643 INFO L290 TraceCheckUtils]: 114: Hoare triple {174946#true} assume 4432 == #t~mem62;havoc #t~mem62; {174946#true} is VALID [2022-04-15 18:25:57,643 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-15 18:25:57,644 INFO L290 TraceCheckUtils]: 116: Hoare triple {174946#true} assume !(5 == ~blastFlag~0); {174946#true} is VALID [2022-04-15 18:25:57,645 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-15 18:25:57,645 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-15 18:25:57,645 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-15 18:25:57,646 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-15 18:25:57,646 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-15 18:25:57,646 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-15 18:25:57,647 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-15 18:25:57,647 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-15 18:25:57,647 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-15 18:25:57,648 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-15 18:25:57,648 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-15 18:25:57,648 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-15 18:25:57,649 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-15 18:25:57,649 INFO L290 TraceCheckUtils]: 130: Hoare triple {174947#false} assume !(0 == ~blastFlag~0); {174947#false} is VALID [2022-04-15 18:25:57,649 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-15 18:25:57,649 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-15 18:25:57,649 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-15 18:25:57,649 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-15 18:25:57,649 INFO L290 TraceCheckUtils]: 135: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-15 18:25:57,649 INFO L290 TraceCheckUtils]: 136: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-15 18:25:57,649 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-15 18:25:57,649 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-15 18:25:57,650 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-15 18:25:57,650 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-15 18:25:57,650 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-15 18:25:57,650 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-15 18:25:57,650 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-15 18:25:57,650 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-15 18:25:57,650 INFO L290 TraceCheckUtils]: 145: Hoare triple {174947#false} assume 4384 == #t~mem56;havoc #t~mem56; {174947#false} is VALID [2022-04-15 18:25:57,650 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-15 18:25:57,650 INFO L290 TraceCheckUtils]: 147: Hoare triple {174947#false} assume !(1 == ~blastFlag~0); {174947#false} is VALID [2022-04-15 18:25:57,650 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-15 18:25:57,650 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-15 18:25:57,651 INFO L290 TraceCheckUtils]: 150: Hoare triple {174947#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {174947#false} is VALID [2022-04-15 18:25:57,651 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-15 18:25:57,651 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-15 18:25:57,651 INFO L290 TraceCheckUtils]: 153: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-15 18:25:57,651 INFO L290 TraceCheckUtils]: 154: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-15 18:25:57,651 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-15 18:25:57,651 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-15 18:25:57,651 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-15 18:25:57,651 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-15 18:25:57,651 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-15 18:25:57,651 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-15 18:25:57,652 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-15 18:25:57,652 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-15 18:25:57,652 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-15 18:25:57,652 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-15 18:25:57,652 INFO L290 TraceCheckUtils]: 165: Hoare triple {174947#false} assume 4400 == #t~mem58;havoc #t~mem58; {174947#false} is VALID [2022-04-15 18:25:57,652 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-15 18:25:57,652 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-15 18:25:57,652 INFO L290 TraceCheckUtils]: 168: Hoare triple {174947#false} assume !(2 == ~blastFlag~0); {174947#false} is VALID [2022-04-15 18:25:57,652 INFO L290 TraceCheckUtils]: 169: Hoare triple {174947#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {174947#false} is VALID [2022-04-15 18:25:57,652 INFO L290 TraceCheckUtils]: 170: Hoare triple {174947#false} assume !(~ret~0 <= 0); {174947#false} is VALID [2022-04-15 18:25:57,653 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-15 18:25:57,653 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-15 18:25:57,653 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-15 18:25:57,653 INFO L290 TraceCheckUtils]: 174: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-15 18:25:57,653 INFO L290 TraceCheckUtils]: 175: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-15 18:25:57,653 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-15 18:25:57,653 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-15 18:25:57,653 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-15 18:25:57,653 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-15 18:25:57,653 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-15 18:25:57,654 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-15 18:25:57,654 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-15 18:25:57,654 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-15 18:25:57,654 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-15 18:25:57,654 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-15 18:25:57,654 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-15 18:25:57,654 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-15 18:25:57,654 INFO L290 TraceCheckUtils]: 188: Hoare triple {174947#false} assume 4416 == #t~mem60;havoc #t~mem60; {174947#false} is VALID [2022-04-15 18:25:57,654 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-15 18:25:57,654 INFO L290 TraceCheckUtils]: 190: Hoare triple {174947#false} assume !(3 == ~blastFlag~0); {174947#false} is VALID [2022-04-15 18:25:57,654 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-15 18:25:57,655 INFO L290 TraceCheckUtils]: 192: Hoare triple {174947#false} assume !(0 == ~tmp___6~0); {174947#false} is VALID [2022-04-15 18:25:57,655 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-15 18:25:57,655 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-15 18:25:57,655 INFO L290 TraceCheckUtils]: 195: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-15 18:25:57,655 INFO L290 TraceCheckUtils]: 196: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-15 18:25:57,655 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-15 18:25:57,655 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-15 18:25:57,655 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-15 18:25:57,655 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-15 18:25:57,655 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-15 18:25:57,656 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-15 18:25:57,656 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-15 18:25:57,656 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-15 18:25:57,656 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-15 18:25:57,656 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-15 18:25:57,656 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-15 18:25:57,656 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-15 18:25:57,656 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-15 18:25:57,656 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-15 18:25:57,656 INFO L290 TraceCheckUtils]: 211: Hoare triple {174947#false} assume 4432 == #t~mem62;havoc #t~mem62; {174947#false} is VALID [2022-04-15 18:25:57,657 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-15 18:25:57,657 INFO L290 TraceCheckUtils]: 213: Hoare triple {174947#false} assume 5 == ~blastFlag~0; {174947#false} is VALID [2022-04-15 18:25:57,657 INFO L290 TraceCheckUtils]: 214: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-15 18:25:57,657 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-15 18:25:57,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:25:57,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625795602] [2022-04-15 18:25:57,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625795602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:25:57,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:25:57,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:25:57,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:25:57,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1642163501] [2022-04-15 18:25:57,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1642163501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:25:57,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:25:57,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:25:57,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326035120] [2022-04-15 18:25:57,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:25:57,659 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-15 18:25:57,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:25:57,660 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-15 18:25:57,747 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-15 18:25:57,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:25:57,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:25:57,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:25:57,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:25:57,748 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-15 18:25:59,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:26:01,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:26:01,622 INFO L93 Difference]: Finished difference Result 3285 states and 4956 transitions. [2022-04-15 18:26:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:26:01,623 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-15 18:26:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:26:01,623 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-15 18:26:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-15 18:26:01,625 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-15 18:26:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-15 18:26:01,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 468 transitions. [2022-04-15 18:26:01,955 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-15 18:26:02,118 INFO L225 Difference]: With dead ends: 3285 [2022-04-15 18:26:02,118 INFO L226 Difference]: Without dead ends: 2009 [2022-04-15 18:26:02,119 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:26:02,120 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-15 18:26:02,120 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-15 18:26:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2022-04-15 18:26:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1535. [2022-04-15 18:26:02,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:26:02,239 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-15 18:26:02,240 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-15 18:26:02,240 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-15 18:26:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:26:02,349 INFO L93 Difference]: Finished difference Result 2009 states and 2992 transitions. [2022-04-15 18:26:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2992 transitions. [2022-04-15 18:26:02,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:26:02,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:26:02,352 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-15 18:26:02,353 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-15 18:26:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:26:02,461 INFO L93 Difference]: Finished difference Result 2009 states and 2992 transitions. [2022-04-15 18:26:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2992 transitions. [2022-04-15 18:26:02,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:26:02,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:26:02,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:26:02,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:26:02,465 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-15 18:26:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2294 transitions. [2022-04-15 18:26:02,552 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2294 transitions. Word has length 215 [2022-04-15 18:26:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:26:02,552 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2294 transitions. [2022-04-15 18:26:02,552 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-15 18:26:02,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2294 transitions. [2022-04-15 18:26:04,987 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-15 18:26:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2294 transitions. [2022-04-15 18:26:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-04-15 18:26:04,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:26:04,989 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-15 18:26:04,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 18:26:04,989 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:26:04,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:26:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash 69910624, now seen corresponding path program 1 times [2022-04-15 18:26:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:26:04,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [244493680] [2022-04-15 18:26:19,165 WARN L232 SmtUtils]: Spent 8.52s 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-15 18:26:27,807 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:26:27,807 INFO L85 PathProgramCache]: Analyzing trace with hash 69910624, now seen corresponding path program 2 times [2022-04-15 18:26:27,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:26:27,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094724938] [2022-04-15 18:26:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:26:27,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:26:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:26:28,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:26:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:26:28,044 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-15 18:26:28,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {188616#true} assume true; {188616#true} is VALID [2022-04-15 18:26:28,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {188616#true} {188616#true} #593#return; {188616#true} is VALID [2022-04-15 18:26:28,045 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-15 18:26:28,045 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-15 18:26:28,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {188616#true} assume true; {188616#true} is VALID [2022-04-15 18:26:28,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188616#true} {188616#true} #593#return; {188616#true} is VALID [2022-04-15 18:26:28,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {188616#true} call #t~ret158 := main(); {188616#true} is VALID [2022-04-15 18:26:28,045 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-15 18:26:28,046 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-15 18:26:28,046 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-15 18:26:28,046 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-15 18:26:28,046 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-15 18:26:28,046 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-15 18:26:28,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-15 18:26:28,046 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-15 18:26:28,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {188616#true} assume 12292 == #t~mem49;havoc #t~mem49; {188616#true} is VALID [2022-04-15 18:26:28,046 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-15 18:26:28,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {188616#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {188616#true} is VALID [2022-04-15 18:26:28,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {188616#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {188616#true} is VALID [2022-04-15 18:26:28,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {188616#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {188616#true} is VALID [2022-04-15 18:26:28,047 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-15 18:26:28,047 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-15 18:26:28,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {188616#true} assume !(0 == ~tmp___4~0); {188616#true} is VALID [2022-04-15 18:26:28,047 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-15 18:26:28,047 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-15 18:26:28,047 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-15 18:26:28,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-15 18:26:28,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-15 18:26:28,047 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-15 18:26:28,048 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-15 18:26:28,048 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-15 18:26:28,048 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-15 18:26:28,048 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-15 18:26:28,048 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-15 18:26:28,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {188616#true} assume 4368 == #t~mem54;havoc #t~mem54; {188616#true} is VALID [2022-04-15 18:26:28,048 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-15 18:26:28,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {188616#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {188616#true} is VALID [2022-04-15 18:26:28,048 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-15 18:26:28,048 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-15 18:26:28,049 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-15 18:26:28,049 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-15 18:26:28,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-15 18:26:28,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-15 18:26:28,049 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-15 18:26:28,049 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-15 18:26:28,049 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-15 18:26:28,049 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-15 18:26:28,049 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-15 18:26:28,049 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-15 18:26:28,050 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-15 18:26:28,050 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-15 18:26:28,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {188616#true} assume 4384 == #t~mem56;havoc #t~mem56; {188616#true} is VALID [2022-04-15 18:26:28,050 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-15 18:26:28,050 INFO L290 TraceCheckUtils]: 51: Hoare triple {188616#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {188616#true} is VALID [2022-04-15 18:26:28,050 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-15 18:26:28,050 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-15 18:26:28,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {188616#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {188616#true} is VALID [2022-04-15 18:26:28,050 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-15 18:26:28,050 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-15 18:26:28,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-15 18:26:28,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-15 18:26:28,051 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-15 18:26:28,051 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-15 18:26:28,051 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-15 18:26:28,051 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-15 18:26:28,051 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-15 18:26:28,051 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-15 18:26:28,051 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-15 18:26:28,051 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-15 18:26:28,052 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-15 18:26:28,052 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-15 18:26:28,052 INFO L290 TraceCheckUtils]: 69: Hoare triple {188616#true} assume 4400 == #t~mem58;havoc #t~mem58; {188616#true} is VALID [2022-04-15 18:26:28,052 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-15 18:26:28,052 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-15 18:26:28,052 INFO L290 TraceCheckUtils]: 72: Hoare triple {188616#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {188616#true} is VALID [2022-04-15 18:26:28,052 INFO L290 TraceCheckUtils]: 73: Hoare triple {188616#true} assume !(~ret~0 <= 0); {188616#true} is VALID [2022-04-15 18:26:28,052 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-15 18:26:28,052 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-15 18:26:28,052 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-15 18:26:28,052 INFO L290 TraceCheckUtils]: 77: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-15 18:26:28,053 INFO L290 TraceCheckUtils]: 78: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-15 18:26:28,053 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-15 18:26:28,053 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-15 18:26:28,053 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-15 18:26:28,053 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-15 18:26:28,053 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-15 18:26:28,053 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-15 18:26:28,053 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-15 18:26:28,053 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-15 18:26:28,053 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-15 18:26:28,054 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-15 18:26:28,054 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-15 18:26:28,054 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-15 18:26:28,054 INFO L290 TraceCheckUtils]: 91: Hoare triple {188616#true} assume 4416 == #t~mem60;havoc #t~mem60; {188616#true} is VALID [2022-04-15 18:26:28,054 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-15 18:26:28,054 INFO L290 TraceCheckUtils]: 93: Hoare triple {188616#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {188616#true} is VALID [2022-04-15 18:26:28,054 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-15 18:26:28,054 INFO L290 TraceCheckUtils]: 95: Hoare triple {188616#true} assume !(0 == ~tmp___6~0); {188616#true} is VALID [2022-04-15 18:26:28,054 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-15 18:26:28,054 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-15 18:26:28,054 INFO L290 TraceCheckUtils]: 98: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-15 18:26:28,055 INFO L290 TraceCheckUtils]: 99: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-15 18:26:28,055 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-15 18:26:28,055 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-15 18:26:28,055 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-15 18:26:28,055 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-15 18:26:28,055 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-15 18:26:28,055 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-15 18:26:28,055 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-15 18:26:28,055 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-15 18:26:28,055 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-15 18:26:28,056 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-15 18:26:28,056 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-15 18:26:28,056 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-15 18:26:28,056 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-15 18:26:28,056 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-15 18:26:28,056 INFO L290 TraceCheckUtils]: 114: Hoare triple {188616#true} assume 4432 == #t~mem62;havoc #t~mem62; {188616#true} is VALID [2022-04-15 18:26:28,056 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-15 18:26:28,056 INFO L290 TraceCheckUtils]: 116: Hoare triple {188616#true} assume !(5 == ~blastFlag~0); {188616#true} is VALID [2022-04-15 18:26:28,057 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-15 18:26:28,058 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-15 18:26:28,058 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-15 18:26:28,058 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-15 18:26:28,059 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-15 18:26:28,059 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-15 18:26:28,059 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-15 18:26:28,060 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-15 18:26:28,060 INFO L290 TraceCheckUtils]: 125: Hoare triple {188617#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {188617#false} is VALID [2022-04-15 18:26:28,060 INFO L290 TraceCheckUtils]: 126: Hoare triple {188617#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {188617#false} is VALID [2022-04-15 18:26:28,060 INFO L290 TraceCheckUtils]: 127: Hoare triple {188617#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {188617#false} is VALID [2022-04-15 18:26:28,060 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-15 18:26:28,060 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-15 18:26:28,060 INFO L290 TraceCheckUtils]: 130: Hoare triple {188617#false} assume !(0 == ~tmp___4~0); {188617#false} is VALID [2022-04-15 18:26:28,060 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-15 18:26:28,061 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-15 18:26:28,061 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-15 18:26:28,061 INFO L290 TraceCheckUtils]: 134: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-15 18:26:28,061 INFO L290 TraceCheckUtils]: 135: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-15 18:26:28,061 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-15 18:26:28,061 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-15 18:26:28,061 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-15 18:26:28,061 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-15 18:26:28,061 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-15 18:26:28,061 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-15 18:26:28,061 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-15 18:26:28,062 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-15 18:26:28,062 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-15 18:26:28,062 INFO L290 TraceCheckUtils]: 145: Hoare triple {188617#false} assume 4385 == #t~mem57;havoc #t~mem57; {188617#false} is VALID [2022-04-15 18:26:28,062 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-15 18:26:28,062 INFO L290 TraceCheckUtils]: 147: Hoare triple {188617#false} assume !(1 == ~blastFlag~0); {188617#false} is VALID [2022-04-15 18:26:28,062 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-15 18:26:28,062 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-15 18:26:28,062 INFO L290 TraceCheckUtils]: 150: Hoare triple {188617#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {188617#false} is VALID [2022-04-15 18:26:28,062 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-15 18:26:28,062 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-15 18:26:28,063 INFO L290 TraceCheckUtils]: 153: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-15 18:26:28,063 INFO L290 TraceCheckUtils]: 154: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-15 18:26:28,063 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-15 18:26:28,063 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-15 18:26:28,063 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-15 18:26:28,063 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-15 18:26:28,063 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-15 18:26:28,063 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-15 18:26:28,063 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-15 18:26:28,063 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-15 18:26:28,063 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-15 18:26:28,064 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-15 18:26:28,064 INFO L290 TraceCheckUtils]: 165: Hoare triple {188617#false} assume 4400 == #t~mem58;havoc #t~mem58; {188617#false} is VALID [2022-04-15 18:26:28,064 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-15 18:26:28,064 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-15 18:26:28,064 INFO L290 TraceCheckUtils]: 168: Hoare triple {188617#false} assume !(2 == ~blastFlag~0); {188617#false} is VALID [2022-04-15 18:26:28,064 INFO L290 TraceCheckUtils]: 169: Hoare triple {188617#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {188617#false} is VALID [2022-04-15 18:26:28,064 INFO L290 TraceCheckUtils]: 170: Hoare triple {188617#false} assume !(~ret~0 <= 0); {188617#false} is VALID [2022-04-15 18:26:28,064 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-15 18:26:28,064 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-15 18:26:28,064 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-15 18:26:28,065 INFO L290 TraceCheckUtils]: 174: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-15 18:26:28,065 INFO L290 TraceCheckUtils]: 175: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-15 18:26:28,065 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-15 18:26:28,065 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-15 18:26:28,065 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-15 18:26:28,065 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-15 18:26:28,065 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-15 18:26:28,065 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-15 18:26:28,065 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-15 18:26:28,065 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-15 18:26:28,065 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-15 18:26:28,066 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-15 18:26:28,066 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-15 18:26:28,066 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-15 18:26:28,066 INFO L290 TraceCheckUtils]: 188: Hoare triple {188617#false} assume 4416 == #t~mem60;havoc #t~mem60; {188617#false} is VALID [2022-04-15 18:26:28,066 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-15 18:26:28,066 INFO L290 TraceCheckUtils]: 190: Hoare triple {188617#false} assume !(3 == ~blastFlag~0); {188617#false} is VALID [2022-04-15 18:26:28,066 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-15 18:26:28,066 INFO L290 TraceCheckUtils]: 192: Hoare triple {188617#false} assume !(0 == ~tmp___6~0); {188617#false} is VALID [2022-04-15 18:26:28,066 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-15 18:26:28,066 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-15 18:26:28,067 INFO L290 TraceCheckUtils]: 195: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-15 18:26:28,067 INFO L290 TraceCheckUtils]: 196: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-15 18:26:28,067 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-15 18:26:28,067 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-15 18:26:28,067 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-15 18:26:28,067 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-15 18:26:28,067 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-15 18:26:28,067 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-15 18:26:28,067 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-15 18:26:28,067 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-15 18:26:28,067 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-15 18:26:28,068 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-15 18:26:28,068 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-15 18:26:28,068 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-15 18:26:28,068 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-15 18:26:28,068 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-15 18:26:28,068 INFO L290 TraceCheckUtils]: 211: Hoare triple {188617#false} assume 4432 == #t~mem62;havoc #t~mem62; {188617#false} is VALID [2022-04-15 18:26:28,068 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-15 18:26:28,068 INFO L290 TraceCheckUtils]: 213: Hoare triple {188617#false} assume 5 == ~blastFlag~0; {188617#false} is VALID [2022-04-15 18:26:28,068 INFO L290 TraceCheckUtils]: 214: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-15 18:26:28,069 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-15 18:26:28,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:26:28,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094724938] [2022-04-15 18:26:28,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094724938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:26:28,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:26:28,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:26:28,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:26:28,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [244493680] [2022-04-15 18:26:28,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [244493680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:26:28,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:26:28,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:26:28,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121545345] [2022-04-15 18:26:28,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:26:28,071 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-15 18:26:28,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:26:28,072 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-15 18:26:28,164 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-15 18:26:28,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:26:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:26:28,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:26:28,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:26:28,165 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-15 18:26:31,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:26:33,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:26:35,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:26:37,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:26:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:26:39,793 INFO L93 Difference]: Finished difference Result 3383 states and 5036 transitions. [2022-04-15 18:26:39,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:26:39,794 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-15 18:26:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:26:39,794 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-15 18:26:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 18:26:39,796 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-15 18:26:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 18:26:39,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-15 18:26:40,088 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-15 18:26:40,229 INFO L225 Difference]: With dead ends: 3383 [2022-04-15 18:26:40,230 INFO L226 Difference]: Without dead ends: 1864 [2022-04-15 18:26:40,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:26:40,232 INFO L913 BasicCegarLoop]: 220 mSDtfsCounter, 81 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:26:40,232 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 530 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 493 Invalid, 3 Unknown, 0 Unchecked, 8.1s Time] [2022-04-15 18:26:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-04-15 18:26:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1535. [2022-04-15 18:26:40,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:26:40,356 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-15 18:26:40,357 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-15 18:26:40,358 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-15 18:26:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:26:40,448 INFO L93 Difference]: Finished difference Result 1864 states and 2756 transitions. [2022-04-15 18:26:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2756 transitions. [2022-04-15 18:26:40,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:26:40,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:26:40,451 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-15 18:26:40,452 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-15 18:26:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:26:40,549 INFO L93 Difference]: Finished difference Result 1864 states and 2756 transitions. [2022-04-15 18:26:40,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2756 transitions. [2022-04-15 18:26:40,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:26:40,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:26:40,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:26:40,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:26:40,552 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-15 18:26:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2288 transitions. [2022-04-15 18:26:40,639 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2288 transitions. Word has length 215 [2022-04-15 18:26:40,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:26:40,639 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2288 transitions. [2022-04-15 18:26:40,640 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-15 18:26:40,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2288 transitions. [2022-04-15 18:26:43,127 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-15 18:26:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2288 transitions. [2022-04-15 18:26:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-04-15 18:26:43,140 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:26:43,140 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-15 18:26:43,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 18:26:43,140 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:26:43,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:26:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash -231635715, now seen corresponding path program 1 times [2022-04-15 18:26:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:26:43,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1631072756] [2022-04-15 18:26:52,995 WARN L232 SmtUtils]: Spent 8.74s 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-15 18:27:07,190 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:27:07,190 INFO L85 PathProgramCache]: Analyzing trace with hash -231635715, now seen corresponding path program 2 times [2022-04-15 18:27:07,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:27:07,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557502443] [2022-04-15 18:27:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:27:07,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:27:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:27:07,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:27:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:27:07,444 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-15 18:27:07,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {202192#true} assume true; {202192#true} is VALID [2022-04-15 18:27:07,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {202192#true} {202192#true} #593#return; {202192#true} is VALID [2022-04-15 18:27:07,445 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-15 18:27:07,445 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-15 18:27:07,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {202192#true} assume true; {202192#true} is VALID [2022-04-15 18:27:07,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202192#true} {202192#true} #593#return; {202192#true} is VALID [2022-04-15 18:27:07,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {202192#true} call #t~ret158 := main(); {202192#true} is VALID [2022-04-15 18:27:07,445 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-15 18:27:07,446 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-15 18:27:07,446 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-15 18:27:07,446 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-15 18:27:07,446 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-15 18:27:07,446 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-15 18:27:07,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-15 18:27:07,446 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-15 18:27:07,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {202192#true} assume 12292 == #t~mem49;havoc #t~mem49; {202192#true} is VALID [2022-04-15 18:27:07,446 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-15 18:27:07,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {202192#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {202192#true} is VALID [2022-04-15 18:27:07,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {202192#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {202192#true} is VALID [2022-04-15 18:27:07,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {202192#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {202192#true} is VALID [2022-04-15 18:27:07,447 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-15 18:27:07,447 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-15 18:27:07,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {202192#true} assume !(0 == ~tmp___4~0); {202192#true} is VALID [2022-04-15 18:27:07,447 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-15 18:27:07,447 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-15 18:27:07,447 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-15 18:27:07,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-15 18:27:07,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-15 18:27:07,447 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-15 18:27:07,448 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-15 18:27:07,448 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-15 18:27:07,448 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-15 18:27:07,448 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-15 18:27:07,448 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-15 18:27:07,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {202192#true} assume 4368 == #t~mem54;havoc #t~mem54; {202192#true} is VALID [2022-04-15 18:27:07,448 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-15 18:27:07,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {202192#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {202192#true} is VALID [2022-04-15 18:27:07,448 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-15 18:27:07,448 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-15 18:27:07,448 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-15 18:27:07,449 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-15 18:27:07,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-15 18:27:07,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-15 18:27:07,449 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-15 18:27:07,449 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-15 18:27:07,449 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-15 18:27:07,449 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-15 18:27:07,449 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-15 18:27:07,449 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-15 18:27:07,449 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-15 18:27:07,450 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-15 18:27:07,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {202192#true} assume 4384 == #t~mem56;havoc #t~mem56; {202192#true} is VALID [2022-04-15 18:27:07,450 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-15 18:27:07,450 INFO L290 TraceCheckUtils]: 51: Hoare triple {202192#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {202192#true} is VALID [2022-04-15 18:27:07,450 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-15 18:27:07,450 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-15 18:27:07,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {202192#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {202192#true} is VALID [2022-04-15 18:27:07,450 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-15 18:27:07,450 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-15 18:27:07,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-15 18:27:07,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-15 18:27:07,451 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-15 18:27:07,451 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-15 18:27:07,451 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-15 18:27:07,451 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-15 18:27:07,451 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-15 18:27:07,451 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-15 18:27:07,451 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-15 18:27:07,451 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-15 18:27:07,451 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-15 18:27:07,451 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-15 18:27:07,452 INFO L290 TraceCheckUtils]: 69: Hoare triple {202192#true} assume 4400 == #t~mem58;havoc #t~mem58; {202192#true} is VALID [2022-04-15 18:27:07,452 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-15 18:27:07,452 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-15 18:27:07,452 INFO L290 TraceCheckUtils]: 72: Hoare triple {202192#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {202192#true} is VALID [2022-04-15 18:27:07,452 INFO L290 TraceCheckUtils]: 73: Hoare triple {202192#true} assume !(~ret~0 <= 0); {202192#true} is VALID [2022-04-15 18:27:07,452 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-15 18:27:07,452 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-15 18:27:07,452 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-15 18:27:07,452 INFO L290 TraceCheckUtils]: 77: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-15 18:27:07,452 INFO L290 TraceCheckUtils]: 78: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-15 18:27:07,452 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-15 18:27:07,453 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-15 18:27:07,453 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-15 18:27:07,453 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-15 18:27:07,453 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-15 18:27:07,453 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-15 18:27:07,453 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-15 18:27:07,453 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-15 18:27:07,453 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-15 18:27:07,453 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-15 18:27:07,453 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-15 18:27:07,453 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-15 18:27:07,454 INFO L290 TraceCheckUtils]: 91: Hoare triple {202192#true} assume 4416 == #t~mem60;havoc #t~mem60; {202192#true} is VALID [2022-04-15 18:27:07,454 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-15 18:27:07,454 INFO L290 TraceCheckUtils]: 93: Hoare triple {202192#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {202192#true} is VALID [2022-04-15 18:27:07,454 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-15 18:27:07,454 INFO L290 TraceCheckUtils]: 95: Hoare triple {202192#true} assume !(0 == ~tmp___6~0); {202192#true} is VALID [2022-04-15 18:27:07,454 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-15 18:27:07,454 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-15 18:27:07,454 INFO L290 TraceCheckUtils]: 98: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-15 18:27:07,454 INFO L290 TraceCheckUtils]: 99: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-15 18:27:07,454 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-15 18:27:07,454 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-15 18:27:07,455 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-15 18:27:07,455 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-15 18:27:07,455 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-15 18:27:07,455 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-15 18:27:07,455 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-15 18:27:07,455 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-15 18:27:07,455 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-15 18:27:07,455 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-15 18:27:07,455 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-15 18:27:07,455 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-15 18:27:07,456 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-15 18:27:07,456 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-15 18:27:07,456 INFO L290 TraceCheckUtils]: 114: Hoare triple {202192#true} assume 4432 == #t~mem62;havoc #t~mem62; {202192#true} is VALID [2022-04-15 18:27:07,456 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-15 18:27:07,456 INFO L290 TraceCheckUtils]: 116: Hoare triple {202192#true} assume !(5 == ~blastFlag~0); {202192#true} is VALID [2022-04-15 18:27:07,457 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-15 18:27:07,458 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-15 18:27:07,458 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-15 18:27:07,458 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-15 18:27:07,458 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-15 18:27:07,459 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-15 18:27:07,459 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-15 18:27:07,460 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-15 18:27:07,460 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-15 18:27:07,460 INFO L290 TraceCheckUtils]: 126: Hoare triple {202193#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {202193#false} is VALID [2022-04-15 18:27:07,460 INFO L290 TraceCheckUtils]: 127: Hoare triple {202193#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {202193#false} is VALID [2022-04-15 18:27:07,460 INFO L290 TraceCheckUtils]: 128: Hoare triple {202193#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {202193#false} is VALID [2022-04-15 18:27:07,460 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-15 18:27:07,461 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-15 18:27:07,461 INFO L290 TraceCheckUtils]: 131: Hoare triple {202193#false} assume !(0 == ~tmp___4~0); {202193#false} is VALID [2022-04-15 18:27:07,461 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-15 18:27:07,461 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-15 18:27:07,461 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-15 18:27:07,461 INFO L290 TraceCheckUtils]: 135: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-15 18:27:07,461 INFO L290 TraceCheckUtils]: 136: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-15 18:27:07,461 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-15 18:27:07,461 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-15 18:27:07,461 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-15 18:27:07,461 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-15 18:27:07,462 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-15 18:27:07,462 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-15 18:27:07,462 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-15 18:27:07,462 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-15 18:27:07,462 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-15 18:27:07,462 INFO L290 TraceCheckUtils]: 146: Hoare triple {202193#false} assume 4385 == #t~mem57;havoc #t~mem57; {202193#false} is VALID [2022-04-15 18:27:07,462 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-15 18:27:07,462 INFO L290 TraceCheckUtils]: 148: Hoare triple {202193#false} assume !(1 == ~blastFlag~0); {202193#false} is VALID [2022-04-15 18:27:07,462 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-15 18:27:07,462 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-15 18:27:07,463 INFO L290 TraceCheckUtils]: 151: Hoare triple {202193#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {202193#false} is VALID [2022-04-15 18:27:07,463 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-15 18:27:07,463 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-15 18:27:07,463 INFO L290 TraceCheckUtils]: 154: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-15 18:27:07,463 INFO L290 TraceCheckUtils]: 155: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-15 18:27:07,463 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-15 18:27:07,463 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-15 18:27:07,463 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-15 18:27:07,463 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-15 18:27:07,463 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-15 18:27:07,463 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-15 18:27:07,464 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-15 18:27:07,464 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-15 18:27:07,464 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-15 18:27:07,464 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-15 18:27:07,464 INFO L290 TraceCheckUtils]: 166: Hoare triple {202193#false} assume 4400 == #t~mem58;havoc #t~mem58; {202193#false} is VALID [2022-04-15 18:27:07,464 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-15 18:27:07,464 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-15 18:27:07,464 INFO L290 TraceCheckUtils]: 169: Hoare triple {202193#false} assume !(2 == ~blastFlag~0); {202193#false} is VALID [2022-04-15 18:27:07,464 INFO L290 TraceCheckUtils]: 170: Hoare triple {202193#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {202193#false} is VALID [2022-04-15 18:27:07,464 INFO L290 TraceCheckUtils]: 171: Hoare triple {202193#false} assume !(~ret~0 <= 0); {202193#false} is VALID [2022-04-15 18:27:07,464 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-15 18:27:07,465 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-15 18:27:07,465 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-15 18:27:07,465 INFO L290 TraceCheckUtils]: 175: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-15 18:27:07,465 INFO L290 TraceCheckUtils]: 176: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-15 18:27:07,465 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-15 18:27:07,465 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-15 18:27:07,465 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-15 18:27:07,465 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-15 18:27:07,465 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-15 18:27:07,465 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-15 18:27:07,466 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-15 18:27:07,466 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-15 18:27:07,466 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-15 18:27:07,466 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-15 18:27:07,466 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-15 18:27:07,466 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-15 18:27:07,466 INFO L290 TraceCheckUtils]: 189: Hoare triple {202193#false} assume 4416 == #t~mem60;havoc #t~mem60; {202193#false} is VALID [2022-04-15 18:27:07,466 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-15 18:27:07,466 INFO L290 TraceCheckUtils]: 191: Hoare triple {202193#false} assume !(3 == ~blastFlag~0); {202193#false} is VALID [2022-04-15 18:27:07,466 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-15 18:27:07,467 INFO L290 TraceCheckUtils]: 193: Hoare triple {202193#false} assume !(0 == ~tmp___6~0); {202193#false} is VALID [2022-04-15 18:27:07,467 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-15 18:27:07,467 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-15 18:27:07,467 INFO L290 TraceCheckUtils]: 196: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-15 18:27:07,467 INFO L290 TraceCheckUtils]: 197: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-15 18:27:07,467 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-15 18:27:07,467 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-15 18:27:07,467 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-15 18:27:07,467 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-15 18:27:07,468 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-15 18:27:07,468 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-15 18:27:07,468 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-15 18:27:07,468 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-15 18:27:07,468 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-15 18:27:07,468 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-15 18:27:07,468 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-15 18:27:07,468 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-15 18:27:07,468 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-15 18:27:07,468 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-15 18:27:07,468 INFO L290 TraceCheckUtils]: 212: Hoare triple {202193#false} assume 4432 == #t~mem62;havoc #t~mem62; {202193#false} is VALID [2022-04-15 18:27:07,469 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-15 18:27:07,469 INFO L290 TraceCheckUtils]: 214: Hoare triple {202193#false} assume 5 == ~blastFlag~0; {202193#false} is VALID [2022-04-15 18:27:07,469 INFO L290 TraceCheckUtils]: 215: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-15 18:27:07,469 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-15 18:27:07,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:27:07,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557502443] [2022-04-15 18:27:07,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557502443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:27:07,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:27:07,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:27:07,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:27:07,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1631072756] [2022-04-15 18:27:07,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1631072756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:27:07,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:27:07,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:27:07,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111858282] [2022-04-15 18:27:07,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:27:07,471 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-15 18:27:07,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:27:07,472 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-15 18:27:07,574 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-15 18:27:07,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:27:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:27:07,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:27:07,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:27:07,575 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-15 18:27:09,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:27:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:27:11,518 INFO L93 Difference]: Finished difference Result 3383 states and 5024 transitions. [2022-04-15 18:27:11,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:27:11,518 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-15 18:27:11,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:27:11,519 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-15 18:27:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-15 18:27:11,521 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-15 18:27:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-15 18:27:11,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-15 18:27:11,829 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-15 18:27:11,969 INFO L225 Difference]: With dead ends: 3383 [2022-04-15 18:27:11,969 INFO L226 Difference]: Without dead ends: 1864 [2022-04-15 18:27:11,971 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:27:11,971 INFO L913 BasicCegarLoop]: 219 mSDtfsCounter, 79 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:27:11,971 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.5s Time] [2022-04-15 18:27:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-04-15 18:27:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1535. [2022-04-15 18:27:12,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:27:12,131 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-15 18:27:12,133 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-15 18:27:12,134 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-15 18:27:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:27:12,231 INFO L93 Difference]: Finished difference Result 1864 states and 2750 transitions. [2022-04-15 18:27:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2750 transitions. [2022-04-15 18:27:12,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:27:12,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:27:12,234 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-15 18:27:12,235 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-15 18:27:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:27:12,328 INFO L93 Difference]: Finished difference Result 1864 states and 2750 transitions. [2022-04-15 18:27:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2750 transitions. [2022-04-15 18:27:12,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:27:12,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:27:12,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:27:12,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:27:12,331 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-15 18:27:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2282 transitions. [2022-04-15 18:27:12,418 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2282 transitions. Word has length 216 [2022-04-15 18:27:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:27:12,419 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2282 transitions. [2022-04-15 18:27:12,419 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-15 18:27:12,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2282 transitions. [2022-04-15 18:27:14,935 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-15 18:27:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2282 transitions. [2022-04-15 18:27:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-04-15 18:27:14,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:27:14,937 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-15 18:27:14,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 18:27:14,937 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:27:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:27:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1546125371, now seen corresponding path program 1 times [2022-04-15 18:27:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:27:14,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1885188075] [2022-04-15 18:27:32,429 WARN L232 SmtUtils]: Spent 11.35s 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-15 18:27:42,607 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:27:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1546125371, now seen corresponding path program 2 times [2022-04-15 18:27:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:27:42,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20242572] [2022-04-15 18:27:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:27:42,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:27:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:27:42,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:27:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:27:42,845 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-15 18:27:42,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {215768#true} assume true; {215768#true} is VALID [2022-04-15 18:27:42,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215768#true} {215768#true} #593#return; {215768#true} is VALID [2022-04-15 18:27:42,846 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-15 18:27:42,846 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-15 18:27:42,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {215768#true} assume true; {215768#true} is VALID [2022-04-15 18:27:42,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215768#true} {215768#true} #593#return; {215768#true} is VALID [2022-04-15 18:27:42,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {215768#true} call #t~ret158 := main(); {215768#true} is VALID [2022-04-15 18:27:42,847 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-15 18:27:42,847 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-15 18:27:42,847 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-15 18:27:42,847 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-15 18:27:42,847 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-15 18:27:42,847 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-15 18:27:42,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-15 18:27:42,847 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-15 18:27:42,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {215768#true} assume 12292 == #t~mem49;havoc #t~mem49; {215768#true} is VALID [2022-04-15 18:27:42,848 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-15 18:27:42,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {215768#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {215768#true} is VALID [2022-04-15 18:27:42,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {215768#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {215768#true} is VALID [2022-04-15 18:27:42,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {215768#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {215768#true} is VALID [2022-04-15 18:27:42,848 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-15 18:27:42,848 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-15 18:27:42,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {215768#true} assume !(0 == ~tmp___4~0); {215768#true} is VALID [2022-04-15 18:27:42,848 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-15 18:27:42,848 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-15 18:27:42,848 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-15 18:27:42,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-15 18:27:42,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-15 18:27:42,849 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-15 18:27:42,849 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-15 18:27:42,849 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-15 18:27:42,849 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-15 18:27:42,849 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-15 18:27:42,849 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-15 18:27:42,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {215768#true} assume 4368 == #t~mem54;havoc #t~mem54; {215768#true} is VALID [2022-04-15 18:27:42,849 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-15 18:27:42,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {215768#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {215768#true} is VALID [2022-04-15 18:27:42,850 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-15 18:27:42,850 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-15 18:27:42,850 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-15 18:27:42,850 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-15 18:27:42,850 INFO L290 TraceCheckUtils]: 39: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-15 18:27:42,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-15 18:27:42,850 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-15 18:27:42,850 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-15 18:27:42,850 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-15 18:27:42,850 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-15 18:27:42,851 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-15 18:27:42,851 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-15 18:27:42,851 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-15 18:27:42,851 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-15 18:27:42,851 INFO L290 TraceCheckUtils]: 49: Hoare triple {215768#true} assume 4384 == #t~mem56;havoc #t~mem56; {215768#true} is VALID [2022-04-15 18:27:42,851 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-15 18:27:42,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {215768#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {215768#true} is VALID [2022-04-15 18:27:42,851 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-15 18:27:42,851 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-15 18:27:42,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {215768#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {215768#true} is VALID [2022-04-15 18:27:42,852 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-15 18:27:42,852 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-15 18:27:42,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-15 18:27:42,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-15 18:27:42,852 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-15 18:27:42,852 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-15 18:27:42,852 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-15 18:27:42,852 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-15 18:27:42,852 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-15 18:27:42,852 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-15 18:27:42,852 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-15 18:27:42,853 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-15 18:27:42,853 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-15 18:27:42,853 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-15 18:27:42,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {215768#true} assume 4400 == #t~mem58;havoc #t~mem58; {215768#true} is VALID [2022-04-15 18:27:42,853 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-15 18:27:42,853 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-15 18:27:42,853 INFO L290 TraceCheckUtils]: 72: Hoare triple {215768#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {215768#true} is VALID [2022-04-15 18:27:42,853 INFO L290 TraceCheckUtils]: 73: Hoare triple {215768#true} assume !(~ret~0 <= 0); {215768#true} is VALID [2022-04-15 18:27:42,853 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-15 18:27:42,853 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-15 18:27:42,854 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-15 18:27:42,854 INFO L290 TraceCheckUtils]: 77: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-15 18:27:42,854 INFO L290 TraceCheckUtils]: 78: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-15 18:27:42,854 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-15 18:27:42,854 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-15 18:27:42,854 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-15 18:27:42,854 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-15 18:27:42,854 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-15 18:27:42,854 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-15 18:27:42,854 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-15 18:27:42,855 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-15 18:27:42,855 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-15 18:27:42,855 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-15 18:27:42,855 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-15 18:27:42,855 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-15 18:27:42,855 INFO L290 TraceCheckUtils]: 91: Hoare triple {215768#true} assume 4416 == #t~mem60;havoc #t~mem60; {215768#true} is VALID [2022-04-15 18:27:42,855 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-15 18:27:42,855 INFO L290 TraceCheckUtils]: 93: Hoare triple {215768#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {215768#true} is VALID [2022-04-15 18:27:42,855 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-15 18:27:42,855 INFO L290 TraceCheckUtils]: 95: Hoare triple {215768#true} assume !(0 == ~tmp___6~0); {215768#true} is VALID [2022-04-15 18:27:42,856 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-15 18:27:42,856 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-15 18:27:42,856 INFO L290 TraceCheckUtils]: 98: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-15 18:27:42,856 INFO L290 TraceCheckUtils]: 99: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-15 18:27:42,856 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-15 18:27:42,856 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-15 18:27:42,856 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-15 18:27:42,856 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-15 18:27:42,856 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-15 18:27:42,856 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-15 18:27:42,857 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-15 18:27:42,857 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-15 18:27:42,857 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-15 18:27:42,857 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-15 18:27:42,857 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-15 18:27:42,857 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-15 18:27:42,857 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-15 18:27:42,857 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-15 18:27:42,857 INFO L290 TraceCheckUtils]: 114: Hoare triple {215768#true} assume 4432 == #t~mem62;havoc #t~mem62; {215768#true} is VALID [2022-04-15 18:27:42,858 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-15 18:27:42,858 INFO L290 TraceCheckUtils]: 116: Hoare triple {215768#true} assume !(5 == ~blastFlag~0); {215768#true} is VALID [2022-04-15 18:27:42,859 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-15 18:27:42,860 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-15 18:27:42,860 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-15 18:27:42,860 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-15 18:27:42,861 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-15 18:27:42,861 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-15 18:27:42,861 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-15 18:27:42,862 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-15 18:27:42,862 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-15 18:27:42,863 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-15 18:27:42,863 INFO L290 TraceCheckUtils]: 127: Hoare triple {215769#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {215769#false} is VALID [2022-04-15 18:27:42,863 INFO L290 TraceCheckUtils]: 128: Hoare triple {215769#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {215769#false} is VALID [2022-04-15 18:27:42,863 INFO L290 TraceCheckUtils]: 129: Hoare triple {215769#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {215769#false} is VALID [2022-04-15 18:27:42,863 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-15 18:27:42,863 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-15 18:27:42,863 INFO L290 TraceCheckUtils]: 132: Hoare triple {215769#false} assume !(0 == ~tmp___4~0); {215769#false} is VALID [2022-04-15 18:27:42,863 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-15 18:27:42,864 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-15 18:27:42,864 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-15 18:27:42,864 INFO L290 TraceCheckUtils]: 136: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-15 18:27:42,864 INFO L290 TraceCheckUtils]: 137: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-15 18:27:42,864 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-15 18:27:42,864 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-15 18:27:42,864 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-15 18:27:42,864 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-15 18:27:42,864 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-15 18:27:42,864 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-15 18:27:42,865 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-15 18:27:42,865 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-15 18:27:42,865 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-15 18:27:42,865 INFO L290 TraceCheckUtils]: 147: Hoare triple {215769#false} assume 4385 == #t~mem57;havoc #t~mem57; {215769#false} is VALID [2022-04-15 18:27:42,865 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-15 18:27:42,865 INFO L290 TraceCheckUtils]: 149: Hoare triple {215769#false} assume !(1 == ~blastFlag~0); {215769#false} is VALID [2022-04-15 18:27:42,865 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-15 18:27:42,865 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-15 18:27:42,865 INFO L290 TraceCheckUtils]: 152: Hoare triple {215769#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {215769#false} is VALID [2022-04-15 18:27:42,865 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-15 18:27:42,865 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-15 18:27:42,866 INFO L290 TraceCheckUtils]: 155: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-15 18:27:42,866 INFO L290 TraceCheckUtils]: 156: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-15 18:27:42,866 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-15 18:27:42,866 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-15 18:27:42,866 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-15 18:27:42,866 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-15 18:27:42,866 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-15 18:27:42,866 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-15 18:27:42,866 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-15 18:27:42,866 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-15 18:27:42,867 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-15 18:27:42,867 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-15 18:27:42,867 INFO L290 TraceCheckUtils]: 167: Hoare triple {215769#false} assume 4400 == #t~mem58;havoc #t~mem58; {215769#false} is VALID [2022-04-15 18:27:42,867 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-15 18:27:42,867 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-15 18:27:42,867 INFO L290 TraceCheckUtils]: 170: Hoare triple {215769#false} assume !(2 == ~blastFlag~0); {215769#false} is VALID [2022-04-15 18:27:42,867 INFO L290 TraceCheckUtils]: 171: Hoare triple {215769#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {215769#false} is VALID [2022-04-15 18:27:42,867 INFO L290 TraceCheckUtils]: 172: Hoare triple {215769#false} assume !(~ret~0 <= 0); {215769#false} is VALID [2022-04-15 18:27:42,867 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-15 18:27:42,867 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-15 18:27:42,868 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-15 18:27:42,868 INFO L290 TraceCheckUtils]: 176: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-15 18:27:42,868 INFO L290 TraceCheckUtils]: 177: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-15 18:27:42,868 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-15 18:27:42,868 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-15 18:27:42,868 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-15 18:27:42,868 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-15 18:27:42,868 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-15 18:27:42,868 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-15 18:27:42,868 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-15 18:27:42,868 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-15 18:27:42,869 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-15 18:27:42,869 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-15 18:27:42,869 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-15 18:27:42,869 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-15 18:27:42,869 INFO L290 TraceCheckUtils]: 190: Hoare triple {215769#false} assume 4416 == #t~mem60;havoc #t~mem60; {215769#false} is VALID [2022-04-15 18:27:42,869 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-15 18:27:42,869 INFO L290 TraceCheckUtils]: 192: Hoare triple {215769#false} assume !(3 == ~blastFlag~0); {215769#false} is VALID [2022-04-15 18:27:42,869 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-15 18:27:42,869 INFO L290 TraceCheckUtils]: 194: Hoare triple {215769#false} assume !(0 == ~tmp___6~0); {215769#false} is VALID [2022-04-15 18:27:42,870 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-15 18:27:42,870 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-15 18:27:42,870 INFO L290 TraceCheckUtils]: 197: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-15 18:27:42,870 INFO L290 TraceCheckUtils]: 198: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-15 18:27:42,870 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-15 18:27:42,870 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-15 18:27:42,870 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-15 18:27:42,870 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-15 18:27:42,870 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-15 18:27:42,870 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-15 18:27:42,871 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-15 18:27:42,871 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-15 18:27:42,871 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-15 18:27:42,871 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-15 18:27:42,871 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-15 18:27:42,871 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-15 18:27:42,871 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-15 18:27:42,871 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-15 18:27:42,871 INFO L290 TraceCheckUtils]: 213: Hoare triple {215769#false} assume 4432 == #t~mem62;havoc #t~mem62; {215769#false} is VALID [2022-04-15 18:27:42,871 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-15 18:27:42,872 INFO L290 TraceCheckUtils]: 215: Hoare triple {215769#false} assume 5 == ~blastFlag~0; {215769#false} is VALID [2022-04-15 18:27:42,872 INFO L290 TraceCheckUtils]: 216: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-15 18:27:42,874 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-15 18:27:42,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:27:42,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20242572] [2022-04-15 18:27:42,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20242572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:27:42,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:27:42,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:27:42,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:27:42,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1885188075] [2022-04-15 18:27:42,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1885188075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:27:42,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:27:42,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:27:42,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54452642] [2022-04-15 18:27:42,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:27:42,877 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-15 18:27:42,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:27:42,877 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-15 18:27:42,959 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-15 18:27:42,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:27:42,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:27:42,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:27:42,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:27:42,960 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-15 18:27:44,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:27:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:27:46,721 INFO L93 Difference]: Finished difference Result 3431 states and 5068 transitions. [2022-04-15 18:27:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:27:46,722 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-15 18:27:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:27:46,722 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-15 18:27:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:27:46,724 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-15 18:27:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:27:46,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 18:27:47,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:27:47,197 INFO L225 Difference]: With dead ends: 3431 [2022-04-15 18:27:47,197 INFO L226 Difference]: Without dead ends: 1912 [2022-04-15 18:27:47,199 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:27:47,199 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-15 18:27:47,199 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-15 18:27:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2022-04-15 18:27:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1535. [2022-04-15 18:27:47,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:27:47,340 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-15 18:27:47,341 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-15 18:27:47,342 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-15 18:27:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:27:47,440 INFO L93 Difference]: Finished difference Result 1912 states and 2772 transitions. [2022-04-15 18:27:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2772 transitions. [2022-04-15 18:27:47,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:27:47,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:27:47,444 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-15 18:27:47,445 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-15 18:27:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:27:47,545 INFO L93 Difference]: Finished difference Result 1912 states and 2772 transitions. [2022-04-15 18:27:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2772 transitions. [2022-04-15 18:27:47,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:27:47,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:27:47,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:27:47,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:27:47,549 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-15 18:27:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2248 transitions. [2022-04-15 18:27:47,653 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2248 transitions. Word has length 217 [2022-04-15 18:27:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:27:47,653 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2248 transitions. [2022-04-15 18:27:47,653 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-15 18:27:47,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2248 transitions. [2022-04-15 18:27:50,227 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-15 18:27:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2248 transitions. [2022-04-15 18:27:50,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-04-15 18:27:50,229 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:27:50,229 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-15 18:27:50,229 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 18:27:50,229 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:27:50,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:27:50,230 INFO L85 PathProgramCache]: Analyzing trace with hash 97880514, now seen corresponding path program 1 times [2022-04-15 18:27:50,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:27:50,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809466310] [2022-04-15 18:28:07,044 WARN L232 SmtUtils]: Spent 10.32s 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-15 18:28:16,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:28:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash 97880514, now seen corresponding path program 2 times [2022-04-15 18:28:16,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:28:16,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866137223] [2022-04-15 18:28:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:28:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:28:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:28:16,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:28:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:28:16,666 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-15 18:28:16,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {229536#true} assume true; {229536#true} is VALID [2022-04-15 18:28:16,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {229536#true} {229536#true} #593#return; {229536#true} is VALID [2022-04-15 18:28:16,667 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-15 18:28:16,667 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-15 18:28:16,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {229536#true} assume true; {229536#true} is VALID [2022-04-15 18:28:16,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229536#true} {229536#true} #593#return; {229536#true} is VALID [2022-04-15 18:28:16,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {229536#true} call #t~ret158 := main(); {229536#true} is VALID [2022-04-15 18:28:16,667 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-15 18:28:16,667 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-15 18:28:16,667 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-15 18:28:16,667 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-15 18:28:16,668 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-15 18:28:16,668 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-15 18:28:16,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-15 18:28:16,668 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-15 18:28:16,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {229536#true} assume 12292 == #t~mem49;havoc #t~mem49; {229536#true} is VALID [2022-04-15 18:28:16,668 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-15 18:28:16,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {229536#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {229536#true} is VALID [2022-04-15 18:28:16,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {229536#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {229536#true} is VALID [2022-04-15 18:28:16,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {229536#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {229536#true} is VALID [2022-04-15 18:28:16,668 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-15 18:28:16,669 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-15 18:28:16,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {229536#true} assume !(0 == ~tmp___4~0); {229536#true} is VALID [2022-04-15 18:28:16,669 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-15 18:28:16,669 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-15 18:28:16,669 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-15 18:28:16,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-15 18:28:16,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-15 18:28:16,669 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-15 18:28:16,669 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-15 18:28:16,669 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-15 18:28:16,669 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-15 18:28:16,670 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-15 18:28:16,670 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-15 18:28:16,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {229536#true} assume 4368 == #t~mem54;havoc #t~mem54; {229536#true} is VALID [2022-04-15 18:28:16,670 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-15 18:28:16,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {229536#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {229536#true} is VALID [2022-04-15 18:28:16,670 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-15 18:28:16,670 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-15 18:28:16,670 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-15 18:28:16,670 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-15 18:28:16,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-15 18:28:16,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-15 18:28:16,671 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-15 18:28:16,671 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-15 18:28:16,671 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-15 18:28:16,671 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-15 18:28:16,671 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-15 18:28:16,671 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-15 18:28:16,671 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-15 18:28:16,671 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-15 18:28:16,671 INFO L290 TraceCheckUtils]: 49: Hoare triple {229536#true} assume 4384 == #t~mem56;havoc #t~mem56; {229536#true} is VALID [2022-04-15 18:28:16,671 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-15 18:28:16,672 INFO L290 TraceCheckUtils]: 51: Hoare triple {229536#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {229536#true} is VALID [2022-04-15 18:28:16,672 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-15 18:28:16,672 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-15 18:28:16,672 INFO L290 TraceCheckUtils]: 54: Hoare triple {229536#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {229536#true} is VALID [2022-04-15 18:28:16,672 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-15 18:28:16,672 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-15 18:28:16,672 INFO L290 TraceCheckUtils]: 57: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-15 18:28:16,672 INFO L290 TraceCheckUtils]: 58: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-15 18:28:16,672 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-15 18:28:16,672 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-15 18:28:16,672 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-15 18:28:16,673 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-15 18:28:16,673 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-15 18:28:16,673 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-15 18:28:16,673 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-15 18:28:16,673 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-15 18:28:16,673 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-15 18:28:16,673 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-15 18:28:16,673 INFO L290 TraceCheckUtils]: 69: Hoare triple {229536#true} assume 4400 == #t~mem58;havoc #t~mem58; {229536#true} is VALID [2022-04-15 18:28:16,673 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-15 18:28:16,673 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-15 18:28:16,674 INFO L290 TraceCheckUtils]: 72: Hoare triple {229536#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {229536#true} is VALID [2022-04-15 18:28:16,674 INFO L290 TraceCheckUtils]: 73: Hoare triple {229536#true} assume !(~ret~0 <= 0); {229536#true} is VALID [2022-04-15 18:28:16,674 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-15 18:28:16,674 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-15 18:28:16,674 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-15 18:28:16,674 INFO L290 TraceCheckUtils]: 77: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-15 18:28:16,674 INFO L290 TraceCheckUtils]: 78: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-15 18:28:16,674 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-15 18:28:16,674 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-15 18:28:16,674 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-15 18:28:16,674 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-15 18:28:16,675 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-15 18:28:16,675 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-15 18:28:16,675 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-15 18:28:16,675 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-15 18:28:16,675 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-15 18:28:16,675 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-15 18:28:16,675 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-15 18:28:16,675 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-15 18:28:16,675 INFO L290 TraceCheckUtils]: 91: Hoare triple {229536#true} assume 4416 == #t~mem60;havoc #t~mem60; {229536#true} is VALID [2022-04-15 18:28:16,675 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-15 18:28:16,675 INFO L290 TraceCheckUtils]: 93: Hoare triple {229536#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {229536#true} is VALID [2022-04-15 18:28:16,676 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-15 18:28:16,676 INFO L290 TraceCheckUtils]: 95: Hoare triple {229536#true} assume !(0 == ~tmp___6~0); {229536#true} is VALID [2022-04-15 18:28:16,676 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-15 18:28:16,676 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-15 18:28:16,676 INFO L290 TraceCheckUtils]: 98: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-15 18:28:16,676 INFO L290 TraceCheckUtils]: 99: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-15 18:28:16,676 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-15 18:28:16,676 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-15 18:28:16,676 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-15 18:28:16,676 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-15 18:28:16,676 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-15 18:28:16,677 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-15 18:28:16,677 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-15 18:28:16,677 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-15 18:28:16,677 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-15 18:28:16,677 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-15 18:28:16,677 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-15 18:28:16,677 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-15 18:28:16,677 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-15 18:28:16,677 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-15 18:28:16,677 INFO L290 TraceCheckUtils]: 114: Hoare triple {229536#true} assume 4432 == #t~mem62;havoc #t~mem62; {229536#true} is VALID [2022-04-15 18:28:16,677 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-15 18:28:16,678 INFO L290 TraceCheckUtils]: 116: Hoare triple {229536#true} assume !(5 == ~blastFlag~0); {229536#true} is VALID [2022-04-15 18:28:16,679 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-15 18:28:16,679 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-15 18:28:16,679 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-15 18:28:16,680 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-15 18:28:16,680 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-15 18:28:16,681 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-15 18:28:16,681 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-15 18:28:16,681 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-15 18:28:16,682 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-15 18:28:16,682 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-15 18:28:16,682 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-15 18:28:16,683 INFO L290 TraceCheckUtils]: 128: Hoare triple {229537#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {229537#false} is VALID [2022-04-15 18:28:16,683 INFO L290 TraceCheckUtils]: 129: Hoare triple {229537#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {229537#false} is VALID [2022-04-15 18:28:16,683 INFO L290 TraceCheckUtils]: 130: Hoare triple {229537#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {229537#false} is VALID [2022-04-15 18:28:16,683 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-15 18:28:16,683 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-15 18:28:16,683 INFO L290 TraceCheckUtils]: 133: Hoare triple {229537#false} assume !(0 == ~tmp___4~0); {229537#false} is VALID [2022-04-15 18:28:16,683 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-15 18:28:16,683 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-15 18:28:16,683 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-15 18:28:16,683 INFO L290 TraceCheckUtils]: 137: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-15 18:28:16,684 INFO L290 TraceCheckUtils]: 138: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-15 18:28:16,684 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-15 18:28:16,684 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-15 18:28:16,684 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-15 18:28:16,684 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-15 18:28:16,684 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-15 18:28:16,684 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-15 18:28:16,684 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-15 18:28:16,684 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-15 18:28:16,684 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-15 18:28:16,685 INFO L290 TraceCheckUtils]: 148: Hoare triple {229537#false} assume 4385 == #t~mem57;havoc #t~mem57; {229537#false} is VALID [2022-04-15 18:28:16,685 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-15 18:28:16,685 INFO L290 TraceCheckUtils]: 150: Hoare triple {229537#false} assume !(1 == ~blastFlag~0); {229537#false} is VALID [2022-04-15 18:28:16,685 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-15 18:28:16,685 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-15 18:28:16,685 INFO L290 TraceCheckUtils]: 153: Hoare triple {229537#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {229537#false} is VALID [2022-04-15 18:28:16,685 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-15 18:28:16,685 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-15 18:28:16,685 INFO L290 TraceCheckUtils]: 156: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-15 18:28:16,685 INFO L290 TraceCheckUtils]: 157: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-15 18:28:16,686 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-15 18:28:16,686 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-15 18:28:16,686 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-15 18:28:16,686 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-15 18:28:16,686 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-15 18:28:16,686 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-15 18:28:16,686 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-15 18:28:16,686 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-15 18:28:16,686 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-15 18:28:16,686 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-15 18:28:16,687 INFO L290 TraceCheckUtils]: 168: Hoare triple {229537#false} assume 4400 == #t~mem58;havoc #t~mem58; {229537#false} is VALID [2022-04-15 18:28:16,687 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-15 18:28:16,687 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-15 18:28:16,687 INFO L290 TraceCheckUtils]: 171: Hoare triple {229537#false} assume !(2 == ~blastFlag~0); {229537#false} is VALID [2022-04-15 18:28:16,687 INFO L290 TraceCheckUtils]: 172: Hoare triple {229537#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {229537#false} is VALID [2022-04-15 18:28:16,687 INFO L290 TraceCheckUtils]: 173: Hoare triple {229537#false} assume !(~ret~0 <= 0); {229537#false} is VALID [2022-04-15 18:28:16,687 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-15 18:28:16,687 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-15 18:28:16,687 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-15 18:28:16,687 INFO L290 TraceCheckUtils]: 177: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-15 18:28:16,687 INFO L290 TraceCheckUtils]: 178: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-15 18:28:16,688 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-15 18:28:16,688 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-15 18:28:16,688 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-15 18:28:16,688 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-15 18:28:16,688 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-15 18:28:16,688 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-15 18:28:16,688 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-15 18:28:16,688 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-15 18:28:16,688 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-15 18:28:16,688 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-15 18:28:16,689 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-15 18:28:16,689 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-15 18:28:16,689 INFO L290 TraceCheckUtils]: 191: Hoare triple {229537#false} assume 4416 == #t~mem60;havoc #t~mem60; {229537#false} is VALID [2022-04-15 18:28:16,689 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-15 18:28:16,689 INFO L290 TraceCheckUtils]: 193: Hoare triple {229537#false} assume !(3 == ~blastFlag~0); {229537#false} is VALID [2022-04-15 18:28:16,689 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-15 18:28:16,689 INFO L290 TraceCheckUtils]: 195: Hoare triple {229537#false} assume !(0 == ~tmp___6~0); {229537#false} is VALID [2022-04-15 18:28:16,689 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-15 18:28:16,689 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-15 18:28:16,689 INFO L290 TraceCheckUtils]: 198: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-15 18:28:16,689 INFO L290 TraceCheckUtils]: 199: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-15 18:28:16,690 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-15 18:28:16,690 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-15 18:28:16,690 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-15 18:28:16,690 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-15 18:28:16,690 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-15 18:28:16,690 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-15 18:28:16,690 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-15 18:28:16,690 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-15 18:28:16,690 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-15 18:28:16,690 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-15 18:28:16,691 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-15 18:28:16,691 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-15 18:28:16,691 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-15 18:28:16,691 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-15 18:28:16,691 INFO L290 TraceCheckUtils]: 214: Hoare triple {229537#false} assume 4432 == #t~mem62;havoc #t~mem62; {229537#false} is VALID [2022-04-15 18:28:16,691 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-15 18:28:16,691 INFO L290 TraceCheckUtils]: 216: Hoare triple {229537#false} assume 5 == ~blastFlag~0; {229537#false} is VALID [2022-04-15 18:28:16,691 INFO L290 TraceCheckUtils]: 217: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-15 18:28:16,692 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-15 18:28:16,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:28:16,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866137223] [2022-04-15 18:28:16,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866137223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:28:16,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:28:16,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:28:16,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:28:16,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1809466310] [2022-04-15 18:28:16,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1809466310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:28:16,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:28:16,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:28:16,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92898796] [2022-04-15 18:28:16,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:28:16,694 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-15 18:28:16,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:28:16,694 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-15 18:28:16,796 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-15 18:28:16,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:28:16,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:28:16,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:28:16,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:28:16,797 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-15 18:28:18,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:28:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:28:20,402 INFO L93 Difference]: Finished difference Result 3431 states and 5000 transitions. [2022-04-15 18:28:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:28:20,402 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-15 18:28:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:28:20,403 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-15 18:28:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 18:28:20,404 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-15 18:28:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 18:28:20,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-15 18:28:20,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:28:20,867 INFO L225 Difference]: With dead ends: 3431 [2022-04-15 18:28:20,867 INFO L226 Difference]: Without dead ends: 1912 [2022-04-15 18:28:20,868 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:28:20,869 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 114 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:28:20,869 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 280 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:28:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2022-04-15 18:28:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1535. [2022-04-15 18:28:20,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:28:21,000 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-15 18:28:21,000 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-15 18:28:21,001 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-15 18:28:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:28:21,098 INFO L93 Difference]: Finished difference Result 1912 states and 2738 transitions. [2022-04-15 18:28:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2738 transitions. [2022-04-15 18:28:21,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:28:21,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:28:21,101 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-15 18:28:21,102 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-15 18:28:21,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:28:21,199 INFO L93 Difference]: Finished difference Result 1912 states and 2738 transitions. [2022-04-15 18:28:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2738 transitions. [2022-04-15 18:28:21,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:28:21,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:28:21,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:28:21,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:28:21,202 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-15 18:28:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2214 transitions. [2022-04-15 18:28:21,298 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2214 transitions. Word has length 218 [2022-04-15 18:28:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:28:21,298 INFO L478 AbstractCegarLoop]: Abstraction has 1535 states and 2214 transitions. [2022-04-15 18:28:21,299 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-15 18:28:21,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2214 transitions. [2022-04-15 18:28:23,825 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-15 18:28:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2214 transitions. [2022-04-15 18:28:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-04-15 18:28:23,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:28:23,827 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-15 18:28:23,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 18:28:23,827 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:28:23,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:28:23,828 INFO L85 PathProgramCache]: Analyzing trace with hash -252957758, now seen corresponding path program 1 times [2022-04-15 18:28:23,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:28:23,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2103478752] [2022-04-15 18:28:44,547 WARN L232 SmtUtils]: Spent 13.13s 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-15 18:28:54,447 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:28:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash -252957758, now seen corresponding path program 2 times [2022-04-15 18:28:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:28:54,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10203764] [2022-04-15 18:28:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:28:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:28:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:28:54,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:28:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:28:54,653 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-15 18:28:54,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {243304#true} assume true; {243304#true} is VALID [2022-04-15 18:28:54,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {243304#true} {243304#true} #593#return; {243304#true} is VALID [2022-04-15 18:28:54,654 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-15 18:28:54,655 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-15 18:28:54,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {243304#true} assume true; {243304#true} is VALID [2022-04-15 18:28:54,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243304#true} {243304#true} #593#return; {243304#true} is VALID [2022-04-15 18:28:54,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {243304#true} call #t~ret158 := main(); {243304#true} is VALID [2022-04-15 18:28:54,655 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-15 18:28:54,655 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-15 18:28:54,655 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-15 18:28:54,655 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-15 18:28:54,655 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-15 18:28:54,655 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-15 18:28:54,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-15 18:28:54,656 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-15 18:28:54,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {243304#true} assume 12292 == #t~mem49;havoc #t~mem49; {243304#true} is VALID [2022-04-15 18:28:54,656 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-15 18:28:54,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {243304#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {243304#true} is VALID [2022-04-15 18:28:54,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {243304#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {243304#true} is VALID [2022-04-15 18:28:54,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {243304#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {243304#true} is VALID [2022-04-15 18:28:54,656 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-15 18:28:54,656 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-15 18:28:54,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {243304#true} assume !(0 == ~tmp___4~0); {243304#true} is VALID [2022-04-15 18:28:54,656 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-15 18:28:54,657 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-15 18:28:54,657 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-15 18:28:54,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-15 18:28:54,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-15 18:28:54,657 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-15 18:28:54,657 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-15 18:28:54,657 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-15 18:28:54,657 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-15 18:28:54,657 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-15 18:28:54,657 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-15 18:28:54,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {243304#true} assume 4368 == #t~mem54;havoc #t~mem54; {243304#true} is VALID [2022-04-15 18:28:54,658 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-15 18:28:54,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {243304#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {243304#true} is VALID [2022-04-15 18:28:54,658 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-15 18:28:54,658 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-15 18:28:54,658 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-15 18:28:54,658 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-15 18:28:54,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-15 18:28:54,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-15 18:28:54,658 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-15 18:28:54,658 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-15 18:28:54,659 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-15 18:28:54,659 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-15 18:28:54,659 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-15 18:28:54,659 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-15 18:28:54,659 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-15 18:28:54,659 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-15 18:28:54,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {243304#true} assume 4384 == #t~mem56;havoc #t~mem56; {243304#true} is VALID [2022-04-15 18:28:54,659 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-15 18:28:54,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {243304#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {243304#true} is VALID [2022-04-15 18:28:54,659 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-15 18:28:54,660 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-15 18:28:54,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {243304#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {243304#true} is VALID [2022-04-15 18:28:54,660 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-15 18:28:54,660 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-15 18:28:54,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-15 18:28:54,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-15 18:28:54,660 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-15 18:28:54,660 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-15 18:28:54,660 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-15 18:28:54,660 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-15 18:28:54,660 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-15 18:28:54,661 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-15 18:28:54,661 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-15 18:28:54,661 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-15 18:28:54,661 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-15 18:28:54,661 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-15 18:28:54,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {243304#true} assume 4400 == #t~mem58;havoc #t~mem58; {243304#true} is VALID [2022-04-15 18:28:54,661 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-15 18:28:54,661 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-15 18:28:54,661 INFO L290 TraceCheckUtils]: 72: Hoare triple {243304#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {243304#true} is VALID [2022-04-15 18:28:54,661 INFO L290 TraceCheckUtils]: 73: Hoare triple {243304#true} assume !(~ret~0 <= 0); {243304#true} is VALID [2022-04-15 18:28:54,662 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-15 18:28:54,662 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-15 18:28:54,662 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-15 18:28:54,662 INFO L290 TraceCheckUtils]: 77: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-15 18:28:54,662 INFO L290 TraceCheckUtils]: 78: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-15 18:28:54,662 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-15 18:28:54,662 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-15 18:28:54,662 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-15 18:28:54,662 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-15 18:28:54,662 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-15 18:28:54,662 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-15 18:28:54,663 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-15 18:28:54,663 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-15 18:28:54,663 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-15 18:28:54,663 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-15 18:28:54,663 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-15 18:28:54,663 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-15 18:28:54,663 INFO L290 TraceCheckUtils]: 91: Hoare triple {243304#true} assume 4416 == #t~mem60;havoc #t~mem60; {243304#true} is VALID [2022-04-15 18:28:54,663 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-15 18:28:54,663 INFO L290 TraceCheckUtils]: 93: Hoare triple {243304#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {243304#true} is VALID [2022-04-15 18:28:54,663 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-15 18:28:54,664 INFO L290 TraceCheckUtils]: 95: Hoare triple {243304#true} assume !(0 == ~tmp___6~0); {243304#true} is VALID [2022-04-15 18:28:54,664 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-15 18:28:54,664 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-15 18:28:54,664 INFO L290 TraceCheckUtils]: 98: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-15 18:28:54,664 INFO L290 TraceCheckUtils]: 99: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-15 18:28:54,664 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-15 18:28:54,664 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-15 18:28:54,664 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-15 18:28:54,664 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-15 18:28:54,664 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-15 18:28:54,665 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-15 18:28:54,665 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-15 18:28:54,665 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-15 18:28:54,665 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-15 18:28:54,665 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-15 18:28:54,665 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-15 18:28:54,665 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-15 18:28:54,665 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-15 18:28:54,665 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-15 18:28:54,665 INFO L290 TraceCheckUtils]: 114: Hoare triple {243304#true} assume 4432 == #t~mem62;havoc #t~mem62; {243304#true} is VALID [2022-04-15 18:28:54,666 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-15 18:28:54,666 INFO L290 TraceCheckUtils]: 116: Hoare triple {243304#true} assume !(5 == ~blastFlag~0); {243304#true} is VALID [2022-04-15 18:28:54,667 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-15 18:28:54,667 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-15 18:28:54,667 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-15 18:28:54,668 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-15 18:28:54,668 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-15 18:28:54,668 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-15 18:28:54,669 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-15 18:28:54,669 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-15 18:28:54,669 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-15 18:28:54,670 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-15 18:28:54,670 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-15 18:28:54,670 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-15 18:28:54,671 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-15 18:28:54,671 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-15 18:28:54,671 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-15 18:28:54,672 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-15 18:28:54,672 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-15 18:28:54,672 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-15 18:28:54,673 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-15 18:28:54,673 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-15 18:28:54,673 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-15 18:28:54,674 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-15 18:28:54,674 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-15 18:28:54,674 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-15 18:28:54,674 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-15 18:28:54,674 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-15 18:28:54,674 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-15 18:28:54,674 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-15 18:28:54,675 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-15 18:28:54,675 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-15 18:28:54,675 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-15 18:28:54,675 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-15 18:28:54,675 INFO L290 TraceCheckUtils]: 149: Hoare triple {243305#false} assume 4513 == #t~mem75;havoc #t~mem75; {243305#false} is VALID [2022-04-15 18:28:54,675 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-15 18:28:54,675 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-15 18:28:54,675 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-15 18:28:54,675 INFO L290 TraceCheckUtils]: 153: Hoare triple {243305#false} assume !(0 == ~tmp___7~0); {243305#false} is VALID [2022-04-15 18:28:54,675 INFO L290 TraceCheckUtils]: 154: Hoare triple {243305#false} assume !(0 == ~tmp___8~0); {243305#false} is VALID [2022-04-15 18:28:54,676 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-15 18:28:54,676 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-15 18:28:54,676 INFO L290 TraceCheckUtils]: 157: Hoare triple {243305#false} ~skip~0 := 0; {243305#false} is VALID [2022-04-15 18:28:54,676 INFO L290 TraceCheckUtils]: 158: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-15 18:28:54,676 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-15 18:28:54,676 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-15 18:28:54,676 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-15 18:28:54,676 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-15 18:28:54,676 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-15 18:28:54,676 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-15 18:28:54,677 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-15 18:28:54,677 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-15 18:28:54,677 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-15 18:28:54,677 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-15 18:28:54,677 INFO L290 TraceCheckUtils]: 169: Hoare triple {243305#false} assume 4400 == #t~mem58;havoc #t~mem58; {243305#false} is VALID [2022-04-15 18:28:54,677 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-15 18:28:54,677 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-15 18:28:54,677 INFO L290 TraceCheckUtils]: 172: Hoare triple {243305#false} assume !(2 == ~blastFlag~0); {243305#false} is VALID [2022-04-15 18:28:54,677 INFO L290 TraceCheckUtils]: 173: Hoare triple {243305#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {243305#false} is VALID [2022-04-15 18:28:54,677 INFO L290 TraceCheckUtils]: 174: Hoare triple {243305#false} assume !(~ret~0 <= 0); {243305#false} is VALID [2022-04-15 18:28:54,678 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-15 18:28:54,678 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-15 18:28:54,678 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-15 18:28:54,678 INFO L290 TraceCheckUtils]: 178: Hoare triple {243305#false} ~skip~0 := 0; {243305#false} is VALID [2022-04-15 18:28:54,678 INFO L290 TraceCheckUtils]: 179: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-15 18:28:54,678 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-15 18:28:54,678 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-15 18:28:54,678 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-15 18:28:54,678 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-15 18:28:54,678 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-15 18:28:54,678 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-15 18:28:54,679 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-15 18:28:54,679 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-15 18:28:54,679 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-15 18:28:54,679 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-15 18:28:54,679 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-15 18:28:54,679 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-15 18:28:54,679 INFO L290 TraceCheckUtils]: 192: Hoare triple {243305#false} assume 4416 == #t~mem60;havoc #t~mem60; {243305#false} is VALID [2022-04-15 18:28:54,679 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-15 18:28:54,679 INFO L290 TraceCheckUtils]: 194: Hoare triple {243305#false} assume !(3 == ~blastFlag~0); {243305#false} is VALID [2022-04-15 18:28:54,679 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-15 18:28:54,680 INFO L290 TraceCheckUtils]: 196: Hoare triple {243305#false} assume !(0 == ~tmp___6~0); {243305#false} is VALID [2022-04-15 18:28:54,680 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-15 18:28:54,680 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-15 18:28:54,680 INFO L290 TraceCheckUtils]: 199: Hoare triple {243305#false} ~skip~0 := 0; {243305#false} is VALID [2022-04-15 18:28:54,680 INFO L290 TraceCheckUtils]: 200: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-15 18:28:54,680 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-15 18:28:54,680 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-15 18:28:54,680 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-15 18:28:54,680 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-15 18:28:54,680 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-15 18:28:54,681 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-15 18:28:54,681 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-15 18:28:54,681 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-15 18:28:54,681 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-15 18:28:54,681 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-15 18:28:54,681 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-15 18:28:54,681 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-15 18:28:54,681 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-15 18:28:54,681 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-15 18:28:54,681 INFO L290 TraceCheckUtils]: 215: Hoare triple {243305#false} assume 4432 == #t~mem62;havoc #t~mem62; {243305#false} is VALID [2022-04-15 18:28:54,682 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-15 18:28:54,682 INFO L290 TraceCheckUtils]: 217: Hoare triple {243305#false} assume 5 == ~blastFlag~0; {243305#false} is VALID [2022-04-15 18:28:54,682 INFO L290 TraceCheckUtils]: 218: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-15 18:28:54,682 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-15 18:28:54,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:28:54,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10203764] [2022-04-15 18:28:54,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10203764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:28:54,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:28:54,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:28:54,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:28:54,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2103478752] [2022-04-15 18:28:54,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2103478752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:28:54,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:28:54,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:28:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746001914] [2022-04-15 18:28:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:28:54,684 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-15 18:28:54,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:28:54,684 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-15 18:28:54,790 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-15 18:28:54,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:28:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:28:54,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:28:54,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:28:54,791 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-15 18:28:56,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:28:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:28:58,209 INFO L93 Difference]: Finished difference Result 3131 states and 4510 transitions. [2022-04-15 18:28:58,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:28:58,209 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-15 18:28:58,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:28:58,210 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-15 18:28:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 375 transitions. [2022-04-15 18:28:58,212 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-15 18:28:58,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 375 transitions. [2022-04-15 18:28:58,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 375 transitions. [2022-04-15 18:28:58,460 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-15 18:28:58,562 INFO L225 Difference]: With dead ends: 3131 [2022-04-15 18:28:58,562 INFO L226 Difference]: Without dead ends: 1612 [2022-04-15 18:28:58,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:28:58,563 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-15 18:28:58,563 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-15 18:28:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2022-04-15 18:28:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1577. [2022-04-15 18:28:58,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:28:58,706 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-15 18:28:58,707 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-15 18:28:58,708 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-15 18:28:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:28:58,781 INFO L93 Difference]: Finished difference Result 1612 states and 2310 transitions. [2022-04-15 18:28:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2310 transitions. [2022-04-15 18:28:58,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:28:58,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:28:58,783 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-15 18:28:58,784 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-15 18:28:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:28:58,856 INFO L93 Difference]: Finished difference Result 1612 states and 2310 transitions. [2022-04-15 18:28:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2310 transitions. [2022-04-15 18:28:58,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:28:58,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:28:58,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:28:58,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:28:58,858 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-15 18:28:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2268 transitions. [2022-04-15 18:28:58,975 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2268 transitions. Word has length 219 [2022-04-15 18:28:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:28:58,975 INFO L478 AbstractCegarLoop]: Abstraction has 1577 states and 2268 transitions. [2022-04-15 18:28:58,975 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-15 18:28:58,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1577 states and 2268 transitions. [2022-04-15 18:29:01,487 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-15 18:29:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2268 transitions. [2022-04-15 18:29:01,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-04-15 18:29:01,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:29:01,489 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-15 18:29:01,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 18:29:01,489 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:29:01,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:29:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash 944424234, now seen corresponding path program 1 times [2022-04-15 18:29:01,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:29:01,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2123222571] [2022-04-15 18:29:14,638 WARN L232 SmtUtils]: Spent 7.44s 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-15 18:29:23,788 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:29:23,788 INFO L85 PathProgramCache]: Analyzing trace with hash 944424234, now seen corresponding path program 2 times [2022-04-15 18:29:23,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:29:23,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433997732] [2022-04-15 18:29:23,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:29:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:29:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:29:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:29:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:29:24,018 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-15 18:29:24,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {255956#true} assume true; {255956#true} is VALID [2022-04-15 18:29:24,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {255956#true} {255956#true} #593#return; {255956#true} is VALID [2022-04-15 18:29:24,019 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-15 18:29:24,019 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-15 18:29:24,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {255956#true} assume true; {255956#true} is VALID [2022-04-15 18:29:24,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {255956#true} {255956#true} #593#return; {255956#true} is VALID [2022-04-15 18:29:24,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {255956#true} call #t~ret158 := main(); {255956#true} is VALID [2022-04-15 18:29:24,020 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-15 18:29:24,020 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-15 18:29:24,020 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-15 18:29:24,020 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-15 18:29:24,020 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-15 18:29:24,020 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-15 18:29:24,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-15 18:29:24,020 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-15 18:29:24,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {255956#true} assume 12292 == #t~mem49;havoc #t~mem49; {255956#true} is VALID [2022-04-15 18:29:24,020 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-15 18:29:24,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {255956#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {255956#true} is VALID [2022-04-15 18:29:24,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {255956#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {255956#true} is VALID [2022-04-15 18:29:24,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {255956#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {255956#true} is VALID [2022-04-15 18:29:24,021 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-15 18:29:24,021 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-15 18:29:24,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {255956#true} assume !(0 == ~tmp___4~0); {255956#true} is VALID [2022-04-15 18:29:24,021 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-15 18:29:24,021 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-15 18:29:24,021 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-15 18:29:24,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-15 18:29:24,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-15 18:29:24,022 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-15 18:29:24,022 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-15 18:29:24,022 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-15 18:29:24,022 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-15 18:29:24,022 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-15 18:29:24,022 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-15 18:29:24,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {255956#true} assume 4368 == #t~mem54;havoc #t~mem54; {255956#true} is VALID [2022-04-15 18:29:24,022 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-15 18:29:24,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {255956#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {255956#true} is VALID [2022-04-15 18:29:24,023 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-15 18:29:24,023 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-15 18:29:24,023 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-15 18:29:24,023 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-15 18:29:24,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-15 18:29:24,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-15 18:29:24,023 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-15 18:29:24,023 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-15 18:29:24,023 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-15 18:29:24,023 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-15 18:29:24,024 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-15 18:29:24,024 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-15 18:29:24,024 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-15 18:29:24,024 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-15 18:29:24,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {255956#true} assume 4384 == #t~mem56;havoc #t~mem56; {255956#true} is VALID [2022-04-15 18:29:24,024 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-15 18:29:24,024 INFO L290 TraceCheckUtils]: 51: Hoare triple {255956#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {255956#true} is VALID [2022-04-15 18:29:24,024 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-15 18:29:24,024 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-15 18:29:24,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {255956#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {255956#true} is VALID [2022-04-15 18:29:24,024 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-15 18:29:24,025 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-15 18:29:24,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-15 18:29:24,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-15 18:29:24,025 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-15 18:29:24,025 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-15 18:29:24,025 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-15 18:29:24,025 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-15 18:29:24,025 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-15 18:29:24,025 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-15 18:29:24,025 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-15 18:29:24,026 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-15 18:29:24,026 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-15 18:29:24,026 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-15 18:29:24,026 INFO L290 TraceCheckUtils]: 69: Hoare triple {255956#true} assume 4400 == #t~mem58;havoc #t~mem58; {255956#true} is VALID [2022-04-15 18:29:24,026 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-15 18:29:24,026 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-15 18:29:24,026 INFO L290 TraceCheckUtils]: 72: Hoare triple {255956#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {255956#true} is VALID [2022-04-15 18:29:24,026 INFO L290 TraceCheckUtils]: 73: Hoare triple {255956#true} assume !(~ret~0 <= 0); {255956#true} is VALID [2022-04-15 18:29:24,026 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-15 18:29:24,027 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-15 18:29:24,027 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-15 18:29:24,027 INFO L290 TraceCheckUtils]: 77: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-15 18:29:24,027 INFO L290 TraceCheckUtils]: 78: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-15 18:29:24,027 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-15 18:29:24,027 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-15 18:29:24,027 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-15 18:29:24,027 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-15 18:29:24,027 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-15 18:29:24,028 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-15 18:29:24,028 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-15 18:29:24,028 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-15 18:29:24,028 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-15 18:29:24,028 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-15 18:29:24,028 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-15 18:29:24,028 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-15 18:29:24,028 INFO L290 TraceCheckUtils]: 91: Hoare triple {255956#true} assume 4416 == #t~mem60;havoc #t~mem60; {255956#true} is VALID [2022-04-15 18:29:24,028 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-15 18:29:24,028 INFO L290 TraceCheckUtils]: 93: Hoare triple {255956#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {255956#true} is VALID [2022-04-15 18:29:24,029 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-15 18:29:24,029 INFO L290 TraceCheckUtils]: 95: Hoare triple {255956#true} assume !(0 == ~tmp___6~0); {255956#true} is VALID [2022-04-15 18:29:24,029 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-15 18:29:24,029 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-15 18:29:24,029 INFO L290 TraceCheckUtils]: 98: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-15 18:29:24,029 INFO L290 TraceCheckUtils]: 99: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-15 18:29:24,029 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-15 18:29:24,029 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-15 18:29:24,029 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-15 18:29:24,029 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-15 18:29:24,030 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-15 18:29:24,030 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-15 18:29:24,030 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-15 18:29:24,030 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-15 18:29:24,030 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-15 18:29:24,030 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-15 18:29:24,030 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-15 18:29:24,030 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-15 18:29:24,030 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-15 18:29:24,030 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-15 18:29:24,030 INFO L290 TraceCheckUtils]: 114: Hoare triple {255956#true} assume 4432 == #t~mem62;havoc #t~mem62; {255956#true} is VALID [2022-04-15 18:29:24,031 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-15 18:29:24,031 INFO L290 TraceCheckUtils]: 116: Hoare triple {255956#true} assume !(5 == ~blastFlag~0); {255956#true} is VALID [2022-04-15 18:29:24,031 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-15 18:29:24,031 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-15 18:29:24,031 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-15 18:29:24,031 INFO L290 TraceCheckUtils]: 120: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-15 18:29:24,031 INFO L290 TraceCheckUtils]: 121: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-15 18:29:24,031 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-15 18:29:24,031 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-15 18:29:24,031 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-15 18:29:24,032 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-15 18:29:24,032 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-15 18:29:24,032 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-15 18:29:24,032 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-15 18:29:24,032 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-15 18:29:24,032 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-15 18:29:24,032 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-15 18:29:24,032 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-15 18:29:24,032 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-15 18:29:24,032 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-15 18:29:24,033 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-15 18:29:24,033 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-15 18:29:24,033 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-15 18:29:24,033 INFO L290 TraceCheckUtils]: 138: Hoare triple {255956#true} assume 4448 == #t~mem64;havoc #t~mem64; {255956#true} is VALID [2022-04-15 18:29:24,033 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-15 18:29:24,033 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-15 18:29:24,034 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-15 18:29:24,035 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-15 18:29:24,035 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-15 18:29:24,035 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-15 18:29:24,036 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-15 18:29:24,036 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-15 18:29:24,036 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-15 18:29:24,036 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-15 18:29:24,037 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-15 18:29:24,037 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-15 18:29:24,037 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-15 18:29:24,038 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-15 18:29:24,038 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-15 18:29:24,038 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-15 18:29:24,039 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-15 18:29:24,039 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-15 18:29:24,039 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-15 18:29:24,039 INFO L290 TraceCheckUtils]: 158: Hoare triple {255957#false} assume !(1 == ~blastFlag~0); {255957#false} is VALID [2022-04-15 18:29:24,039 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-15 18:29:24,039 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-15 18:29:24,040 INFO L290 TraceCheckUtils]: 161: Hoare triple {255957#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {255957#false} is VALID [2022-04-15 18:29:24,040 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-15 18:29:24,040 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-15 18:29:24,040 INFO L290 TraceCheckUtils]: 164: Hoare triple {255957#false} ~skip~0 := 0; {255957#false} is VALID [2022-04-15 18:29:24,040 INFO L290 TraceCheckUtils]: 165: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-15 18:29:24,040 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-15 18:29:24,040 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-15 18:29:24,040 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-15 18:29:24,040 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-15 18:29:24,040 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-15 18:29:24,041 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-15 18:29:24,041 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-15 18:29:24,041 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-15 18:29:24,041 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-15 18:29:24,041 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-15 18:29:24,041 INFO L290 TraceCheckUtils]: 176: Hoare triple {255957#false} assume 4400 == #t~mem58;havoc #t~mem58; {255957#false} is VALID [2022-04-15 18:29:24,041 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-15 18:29:24,041 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-15 18:29:24,041 INFO L290 TraceCheckUtils]: 179: Hoare triple {255957#false} assume !(2 == ~blastFlag~0); {255957#false} is VALID [2022-04-15 18:29:24,041 INFO L290 TraceCheckUtils]: 180: Hoare triple {255957#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {255957#false} is VALID [2022-04-15 18:29:24,041 INFO L290 TraceCheckUtils]: 181: Hoare triple {255957#false} assume !(~ret~0 <= 0); {255957#false} is VALID [2022-04-15 18:29:24,042 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-15 18:29:24,042 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-15 18:29:24,042 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-15 18:29:24,042 INFO L290 TraceCheckUtils]: 185: Hoare triple {255957#false} ~skip~0 := 0; {255957#false} is VALID [2022-04-15 18:29:24,042 INFO L290 TraceCheckUtils]: 186: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-15 18:29:24,042 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-15 18:29:24,042 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-15 18:29:24,042 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-15 18:29:24,042 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-15 18:29:24,042 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-15 18:29:24,043 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-15 18:29:24,043 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-15 18:29:24,043 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-15 18:29:24,043 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-15 18:29:24,043 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-15 18:29:24,043 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-15 18:29:24,043 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-15 18:29:24,043 INFO L290 TraceCheckUtils]: 199: Hoare triple {255957#false} assume 4416 == #t~mem60;havoc #t~mem60; {255957#false} is VALID [2022-04-15 18:29:24,043 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-15 18:29:24,043 INFO L290 TraceCheckUtils]: 201: Hoare triple {255957#false} assume !(3 == ~blastFlag~0); {255957#false} is VALID [2022-04-15 18:29:24,043 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-15 18:29:24,044 INFO L290 TraceCheckUtils]: 203: Hoare triple {255957#false} assume !(0 == ~tmp___6~0); {255957#false} is VALID [2022-04-15 18:29:24,044 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-15 18:29:24,044 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-15 18:29:24,044 INFO L290 TraceCheckUtils]: 206: Hoare triple {255957#false} ~skip~0 := 0; {255957#false} is VALID [2022-04-15 18:29:24,044 INFO L290 TraceCheckUtils]: 207: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-15 18:29:24,044 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-15 18:29:24,044 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-15 18:29:24,044 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-15 18:29:24,044 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-15 18:29:24,044 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-15 18:29:24,045 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-15 18:29:24,045 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-15 18:29:24,045 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-15 18:29:24,045 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-15 18:29:24,045 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-15 18:29:24,045 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-15 18:29:24,045 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-15 18:29:24,045 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-15 18:29:24,045 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-15 18:29:24,046 INFO L290 TraceCheckUtils]: 222: Hoare triple {255957#false} assume 4432 == #t~mem62;havoc #t~mem62; {255957#false} is VALID [2022-04-15 18:29:24,046 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-15 18:29:24,046 INFO L290 TraceCheckUtils]: 224: Hoare triple {255957#false} assume 5 == ~blastFlag~0; {255957#false} is VALID [2022-04-15 18:29:24,046 INFO L290 TraceCheckUtils]: 225: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-15 18:29:24,047 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-15 18:29:24,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:29:24,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433997732] [2022-04-15 18:29:24,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433997732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:29:24,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:29:24,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:29:24,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:29:24,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2123222571] [2022-04-15 18:29:24,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2123222571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:29:24,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:29:24,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:29:24,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604079229] [2022-04-15 18:29:24,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:29:24,048 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-15 18:29:24,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:29:24,049 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-15 18:29:24,141 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-15 18:29:24,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:29:24,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:29:24,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:29:24,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:29:24,142 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-15 18:29:26,164 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:29:28,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:29:28,066 INFO L93 Difference]: Finished difference Result 3587 states and 5152 transitions. [2022-04-15 18:29:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:29:28,066 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-15 18:29:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:29:28,066 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-15 18:29:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 18:29:28,068 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-15 18:29:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 18:29:28,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-15 18:29:28,346 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-15 18:29:28,516 INFO L225 Difference]: With dead ends: 3587 [2022-04-15 18:29:28,516 INFO L226 Difference]: Without dead ends: 2026 [2022-04-15 18:29:28,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:29:28,518 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-15 18:29:28,518 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-15 18:29:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2022-04-15 18:29:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1697. [2022-04-15 18:29:28,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:29:28,659 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-15 18:29:28,660 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-15 18:29:28,661 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-15 18:29:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:29:28,783 INFO L93 Difference]: Finished difference Result 2026 states and 2898 transitions. [2022-04-15 18:29:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2898 transitions. [2022-04-15 18:29:28,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:29:28,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:29:28,786 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-15 18:29:28,787 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-15 18:29:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:29:28,902 INFO L93 Difference]: Finished difference Result 2026 states and 2898 transitions. [2022-04-15 18:29:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2898 transitions. [2022-04-15 18:29:28,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:29:28,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:29:28,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:29:28,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:29:28,905 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-15 18:29:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2430 transitions. [2022-04-15 18:29:29,021 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2430 transitions. Word has length 226 [2022-04-15 18:29:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:29:29,022 INFO L478 AbstractCegarLoop]: Abstraction has 1697 states and 2430 transitions. [2022-04-15 18:29:29,022 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-15 18:29:29,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1697 states and 2430 transitions. [2022-04-15 18:29:31,747 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-15 18:29:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2430 transitions. [2022-04-15 18:29:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-04-15 18:29:31,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:29:31,749 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-15 18:29:31,749 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 18:29:31,749 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:29:31,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:29:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash -932058584, now seen corresponding path program 1 times [2022-04-15 18:29:31,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:29:31,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [34019313] [2022-04-15 18:29:51,872 WARN L232 SmtUtils]: Spent 14.90s 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-15 18:30:01,040 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:30:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash -932058584, now seen corresponding path program 2 times [2022-04-15 18:30:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:30:01,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400802269] [2022-04-15 18:30:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:30:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:30:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:30:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:30:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:30:01,266 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-15 18:30:01,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {270588#true} assume true; {270588#true} is VALID [2022-04-15 18:30:01,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {270588#true} {270588#true} #593#return; {270588#true} is VALID [2022-04-15 18:30:01,267 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-15 18:30:01,267 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-15 18:30:01,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {270588#true} assume true; {270588#true} is VALID [2022-04-15 18:30:01,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {270588#true} {270588#true} #593#return; {270588#true} is VALID [2022-04-15 18:30:01,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {270588#true} call #t~ret158 := main(); {270588#true} is VALID [2022-04-15 18:30:01,268 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-15 18:30:01,268 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-15 18:30:01,268 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-15 18:30:01,268 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-15 18:30:01,268 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-15 18:30:01,268 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-15 18:30:01,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-15 18:30:01,268 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-15 18:30:01,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {270588#true} assume 12292 == #t~mem49;havoc #t~mem49; {270588#true} is VALID [2022-04-15 18:30:01,269 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-15 18:30:01,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {270588#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {270588#true} is VALID [2022-04-15 18:30:01,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {270588#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {270588#true} is VALID [2022-04-15 18:30:01,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {270588#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {270588#true} is VALID [2022-04-15 18:30:01,269 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-15 18:30:01,269 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-15 18:30:01,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {270588#true} assume !(0 == ~tmp___4~0); {270588#true} is VALID [2022-04-15 18:30:01,269 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-15 18:30:01,269 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-15 18:30:01,269 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-15 18:30:01,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-15 18:30:01,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-15 18:30:01,270 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-15 18:30:01,270 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-15 18:30:01,270 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-15 18:30:01,270 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-15 18:30:01,270 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-15 18:30:01,270 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-15 18:30:01,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {270588#true} assume 4368 == #t~mem54;havoc #t~mem54; {270588#true} is VALID [2022-04-15 18:30:01,270 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-15 18:30:01,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {270588#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {270588#true} is VALID [2022-04-15 18:30:01,271 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-15 18:30:01,271 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-15 18:30:01,271 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-15 18:30:01,271 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-15 18:30:01,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-15 18:30:01,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-15 18:30:01,271 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-15 18:30:01,271 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-15 18:30:01,271 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-15 18:30:01,271 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-15 18:30:01,272 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-15 18:30:01,272 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-15 18:30:01,272 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-15 18:30:01,272 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-15 18:30:01,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {270588#true} assume 4384 == #t~mem56;havoc #t~mem56; {270588#true} is VALID [2022-04-15 18:30:01,272 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-15 18:30:01,272 INFO L290 TraceCheckUtils]: 51: Hoare triple {270588#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {270588#true} is VALID [2022-04-15 18:30:01,272 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-15 18:30:01,272 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-15 18:30:01,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {270588#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {270588#true} is VALID [2022-04-15 18:30:01,273 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-15 18:30:01,273 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-15 18:30:01,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-15 18:30:01,273 INFO L290 TraceCheckUtils]: 58: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-15 18:30:01,273 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-15 18:30:01,273 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-15 18:30:01,273 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-15 18:30:01,273 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-15 18:30:01,273 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-15 18:30:01,273 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-15 18:30:01,274 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-15 18:30:01,274 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-15 18:30:01,274 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-15 18:30:01,274 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-15 18:30:01,274 INFO L290 TraceCheckUtils]: 69: Hoare triple {270588#true} assume 4400 == #t~mem58;havoc #t~mem58; {270588#true} is VALID [2022-04-15 18:30:01,274 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-15 18:30:01,274 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-15 18:30:01,274 INFO L290 TraceCheckUtils]: 72: Hoare triple {270588#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {270588#true} is VALID [2022-04-15 18:30:01,274 INFO L290 TraceCheckUtils]: 73: Hoare triple {270588#true} assume !(~ret~0 <= 0); {270588#true} is VALID [2022-04-15 18:30:01,274 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-15 18:30:01,274 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-15 18:30:01,275 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-15 18:30:01,275 INFO L290 TraceCheckUtils]: 77: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-15 18:30:01,275 INFO L290 TraceCheckUtils]: 78: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-15 18:30:01,275 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-15 18:30:01,275 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-15 18:30:01,275 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-15 18:30:01,275 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-15 18:30:01,275 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-15 18:30:01,275 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-15 18:30:01,275 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-15 18:30:01,276 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-15 18:30:01,276 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-15 18:30:01,276 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-15 18:30:01,276 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-15 18:30:01,276 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-15 18:30:01,276 INFO L290 TraceCheckUtils]: 91: Hoare triple {270588#true} assume 4416 == #t~mem60;havoc #t~mem60; {270588#true} is VALID [2022-04-15 18:30:01,276 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-15 18:30:01,276 INFO L290 TraceCheckUtils]: 93: Hoare triple {270588#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {270588#true} is VALID [2022-04-15 18:30:01,276 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-15 18:30:01,276 INFO L290 TraceCheckUtils]: 95: Hoare triple {270588#true} assume !(0 == ~tmp___6~0); {270588#true} is VALID [2022-04-15 18:30:01,276 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-15 18:30:01,277 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-15 18:30:01,277 INFO L290 TraceCheckUtils]: 98: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-15 18:30:01,277 INFO L290 TraceCheckUtils]: 99: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-15 18:30:01,277 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-15 18:30:01,277 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-15 18:30:01,277 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-15 18:30:01,277 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-15 18:30:01,277 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-15 18:30:01,277 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-15 18:30:01,277 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-15 18:30:01,278 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-15 18:30:01,278 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-15 18:30:01,278 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-15 18:30:01,278 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-15 18:30:01,278 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-15 18:30:01,278 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-15 18:30:01,278 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-15 18:30:01,278 INFO L290 TraceCheckUtils]: 114: Hoare triple {270588#true} assume 4432 == #t~mem62;havoc #t~mem62; {270588#true} is VALID [2022-04-15 18:30:01,278 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-15 18:30:01,278 INFO L290 TraceCheckUtils]: 116: Hoare triple {270588#true} assume !(5 == ~blastFlag~0); {270588#true} is VALID [2022-04-15 18:30:01,279 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-15 18:30:01,279 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-15 18:30:01,279 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-15 18:30:01,279 INFO L290 TraceCheckUtils]: 120: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-15 18:30:01,279 INFO L290 TraceCheckUtils]: 121: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-15 18:30:01,279 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-15 18:30:01,279 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-15 18:30:01,279 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-15 18:30:01,279 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-15 18:30:01,279 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-15 18:30:01,280 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-15 18:30:01,280 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-15 18:30:01,280 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-15 18:30:01,280 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-15 18:30:01,280 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-15 18:30:01,280 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-15 18:30:01,280 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-15 18:30:01,280 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-15 18:30:01,280 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-15 18:30:01,280 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-15 18:30:01,281 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-15 18:30:01,281 INFO L290 TraceCheckUtils]: 138: Hoare triple {270588#true} assume 4448 == #t~mem64;havoc #t~mem64; {270588#true} is VALID [2022-04-15 18:30:01,281 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-15 18:30:01,281 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-15 18:30:01,287 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-15 18:30:01,288 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-15 18:30:01,288 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-15 18:30:01,289 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-15 18:30:01,289 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-15 18:30:01,290 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-15 18:30:01,290 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-15 18:30:01,290 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-15 18:30:01,291 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-15 18:30:01,291 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-15 18:30:01,291 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-15 18:30:01,292 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-15 18:30:01,292 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-15 18:30:01,292 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-15 18:30:01,293 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-15 18:30:01,293 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-15 18:30:01,293 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-15 18:30:01,293 INFO L290 TraceCheckUtils]: 158: Hoare triple {270589#false} assume !(1 == ~blastFlag~0); {270589#false} is VALID [2022-04-15 18:30:01,293 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-15 18:30:01,293 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-15 18:30:01,293 INFO L290 TraceCheckUtils]: 161: Hoare triple {270589#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {270589#false} is VALID [2022-04-15 18:30:01,293 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-15 18:30:01,294 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-15 18:30:01,294 INFO L290 TraceCheckUtils]: 164: Hoare triple {270589#false} ~skip~0 := 0; {270589#false} is VALID [2022-04-15 18:30:01,294 INFO L290 TraceCheckUtils]: 165: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-15 18:30:01,294 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-15 18:30:01,294 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-15 18:30:01,294 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-15 18:30:01,294 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-15 18:30:01,294 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-15 18:30:01,294 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-15 18:30:01,294 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-15 18:30:01,294 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-15 18:30:01,294 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-15 18:30:01,294 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-15 18:30:01,294 INFO L290 TraceCheckUtils]: 176: Hoare triple {270589#false} assume 4400 == #t~mem58;havoc #t~mem58; {270589#false} is VALID [2022-04-15 18:30:01,294 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-15 18:30:01,295 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-15 18:30:01,295 INFO L290 TraceCheckUtils]: 179: Hoare triple {270589#false} assume !(2 == ~blastFlag~0); {270589#false} is VALID [2022-04-15 18:30:01,295 INFO L290 TraceCheckUtils]: 180: Hoare triple {270589#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {270589#false} is VALID [2022-04-15 18:30:01,295 INFO L290 TraceCheckUtils]: 181: Hoare triple {270589#false} assume !(~ret~0 <= 0); {270589#false} is VALID [2022-04-15 18:30:01,295 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-15 18:30:01,295 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-15 18:30:01,295 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-15 18:30:01,295 INFO L290 TraceCheckUtils]: 185: Hoare triple {270589#false} ~skip~0 := 0; {270589#false} is VALID [2022-04-15 18:30:01,295 INFO L290 TraceCheckUtils]: 186: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-15 18:30:01,295 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-15 18:30:01,295 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-15 18:30:01,295 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-15 18:30:01,295 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-15 18:30:01,295 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-15 18:30:01,296 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-15 18:30:01,296 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-15 18:30:01,296 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-15 18:30:01,296 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-15 18:30:01,296 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-15 18:30:01,296 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-15 18:30:01,296 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-15 18:30:01,296 INFO L290 TraceCheckUtils]: 199: Hoare triple {270589#false} assume 4416 == #t~mem60;havoc #t~mem60; {270589#false} is VALID [2022-04-15 18:30:01,296 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-15 18:30:01,296 INFO L290 TraceCheckUtils]: 201: Hoare triple {270589#false} assume !(3 == ~blastFlag~0); {270589#false} is VALID [2022-04-15 18:30:01,296 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-15 18:30:01,296 INFO L290 TraceCheckUtils]: 203: Hoare triple {270589#false} assume !(0 == ~tmp___6~0); {270589#false} is VALID [2022-04-15 18:30:01,296 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-15 18:30:01,296 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-15 18:30:01,297 INFO L290 TraceCheckUtils]: 206: Hoare triple {270589#false} ~skip~0 := 0; {270589#false} is VALID [2022-04-15 18:30:01,297 INFO L290 TraceCheckUtils]: 207: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,297 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-15 18:30:01,298 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-15 18:30:01,298 INFO L290 TraceCheckUtils]: 222: Hoare triple {270589#false} assume 4432 == #t~mem62;havoc #t~mem62; {270589#false} is VALID [2022-04-15 18:30:01,298 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-15 18:30:01,298 INFO L290 TraceCheckUtils]: 224: Hoare triple {270589#false} assume 5 == ~blastFlag~0; {270589#false} is VALID [2022-04-15 18:30:01,298 INFO L290 TraceCheckUtils]: 225: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-15 18:30:01,298 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-15 18:30:01,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:30:01,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400802269] [2022-04-15 18:30:01,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400802269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:30:01,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:30:01,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:30:01,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:30:01,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [34019313] [2022-04-15 18:30:01,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [34019313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:30:01,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:30:01,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:30:01,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580248798] [2022-04-15 18:30:01,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:30:01,300 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-15 18:30:01,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:30:01,300 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-15 18:30:01,380 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-15 18:30:01,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:30:01,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:30:01,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:30:01,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:30:01,381 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-15 18:30:03,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:30:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:30:05,392 INFO L93 Difference]: Finished difference Result 3821 states and 5470 transitions. [2022-04-15 18:30:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:30:05,392 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-15 18:30:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:30:05,393 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-15 18:30:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 18:30:05,394 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-15 18:30:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 18:30:05,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-15 18:30:05,668 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-15 18:30:05,899 INFO L225 Difference]: With dead ends: 3821 [2022-04-15 18:30:05,900 INFO L226 Difference]: Without dead ends: 2140 [2022-04-15 18:30:05,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:30:05,903 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-15 18:30:05,903 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-15 18:30:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2022-04-15 18:30:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1691. [2022-04-15 18:30:06,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:30:06,065 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-15 18:30:06,066 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-15 18:30:06,067 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-15 18:30:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:30:06,186 INFO L93 Difference]: Finished difference Result 2140 states and 3054 transitions. [2022-04-15 18:30:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3054 transitions. [2022-04-15 18:30:06,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:30:06,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:30:06,189 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-15 18:30:06,190 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-15 18:30:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:30:06,369 INFO L93 Difference]: Finished difference Result 2140 states and 3054 transitions. [2022-04-15 18:30:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3054 transitions. [2022-04-15 18:30:06,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:30:06,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:30:06,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:30:06,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:30:06,374 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-15 18:30:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2424 transitions. [2022-04-15 18:30:06,626 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2424 transitions. Word has length 226 [2022-04-15 18:30:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:30:06,626 INFO L478 AbstractCegarLoop]: Abstraction has 1691 states and 2424 transitions. [2022-04-15 18:30:06,626 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-15 18:30:06,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1691 states and 2424 transitions. [2022-04-15 18:30:09,556 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-15 18:30:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2424 transitions. [2022-04-15 18:30:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-04-15 18:30:09,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:30:09,558 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-15 18:30:09,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 18:30:09,558 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:30:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:30:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1157522256, now seen corresponding path program 1 times [2022-04-15 18:30:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:30:09,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1752552159]