/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.02.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 15:11:12,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 15:11:12,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 15:11:12,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 15:11:12,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 15:11:12,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 15:11:12,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 15:11:12,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 15:11:12,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 15:11:12,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 15:11:12,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 15:11:12,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 15:11:12,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 15:11:12,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 15:11:12,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 15:11:12,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 15:11:12,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 15:11:12,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 15:11:12,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 15:11:12,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 15:11:12,872 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 15:11:12,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 15:11:12,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 15:11:12,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 15:11:12,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 15:11:12,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 15:11:12,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 15:11:12,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 15:11:12,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 15:11:12,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 15:11:12,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 15:11:12,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 15:11:12,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 15:11:12,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 15:11:12,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 15:11:12,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 15:11:12,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 15:11:12,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 15:11:12,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 15:11:12,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 15:11:12,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 15:11:12,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 15:11:12,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 15:11:12,907 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 15:11:12,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 15:11:12,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 15:11:12,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 15:11:12,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 15:11:12,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 15:11:12,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 15:11:12,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 15:11:12,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 15:11:12,909 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 15:11:12,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 15:11:12,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 15:11:12,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 15:11:12,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 15:11:12,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 15:11:12,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:11:12,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 15:11:12,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 15:11:12,910 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 15:11:12,910 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 15:11:12,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 15:11:12,910 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 15:11:12,911 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 15:11:13,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 15:11:13,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 15:11:13,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 15:11:13,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 15:11:13,138 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 15:11:13,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-2.c [2022-04-08 15:11:13,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccc84d4e/5c433af68a6643baa9eefcfd38fa8966/FLAG481743fb2 [2022-04-08 15:11:13,564 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 15:11:13,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-2.c [2022-04-08 15:11:13,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccc84d4e/5c433af68a6643baa9eefcfd38fa8966/FLAG481743fb2 [2022-04-08 15:11:13,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccc84d4e/5c433af68a6643baa9eefcfd38fa8966 [2022-04-08 15:11:13,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 15:11:13,931 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 15:11:13,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 15:11:13,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 15:11:13,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 15:11:13,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:11:13" (1/1) ... [2022-04-08 15:11:13,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d4c3202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:13, skipping insertion in model container [2022-04-08 15:11:13,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:11:13" (1/1) ... [2022-04-08 15:11:13,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 15:11:13,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 15:11:14,289 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.02.i.cil-2.c[65398,65411] [2022-04-08 15:11:14,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:11:14,304 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 15:11:14,385 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.02.i.cil-2.c[65398,65411] [2022-04-08 15:11:14,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:11:14,411 INFO L208 MainTranslator]: Completed translation [2022-04-08 15:11:14,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:14 WrapperNode [2022-04-08 15:11:14,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 15:11:14,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 15:11:14,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 15:11:14,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 15:11:14,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:14" (1/1) ... [2022-04-08 15:11:14,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:14" (1/1) ... [2022-04-08 15:11:14,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:14" (1/1) ... [2022-04-08 15:11:14,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:14" (1/1) ... [2022-04-08 15:11:14,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:14" (1/1) ... [2022-04-08 15:11:14,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:14" (1/1) ... [2022-04-08 15:11:14,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:14" (1/1) ... [2022-04-08 15:11:14,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 15:11:14,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 15:11:14,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 15:11:14,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 15:11:14,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:14" (1/1) ... [2022-04-08 15:11:14,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:11:14,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 15:11:14,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 15:11:14,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 15:11:14,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 15:11:14,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 15:11:14,605 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 15:11:14,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-08 15:11:14,605 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-08 15:11:14,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 15:11:14,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-08 15:11:14,606 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 15:11:14,606 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 15:11:14,606 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 15:11:14,606 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 15:11:14,606 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 15:11:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 15:11:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 15:11:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 15:11:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 15:11:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 15:11:14,771 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 15:11:14,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 15:11:16,139 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:11:16,531 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-08 15:11:16,531 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-08 15:11:16,540 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 15:11:16,545 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 15:11:16,546 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 15:11:16,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:11:16 BoogieIcfgContainer [2022-04-08 15:11:16,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 15:11:16,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 15:11:16,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 15:11:16,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 15:11:16,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:11:13" (1/3) ... [2022-04-08 15:11:16,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338eddd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:11:16, skipping insertion in model container [2022-04-08 15:11:16,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:14" (2/3) ... [2022-04-08 15:11:16,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338eddd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:11:16, skipping insertion in model container [2022-04-08 15:11:16,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:11:16" (3/3) ... [2022-04-08 15:11:16,552 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-2.c [2022-04-08 15:11:16,555 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 15:11:16,555 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 15:11:16,586 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 15:11:16,598 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 15:11:16,599 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 15:11:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 15:11:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 15:11:16,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:16,627 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:11:16,627 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:16,631 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-08 15:11:16,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:16,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [450880925] [2022-04-08 15:11:16,644 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:11:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-08 15:11:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:16,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726402050] [2022-04-08 15:11:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:16,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:17,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-08 15:11:17,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-08 15:11:17,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-08 15:11:17,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:11:17,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-08 15:11:17,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-08 15:11:17,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-08 15:11:17,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-08 15:11:17,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-08 15:11:17,096 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-08 15:11:17,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:11:17,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:11:17,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:11:17,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:11:17,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:11:17,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-08 15:11:17,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:17,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-08 15:11:17,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-08 15:11:17,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-08 15:11:17,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-08 15:11:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:11:17,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:17,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726402050] [2022-04-08 15:11:17,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726402050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:17,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:17,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:17,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:17,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [450880925] [2022-04-08 15:11:17,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [450880925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:17,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:17,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679670540] [2022-04-08 15:11:17,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:17,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 15:11:17,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:17,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:17,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:17,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:11:17,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:11:17,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:11:17,164 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:19,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:20,172 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-08 15:11:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:11:20,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 15:11:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 15:11:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 15:11:20,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-08 15:11:20,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:20,454 INFO L225 Difference]: With dead ends: 267 [2022-04-08 15:11:20,454 INFO L226 Difference]: Without dead ends: 122 [2022-04-08 15:11:20,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:11:20,462 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:20,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:11:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-08 15:11:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-08 15:11:20,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:20,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:20,507 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:20,507 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:20,515 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-08 15:11:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-08 15:11:20,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:20,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:20,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-08 15:11:20,517 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-08 15:11:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:20,525 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-08 15:11:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-08 15:11:20,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:20,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:20,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:20,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-08 15:11:20,538 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-08 15:11:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:20,538 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-08 15:11:20,538 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:20,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-08 15:11:20,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:20,656 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-08 15:11:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 15:11:20,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:20,658 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:11:20,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 15:11:20,659 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:20,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-08 15:11:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:20,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [942344965] [2022-04-08 15:11:20,660 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-08 15:11:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:20,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21687555] [2022-04-08 15:11:20,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:20,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-08 15:11:20,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-08 15:11:20,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-08 15:11:20,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:11:20,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-08 15:11:20,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-08 15:11:20,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-08 15:11:20,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-08 15:11:20,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1173#true} is VALID [2022-04-08 15:11:20,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {1173#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1173#true} is VALID [2022-04-08 15:11:20,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 56 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:20,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-08 15:11:20,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-08 15:11:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 15:11:20,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:20,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21687555] [2022-04-08 15:11:20,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21687555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:20,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:20,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:20,919 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:20,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [942344965] [2022-04-08 15:11:20,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [942344965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:20,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:20,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:20,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624271125] [2022-04-08 15:11:20,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:20,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 15:11:20,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:20,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:20,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:20,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:11:20,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:20,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:11:20,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:20,957 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:22,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:23,569 INFO L93 Difference]: Finished difference Result 326 states and 488 transitions. [2022-04-08 15:11:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:11:23,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 15:11:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-08 15:11:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-08 15:11:23,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 485 transitions. [2022-04-08 15:11:23,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:23,890 INFO L225 Difference]: With dead ends: 326 [2022-04-08 15:11:23,890 INFO L226 Difference]: Without dead ends: 221 [2022-04-08 15:11:23,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:23,891 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:23,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 320 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:11:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-08 15:11:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-04-08 15:11:23,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:23,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:23,915 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:23,915 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:23,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:23,921 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-08 15:11:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-08 15:11:23,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:23,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:23,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 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 221 states. [2022-04-08 15:11:23,923 INFO L87 Difference]: Start difference. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 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 221 states. [2022-04-08 15:11:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:23,929 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-08 15:11:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-08 15:11:23,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:23,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:23,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:23,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 325 transitions. [2022-04-08 15:11:23,937 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 325 transitions. Word has length 44 [2022-04-08 15:11:23,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:23,938 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 325 transitions. [2022-04-08 15:11:23,938 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:23,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 325 transitions. [2022-04-08 15:11:24,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-08 15:11:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 15:11:24,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:24,221 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:11:24,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 15:11:24,222 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 1 times [2022-04-08 15:11:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:24,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829685886] [2022-04-08 15:11:24,223 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 2 times [2022-04-08 15:11:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:24,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798009747] [2022-04-08 15:11:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:24,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:24,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {2725#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {2718#true} is VALID [2022-04-08 15:11:24,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {2718#true} assume true; {2718#true} is VALID [2022-04-08 15:11:24,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2718#true} {2718#true} #593#return; {2718#true} is VALID [2022-04-08 15:11:24,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {2718#true} call ULTIMATE.init(); {2725#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:11:24,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {2725#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {2718#true} is VALID [2022-04-08 15:11:24,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {2718#true} assume true; {2718#true} is VALID [2022-04-08 15:11:24,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2718#true} {2718#true} #593#return; {2718#true} is VALID [2022-04-08 15:11:24,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {2718#true} call #t~ret158 := main(); {2718#true} is VALID [2022-04-08 15:11:24,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {2718#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; {2718#true} is VALID [2022-04-08 15:11:24,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {2718#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2718#true} is VALID [2022-04-08 15:11:24,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {2718#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); {2718#true} is VALID [2022-04-08 15:11:24,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {2718#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; {2718#true} is VALID [2022-04-08 15:11:24,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {2718#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; {2718#true} is VALID [2022-04-08 15:11:24,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {2718#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2718#true} is VALID [2022-04-08 15:11:24,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {2718#true} assume !false; {2718#true} is VALID [2022-04-08 15:11:24,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {2718#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:24,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {2718#true} assume 12292 == #t~mem49;havoc #t~mem49; {2718#true} is VALID [2022-04-08 15:11:24,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {2718#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; {2718#true} is VALID [2022-04-08 15:11:24,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {2718#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:24,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {2718#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2718#true} is VALID [2022-04-08 15:11:24,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {2718#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:24,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {2718#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); {2718#true} is VALID [2022-04-08 15:11:24,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {2718#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {2718#true} is VALID [2022-04-08 15:11:24,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {2718#true} assume !(0 == ~tmp___4~0); {2718#true} is VALID [2022-04-08 15:11:24,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {2718#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); {2718#true} is VALID [2022-04-08 15:11:24,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {2718#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); {2718#true} is VALID [2022-04-08 15:11:24,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {2718#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2718#true} is VALID [2022-04-08 15:11:24,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {2718#true} ~skip~0 := 0; {2718#true} is VALID [2022-04-08 15:11:24,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {2718#true} assume !false; {2718#true} is VALID [2022-04-08 15:11:24,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {2718#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:24,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {2718#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:24,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {2718#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:24,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {2718#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:24,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {2718#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:24,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {2718#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:24,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {2718#true} assume 4368 == #t~mem54;havoc #t~mem54; {2718#true} is VALID [2022-04-08 15:11:24,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {2718#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; {2718#true} is VALID [2022-04-08 15:11:24,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {2718#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2718#true} is VALID [2022-04-08 15:11:24,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {2718#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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#(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; {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {2723#(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; {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {2723#(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); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:24,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {2723#(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); {2724#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-08 15:11:24,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {2724#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {2719#false} is VALID [2022-04-08 15:11:24,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {2719#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {2719#false} is VALID [2022-04-08 15:11:24,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {2719#false} assume 5 == ~blastFlag~0; {2719#false} is VALID [2022-04-08 15:11:24,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {2719#false} assume !false; {2719#false} is VALID [2022-04-08 15:11:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 15:11:24,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:24,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798009747] [2022-04-08 15:11:24,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798009747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:24,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:24,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:24,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:24,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829685886] [2022-04-08 15:11:24,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829685886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:24,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:24,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686517653] [2022-04-08 15:11:24,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:24,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-08 15:11:24,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:24,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:24,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:24,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:11:24,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:24,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:11:24,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:11:24,531 INFO L87 Difference]: Start difference. First operand 221 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:26,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:27,539 INFO L93 Difference]: Finished difference Result 608 states and 905 transitions. [2022-04-08 15:11:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:11:27,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-08 15:11:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:11:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:11:27,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 15:11:27,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:27,865 INFO L225 Difference]: With dead ends: 608 [2022-04-08 15:11:27,865 INFO L226 Difference]: Without dead ends: 403 [2022-04-08 15:11:27,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:11:27,873 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:27,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 279 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:11:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-08 15:11:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 269. [2022-04-08 15:11:27,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:27,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:27,892 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:27,892 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:27,903 INFO L93 Difference]: Finished difference Result 403 states and 598 transitions. [2022-04-08 15:11:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 598 transitions. [2022-04-08 15:11:27,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:27,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:27,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 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 403 states. [2022-04-08 15:11:27,906 INFO L87 Difference]: Start difference. First operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 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 403 states. [2022-04-08 15:11:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:27,925 INFO L93 Difference]: Finished difference Result 403 states and 598 transitions. [2022-04-08 15:11:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 598 transitions. [2022-04-08 15:11:27,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:27,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:27,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:27,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 409 transitions. [2022-04-08 15:11:27,932 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 409 transitions. Word has length 59 [2022-04-08 15:11:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:27,932 INFO L478 AbstractCegarLoop]: Abstraction has 269 states and 409 transitions. [2022-04-08 15:11:27,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:27,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 269 states and 409 transitions. [2022-04-08 15:11:28,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 409 transitions. [2022-04-08 15:11:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 15:11:28,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:28,203 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:11:28,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 15:11:28,203 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:28,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1214470671, now seen corresponding path program 1 times [2022-04-08 15:11:28,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:28,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [799840623] [2022-04-08 15:11:28,204 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1214470671, now seen corresponding path program 2 times [2022-04-08 15:11:28,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:28,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346058016] [2022-04-08 15:11:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:28,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {5297#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {5290#true} is VALID [2022-04-08 15:11:28,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {5290#true} assume true; {5290#true} is VALID [2022-04-08 15:11:28,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5290#true} {5290#true} #593#return; {5290#true} is VALID [2022-04-08 15:11:28,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {5290#true} call ULTIMATE.init(); {5297#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:11:28,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {5297#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {5290#true} is VALID [2022-04-08 15:11:28,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {5290#true} assume true; {5290#true} is VALID [2022-04-08 15:11:28,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5290#true} {5290#true} #593#return; {5290#true} is VALID [2022-04-08 15:11:28,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {5290#true} call #t~ret158 := main(); {5290#true} is VALID [2022-04-08 15:11:28,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {5290#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; {5290#true} is VALID [2022-04-08 15:11:28,388 INFO L272 TraceCheckUtils]: 6: Hoare triple {5290#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {5290#true} is VALID [2022-04-08 15:11:28,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {5290#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); {5290#true} is VALID [2022-04-08 15:11:28,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {5290#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; {5290#true} is VALID [2022-04-08 15:11:28,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {5290#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; {5290#true} is VALID [2022-04-08 15:11:28,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {5290#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5290#true} is VALID [2022-04-08 15:11:28,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {5290#true} assume !false; {5290#true} is VALID [2022-04-08 15:11:28,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {5290#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:28,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {5290#true} assume 12292 == #t~mem49;havoc #t~mem49; {5290#true} is VALID [2022-04-08 15:11:28,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {5290#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; {5290#true} is VALID [2022-04-08 15:11:28,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {5290#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:28,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {5290#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {5290#true} is VALID [2022-04-08 15:11:28,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {5290#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:28,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {5290#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); {5290#true} is VALID [2022-04-08 15:11:28,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {5290#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {5290#true} is VALID [2022-04-08 15:11:28,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {5290#true} assume !(0 == ~tmp___4~0); {5290#true} is VALID [2022-04-08 15:11:28,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {5290#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); {5290#true} is VALID [2022-04-08 15:11:28,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {5290#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); {5290#true} is VALID [2022-04-08 15:11:28,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {5290#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {5290#true} is VALID [2022-04-08 15:11:28,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {5290#true} ~skip~0 := 0; {5290#true} is VALID [2022-04-08 15:11:28,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {5290#true} assume !false; {5290#true} is VALID [2022-04-08 15:11:28,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {5290#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:28,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {5290#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:28,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {5290#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:28,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {5290#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:28,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {5290#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:28,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {5290#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:28,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {5290#true} assume 4368 == #t~mem54;havoc #t~mem54; {5290#true} is VALID [2022-04-08 15:11:28,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {5290#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; {5290#true} is VALID [2022-04-08 15:11:28,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {5290#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5290#true} is VALID [2022-04-08 15:11:28,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {5290#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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {5295#(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; {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {5295#(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; {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} ~skip~0 := 0; {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !false; {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,397 INFO L290 TraceCheckUtils]: 48: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,397 INFO L290 TraceCheckUtils]: 51: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {5295#(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); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:28,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {5295#(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); {5296#(not (= |ssl3_connect_#t~mem63| 4433))} is VALID [2022-04-08 15:11:28,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {5296#(not (= |ssl3_connect_#t~mem63| 4433))} assume 4433 == #t~mem63;havoc #t~mem63; {5291#false} is VALID [2022-04-08 15:11:28,399 INFO L290 TraceCheckUtils]: 57: Hoare triple {5291#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {5291#false} is VALID [2022-04-08 15:11:28,399 INFO L290 TraceCheckUtils]: 58: Hoare triple {5291#false} assume 5 == ~blastFlag~0; {5291#false} is VALID [2022-04-08 15:11:28,399 INFO L290 TraceCheckUtils]: 59: Hoare triple {5291#false} assume !false; {5291#false} is VALID [2022-04-08 15:11:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 15:11:28,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:28,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346058016] [2022-04-08 15:11:28,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346058016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:28,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:28,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:28,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:28,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [799840623] [2022-04-08 15:11:28,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [799840623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:28,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:28,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:28,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275265138] [2022-04-08 15:11:28,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:28,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-08 15:11:28,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:28,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:28,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:28,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:11:28,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:28,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:11:28,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:11:28,451 INFO L87 Difference]: Start difference. First operand 269 states and 409 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:30,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:31,433 INFO L93 Difference]: Finished difference Result 704 states and 1073 transitions. [2022-04-08 15:11:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:11:31,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-08 15:11:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:11:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:11:31,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 15:11:31,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:31,804 INFO L225 Difference]: With dead ends: 704 [2022-04-08 15:11:31,804 INFO L226 Difference]: Without dead ends: 451 [2022-04-08 15:11:31,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:11:31,805 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:31,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:11:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-08 15:11:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 319. [2022-04-08 15:11:31,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:31,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:31,820 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:31,820 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:31,830 INFO L93 Difference]: Finished difference Result 451 states and 682 transitions. [2022-04-08 15:11:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 682 transitions. [2022-04-08 15:11:31,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:31,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:31,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 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 451 states. [2022-04-08 15:11:31,831 INFO L87 Difference]: Start difference. First operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 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 451 states. [2022-04-08 15:11:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:31,841 INFO L93 Difference]: Finished difference Result 451 states and 682 transitions. [2022-04-08 15:11:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 682 transitions. [2022-04-08 15:11:31,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:31,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:31,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:31,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 497 transitions. [2022-04-08 15:11:31,849 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 497 transitions. Word has length 60 [2022-04-08 15:11:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:31,849 INFO L478 AbstractCegarLoop]: Abstraction has 319 states and 497 transitions. [2022-04-08 15:11:31,849 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:31,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 319 states and 497 transitions. [2022-04-08 15:11:32,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 497 edges. 497 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 497 transitions. [2022-04-08 15:11:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 15:11:32,209 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:32,209 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:11:32,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 15:11:32,210 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:32,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2050349165, now seen corresponding path program 1 times [2022-04-08 15:11:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:32,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2065659712] [2022-04-08 15:11:32,210 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2050349165, now seen corresponding path program 2 times [2022-04-08 15:11:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:32,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287888422] [2022-04-08 15:11:32,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:32,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:32,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:32,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {8256#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {8250#true} is VALID [2022-04-08 15:11:32,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {8250#true} assume true; {8250#true} is VALID [2022-04-08 15:11:32,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8250#true} {8250#true} #593#return; {8250#true} is VALID [2022-04-08 15:11:32,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {8250#true} call ULTIMATE.init(); {8256#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:11:32,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {8256#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {8250#true} is VALID [2022-04-08 15:11:32,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {8250#true} assume true; {8250#true} is VALID [2022-04-08 15:11:32,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8250#true} {8250#true} #593#return; {8250#true} is VALID [2022-04-08 15:11:32,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {8250#true} call #t~ret158 := main(); {8250#true} is VALID [2022-04-08 15:11:32,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {8250#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; {8250#true} is VALID [2022-04-08 15:11:32,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {8250#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {8250#true} is VALID [2022-04-08 15:11:32,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {8250#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); {8250#true} is VALID [2022-04-08 15:11:32,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {8250#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; {8250#true} is VALID [2022-04-08 15:11:32,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {8250#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; {8250#true} is VALID [2022-04-08 15:11:32,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {8250#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8250#true} is VALID [2022-04-08 15:11:32,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {8250#true} assume !false; {8250#true} is VALID [2022-04-08 15:11:32,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {8250#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:32,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {8250#true} assume 12292 == #t~mem49;havoc #t~mem49; {8250#true} is VALID [2022-04-08 15:11:32,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {8250#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; {8250#true} is VALID [2022-04-08 15:11:32,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {8250#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:32,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {8250#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8250#true} is VALID [2022-04-08 15:11:32,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {8250#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:32,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {8250#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); {8250#true} is VALID [2022-04-08 15:11:32,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {8250#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {8250#true} is VALID [2022-04-08 15:11:32,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {8250#true} assume !(0 == ~tmp___4~0); {8250#true} is VALID [2022-04-08 15:11:32,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {8250#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); {8250#true} is VALID [2022-04-08 15:11:32,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {8250#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); {8250#true} is VALID [2022-04-08 15:11:32,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {8250#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8250#true} is VALID [2022-04-08 15:11:32,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {8250#true} ~skip~0 := 0; {8250#true} is VALID [2022-04-08 15:11:32,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {8250#true} assume !false; {8250#true} is VALID [2022-04-08 15:11:32,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {8250#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:32,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {8250#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:32,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {8250#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:32,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {8250#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:32,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {8250#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:32,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {8250#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:32,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {8250#true} assume 4368 == #t~mem54;havoc #t~mem54; {8250#true} is VALID [2022-04-08 15:11:32,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {8250#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; {8250#true} is VALID [2022-04-08 15:11:32,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {8250#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {8255#(= 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); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {8255#(= 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; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {8255#(= 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); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !false; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {8255#(= 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); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,372 INFO L290 TraceCheckUtils]: 47: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,374 INFO L290 TraceCheckUtils]: 50: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,374 INFO L290 TraceCheckUtils]: 51: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume 4416 == #t~mem60;havoc #t~mem60; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,375 INFO L290 TraceCheckUtils]: 54: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:32,375 INFO L290 TraceCheckUtils]: 55: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {8251#false} is VALID [2022-04-08 15:11:32,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {8251#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); {8251#false} is VALID [2022-04-08 15:11:32,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {8251#false} assume !(0 == ~tmp___6~0); {8251#false} is VALID [2022-04-08 15:11:32,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {8251#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); {8251#false} is VALID [2022-04-08 15:11:32,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {8251#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8251#false} is VALID [2022-04-08 15:11:32,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {8251#false} ~skip~0 := 0; {8251#false} is VALID [2022-04-08 15:11:32,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {8251#false} assume !false; {8251#false} is VALID [2022-04-08 15:11:32,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {8251#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); {8251#false} is VALID [2022-04-08 15:11:32,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {8251#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,376 INFO L290 TraceCheckUtils]: 64: Hoare triple {8251#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,376 INFO L290 TraceCheckUtils]: 65: Hoare triple {8251#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,376 INFO L290 TraceCheckUtils]: 66: Hoare triple {8251#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,376 INFO L290 TraceCheckUtils]: 67: Hoare triple {8251#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,376 INFO L290 TraceCheckUtils]: 68: Hoare triple {8251#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,376 INFO L290 TraceCheckUtils]: 69: Hoare triple {8251#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,377 INFO L290 TraceCheckUtils]: 70: Hoare triple {8251#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,377 INFO L290 TraceCheckUtils]: 71: Hoare triple {8251#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,377 INFO L290 TraceCheckUtils]: 72: Hoare triple {8251#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {8251#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,377 INFO L290 TraceCheckUtils]: 74: Hoare triple {8251#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,377 INFO L290 TraceCheckUtils]: 75: Hoare triple {8251#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:32,377 INFO L290 TraceCheckUtils]: 76: Hoare triple {8251#false} assume 4432 == #t~mem62;havoc #t~mem62; {8251#false} is VALID [2022-04-08 15:11:32,377 INFO L290 TraceCheckUtils]: 77: Hoare triple {8251#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {8251#false} is VALID [2022-04-08 15:11:32,377 INFO L290 TraceCheckUtils]: 78: Hoare triple {8251#false} assume 5 == ~blastFlag~0; {8251#false} is VALID [2022-04-08 15:11:32,377 INFO L290 TraceCheckUtils]: 79: Hoare triple {8251#false} assume !false; {8251#false} is VALID [2022-04-08 15:11:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 15:11:32,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:32,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287888422] [2022-04-08 15:11:32,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287888422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:32,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:32,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:32,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:32,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2065659712] [2022-04-08 15:11:32,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2065659712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:32,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:32,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446728346] [2022-04-08 15:11:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:32,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 15:11:32,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:32,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:32,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:32,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:11:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:32,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:11:32,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:32,437 INFO L87 Difference]: Start difference. First operand 319 states and 497 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:34,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:35,412 INFO L93 Difference]: Finished difference Result 622 states and 980 transitions. [2022-04-08 15:11:35,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:11:35,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 15:11:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-08 15:11:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-08 15:11:35,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 486 transitions. [2022-04-08 15:11:35,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:35,754 INFO L225 Difference]: With dead ends: 622 [2022-04-08 15:11:35,754 INFO L226 Difference]: Without dead ends: 468 [2022-04-08 15:11:35,755 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:35,755 INFO L913 BasicCegarLoop]: 307 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:35,755 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 469 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 331 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:11:35,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-08 15:11:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2022-04-08 15:11:35,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:35,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:35,780 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:35,781 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:35,791 INFO L93 Difference]: Finished difference Result 468 states and 730 transitions. [2022-04-08 15:11:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 730 transitions. [2022-04-08 15:11:35,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:35,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:35,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 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 468 states. [2022-04-08 15:11:35,793 INFO L87 Difference]: Start difference. First operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 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 468 states. [2022-04-08 15:11:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:35,803 INFO L93 Difference]: Finished difference Result 468 states and 730 transitions. [2022-04-08 15:11:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 730 transitions. [2022-04-08 15:11:35,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:35,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:35,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:35,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 730 transitions. [2022-04-08 15:11:35,817 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 730 transitions. Word has length 80 [2022-04-08 15:11:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:35,817 INFO L478 AbstractCegarLoop]: Abstraction has 468 states and 730 transitions. [2022-04-08 15:11:35,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:35,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 468 states and 730 transitions. [2022-04-08 15:11:36,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 730 edges. 730 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 730 transitions. [2022-04-08 15:11:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 15:11:36,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:36,384 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:11:36,384 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 15:11:36,384 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash 684039926, now seen corresponding path program 1 times [2022-04-08 15:11:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:36,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1353216210] [2022-04-08 15:11:36,385 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash 684039926, now seen corresponding path program 2 times [2022-04-08 15:11:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:36,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032494315] [2022-04-08 15:11:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:36,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:36,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {11381#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {11375#true} is VALID [2022-04-08 15:11:36,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {11375#true} assume true; {11375#true} is VALID [2022-04-08 15:11:36,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11375#true} {11375#true} #593#return; {11375#true} is VALID [2022-04-08 15:11:36,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {11375#true} call ULTIMATE.init(); {11381#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:11:36,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {11381#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {11375#true} is VALID [2022-04-08 15:11:36,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {11375#true} assume true; {11375#true} is VALID [2022-04-08 15:11:36,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11375#true} {11375#true} #593#return; {11375#true} is VALID [2022-04-08 15:11:36,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {11375#true} call #t~ret158 := main(); {11375#true} is VALID [2022-04-08 15:11:36,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {11375#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; {11375#true} is VALID [2022-04-08 15:11:36,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {11375#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11375#true} is VALID [2022-04-08 15:11:36,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {11375#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); {11375#true} is VALID [2022-04-08 15:11:36,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {11375#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; {11375#true} is VALID [2022-04-08 15:11:36,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {11375#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; {11375#true} is VALID [2022-04-08 15:11:36,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {11375#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11375#true} is VALID [2022-04-08 15:11:36,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {11375#true} assume !false; {11375#true} is VALID [2022-04-08 15:11:36,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {11375#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {11375#true} assume 12292 == #t~mem49;havoc #t~mem49; {11375#true} is VALID [2022-04-08 15:11:36,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {11375#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; {11375#true} is VALID [2022-04-08 15:11:36,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {11375#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {11375#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11375#true} is VALID [2022-04-08 15:11:36,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {11375#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {11375#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); {11375#true} is VALID [2022-04-08 15:11:36,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {11375#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {11375#true} is VALID [2022-04-08 15:11:36,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {11375#true} assume !(0 == ~tmp___4~0); {11375#true} is VALID [2022-04-08 15:11:36,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {11375#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); {11375#true} is VALID [2022-04-08 15:11:36,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {11375#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); {11375#true} is VALID [2022-04-08 15:11:36,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {11375#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11375#true} is VALID [2022-04-08 15:11:36,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {11375#true} ~skip~0 := 0; {11375#true} is VALID [2022-04-08 15:11:36,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {11375#true} assume !false; {11375#true} is VALID [2022-04-08 15:11:36,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {11375#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {11375#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {11375#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {11375#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {11375#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {11375#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {11375#true} assume 4368 == #t~mem54;havoc #t~mem54; {11375#true} is VALID [2022-04-08 15:11:36,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {11375#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; {11375#true} is VALID [2022-04-08 15:11:36,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {11375#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11375#true} is VALID [2022-04-08 15:11:36,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {11375#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); {11375#true} is VALID [2022-04-08 15:11:36,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {11375#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; {11375#true} is VALID [2022-04-08 15:11:36,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {11375#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); {11375#true} is VALID [2022-04-08 15:11:36,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {11375#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11375#true} is VALID [2022-04-08 15:11:36,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {11375#true} ~skip~0 := 0; {11375#true} is VALID [2022-04-08 15:11:36,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {11375#true} assume !false; {11375#true} is VALID [2022-04-08 15:11:36,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {11375#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {11375#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {11375#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {11375#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {11375#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {11375#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,609 INFO L290 TraceCheckUtils]: 47: Hoare triple {11375#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,609 INFO L290 TraceCheckUtils]: 48: Hoare triple {11375#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:36,610 INFO L290 TraceCheckUtils]: 49: Hoare triple {11375#true} assume 4384 == #t~mem56;havoc #t~mem56; {11375#true} is VALID [2022-04-08 15:11:36,610 INFO L290 TraceCheckUtils]: 50: Hoare triple {11375#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11375#true} is VALID [2022-04-08 15:11:36,610 INFO L290 TraceCheckUtils]: 51: Hoare triple {11375#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,611 INFO L290 TraceCheckUtils]: 52: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,612 INFO L290 TraceCheckUtils]: 54: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,612 INFO L290 TraceCheckUtils]: 55: Hoare triple {11380#(= 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); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,613 INFO L290 TraceCheckUtils]: 57: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,613 INFO L290 TraceCheckUtils]: 58: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,613 INFO L290 TraceCheckUtils]: 59: Hoare triple {11380#(= 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); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,614 INFO L290 TraceCheckUtils]: 60: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,614 INFO L290 TraceCheckUtils]: 62: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,615 INFO L290 TraceCheckUtils]: 63: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,615 INFO L290 TraceCheckUtils]: 64: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,615 INFO L290 TraceCheckUtils]: 65: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,615 INFO L290 TraceCheckUtils]: 66: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,616 INFO L290 TraceCheckUtils]: 67: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,616 INFO L290 TraceCheckUtils]: 69: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,617 INFO L290 TraceCheckUtils]: 70: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,617 INFO L290 TraceCheckUtils]: 71: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem60;havoc #t~mem60; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,617 INFO L290 TraceCheckUtils]: 72: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:36,618 INFO L290 TraceCheckUtils]: 73: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {11376#false} is VALID [2022-04-08 15:11:36,618 INFO L290 TraceCheckUtils]: 74: Hoare triple {11376#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); {11376#false} is VALID [2022-04-08 15:11:36,618 INFO L290 TraceCheckUtils]: 75: Hoare triple {11376#false} assume !(0 == ~tmp___6~0); {11376#false} is VALID [2022-04-08 15:11:36,618 INFO L290 TraceCheckUtils]: 76: Hoare triple {11376#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); {11376#false} is VALID [2022-04-08 15:11:36,618 INFO L290 TraceCheckUtils]: 77: Hoare triple {11376#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11376#false} is VALID [2022-04-08 15:11:36,618 INFO L290 TraceCheckUtils]: 78: Hoare triple {11376#false} ~skip~0 := 0; {11376#false} is VALID [2022-04-08 15:11:36,618 INFO L290 TraceCheckUtils]: 79: Hoare triple {11376#false} assume !false; {11376#false} is VALID [2022-04-08 15:11:36,618 INFO L290 TraceCheckUtils]: 80: Hoare triple {11376#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); {11376#false} is VALID [2022-04-08 15:11:36,618 INFO L290 TraceCheckUtils]: 81: Hoare triple {11376#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,618 INFO L290 TraceCheckUtils]: 82: Hoare triple {11376#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,619 INFO L290 TraceCheckUtils]: 83: Hoare triple {11376#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,619 INFO L290 TraceCheckUtils]: 84: Hoare triple {11376#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,620 INFO L290 TraceCheckUtils]: 85: Hoare triple {11376#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,621 INFO L290 TraceCheckUtils]: 86: Hoare triple {11376#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,622 INFO L290 TraceCheckUtils]: 87: Hoare triple {11376#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,622 INFO L290 TraceCheckUtils]: 88: Hoare triple {11376#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,622 INFO L290 TraceCheckUtils]: 89: Hoare triple {11376#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,622 INFO L290 TraceCheckUtils]: 90: Hoare triple {11376#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,622 INFO L290 TraceCheckUtils]: 91: Hoare triple {11376#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,623 INFO L290 TraceCheckUtils]: 92: Hoare triple {11376#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,623 INFO L290 TraceCheckUtils]: 93: Hoare triple {11376#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:36,623 INFO L290 TraceCheckUtils]: 94: Hoare triple {11376#false} assume 4432 == #t~mem62;havoc #t~mem62; {11376#false} is VALID [2022-04-08 15:11:36,623 INFO L290 TraceCheckUtils]: 95: Hoare triple {11376#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11376#false} is VALID [2022-04-08 15:11:36,623 INFO L290 TraceCheckUtils]: 96: Hoare triple {11376#false} assume 5 == ~blastFlag~0; {11376#false} is VALID [2022-04-08 15:11:36,623 INFO L290 TraceCheckUtils]: 97: Hoare triple {11376#false} assume !false; {11376#false} is VALID [2022-04-08 15:11:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-08 15:11:36,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:36,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032494315] [2022-04-08 15:11:36,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032494315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:36,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:36,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:36,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:36,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1353216210] [2022-04-08 15:11:36,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1353216210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:36,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:36,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:36,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246676269] [2022-04-08 15:11:36,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:36,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-08 15:11:36,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:36,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:36,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:36,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:11:36,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:36,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:11:36,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:36,691 INFO L87 Difference]: Start difference. First operand 468 states and 730 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:38,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:39,595 INFO L93 Difference]: Finished difference Result 922 states and 1449 transitions. [2022-04-08 15:11:39,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:11:39,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-08 15:11:39,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-08 15:11:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-08 15:11:39,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-08 15:11:39,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:39,934 INFO L225 Difference]: With dead ends: 922 [2022-04-08 15:11:39,934 INFO L226 Difference]: Without dead ends: 619 [2022-04-08 15:11:39,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-08 15:11:39,936 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:39,936 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:11:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-08 15:11:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2022-04-08 15:11:39,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:39,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:39,953 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:39,954 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:39,968 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-08 15:11:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-08 15:11:39,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:39,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:39,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-08 15:11:39,971 INFO L87 Difference]: Start difference. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-08 15:11:39,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:39,985 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-08 15:11:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-08 15:11:39,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:39,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:39,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:39,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 966 transitions. [2022-04-08 15:11:40,042 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 966 transitions. Word has length 98 [2022-04-08 15:11:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:40,042 INFO L478 AbstractCegarLoop]: Abstraction has 619 states and 966 transitions. [2022-04-08 15:11:40,043 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:40,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 619 states and 966 transitions. [2022-04-08 15:11:40,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 966 edges. 966 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-08 15:11:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 15:11:40,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:40,722 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:11:40,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 15:11:40,722 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:40,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:40,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 1 times [2022-04-08 15:11:40,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:40,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1220257651] [2022-04-08 15:11:40,723 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 2 times [2022-04-08 15:11:40,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:40,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888370980] [2022-04-08 15:11:40,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:40,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:40,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:40,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {15710#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {15704#true} is VALID [2022-04-08 15:11:40,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {15704#true} assume true; {15704#true} is VALID [2022-04-08 15:11:40,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15704#true} {15704#true} #593#return; {15704#true} is VALID [2022-04-08 15:11:40,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {15704#true} call ULTIMATE.init(); {15710#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:11:40,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {15710#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {15704#true} is VALID [2022-04-08 15:11:40,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {15704#true} assume true; {15704#true} is VALID [2022-04-08 15:11:40,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15704#true} {15704#true} #593#return; {15704#true} is VALID [2022-04-08 15:11:40,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {15704#true} call #t~ret158 := main(); {15704#true} is VALID [2022-04-08 15:11:40,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {15704#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; {15704#true} is VALID [2022-04-08 15:11:40,868 INFO L272 TraceCheckUtils]: 6: Hoare triple {15704#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15704#true} is VALID [2022-04-08 15:11:40,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {15704#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); {15704#true} is VALID [2022-04-08 15:11:40,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {15704#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; {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {15704#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; {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {15704#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {15704#true} assume !false; {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {15704#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {15704#true} assume 12292 == #t~mem49;havoc #t~mem49; {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {15704#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; {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {15704#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {15704#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {15704#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {15704#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); {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {15704#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {15704#true} assume !(0 == ~tmp___4~0); {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {15704#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); {15704#true} is VALID [2022-04-08 15:11:40,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {15704#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); {15704#true} is VALID [2022-04-08 15:11:40,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {15704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15704#true} is VALID [2022-04-08 15:11:40,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {15704#true} ~skip~0 := 0; {15704#true} is VALID [2022-04-08 15:11:40,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {15704#true} assume !false; {15704#true} is VALID [2022-04-08 15:11:40,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {15704#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {15704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {15704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {15704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {15704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {15704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {15704#true} assume 4368 == #t~mem54;havoc #t~mem54; {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {15704#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; {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {15704#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {15704#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); {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {15704#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; {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {15704#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); {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {15704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {15704#true} ~skip~0 := 0; {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {15704#true} assume !false; {15704#true} is VALID [2022-04-08 15:11:40,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {15704#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {15704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {15704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {15704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {15704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {15704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {15704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {15704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {15704#true} assume 4384 == #t~mem56;havoc #t~mem56; {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {15704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {15704#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {15704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {15704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {15704#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {15704#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); {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {15704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {15704#true} ~skip~0 := 0; {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 58: Hoare triple {15704#true} assume !false; {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 59: Hoare triple {15704#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {15704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {15704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {15704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {15704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 64: Hoare triple {15704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 65: Hoare triple {15704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 66: Hoare triple {15704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 67: Hoare triple {15704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,873 INFO L290 TraceCheckUtils]: 68: Hoare triple {15704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 69: Hoare triple {15704#true} assume 4400 == #t~mem58;havoc #t~mem58; {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 70: Hoare triple {15704#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); {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 71: Hoare triple {15704#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; {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 72: Hoare triple {15704#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 73: Hoare triple {15704#true} assume !(~ret~0 <= 0); {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 74: Hoare triple {15704#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 75: Hoare triple {15704#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); {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 76: Hoare triple {15704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 77: Hoare triple {15704#true} ~skip~0 := 0; {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 78: Hoare triple {15704#true} assume !false; {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 79: Hoare triple {15704#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,874 INFO L290 TraceCheckUtils]: 80: Hoare triple {15704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,875 INFO L290 TraceCheckUtils]: 81: Hoare triple {15704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,875 INFO L290 TraceCheckUtils]: 82: Hoare triple {15704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,875 INFO L290 TraceCheckUtils]: 83: Hoare triple {15704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,875 INFO L290 TraceCheckUtils]: 84: Hoare triple {15704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,875 INFO L290 TraceCheckUtils]: 85: Hoare triple {15704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,875 INFO L290 TraceCheckUtils]: 86: Hoare triple {15704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,875 INFO L290 TraceCheckUtils]: 87: Hoare triple {15704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,876 INFO L290 TraceCheckUtils]: 88: Hoare triple {15704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,876 INFO L290 TraceCheckUtils]: 89: Hoare triple {15704#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,876 INFO L290 TraceCheckUtils]: 90: Hoare triple {15704#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {15704#true} is VALID [2022-04-08 15:11:40,876 INFO L290 TraceCheckUtils]: 91: Hoare triple {15704#true} assume 4416 == #t~mem60;havoc #t~mem60; {15704#true} is VALID [2022-04-08 15:11:40,876 INFO L290 TraceCheckUtils]: 92: Hoare triple {15704#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {15704#true} is VALID [2022-04-08 15:11:40,876 INFO L290 TraceCheckUtils]: 93: Hoare triple {15704#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,877 INFO L290 TraceCheckUtils]: 94: Hoare triple {15709#(= 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); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,877 INFO L290 TraceCheckUtils]: 95: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,877 INFO L290 TraceCheckUtils]: 96: Hoare triple {15709#(= 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); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,878 INFO L290 TraceCheckUtils]: 97: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,878 INFO L290 TraceCheckUtils]: 98: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,878 INFO L290 TraceCheckUtils]: 99: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !false; {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,878 INFO L290 TraceCheckUtils]: 100: Hoare triple {15709#(= 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); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,879 INFO L290 TraceCheckUtils]: 101: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,879 INFO L290 TraceCheckUtils]: 102: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,879 INFO L290 TraceCheckUtils]: 103: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,879 INFO L290 TraceCheckUtils]: 104: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,880 INFO L290 TraceCheckUtils]: 105: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,880 INFO L290 TraceCheckUtils]: 106: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,880 INFO L290 TraceCheckUtils]: 107: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,880 INFO L290 TraceCheckUtils]: 108: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,881 INFO L290 TraceCheckUtils]: 109: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,881 INFO L290 TraceCheckUtils]: 110: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,881 INFO L290 TraceCheckUtils]: 111: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,881 INFO L290 TraceCheckUtils]: 112: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,882 INFO L290 TraceCheckUtils]: 113: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,882 INFO L290 TraceCheckUtils]: 114: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,882 INFO L290 TraceCheckUtils]: 115: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15709#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 15:11:40,883 INFO L290 TraceCheckUtils]: 116: Hoare triple {15709#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {15705#false} is VALID [2022-04-08 15:11:40,883 INFO L290 TraceCheckUtils]: 117: Hoare triple {15705#false} assume !false; {15705#false} is VALID [2022-04-08 15:11:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-08 15:11:40,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:40,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888370980] [2022-04-08 15:11:40,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888370980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:40,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:40,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:40,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:40,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1220257651] [2022-04-08 15:11:40,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1220257651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:40,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:40,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:40,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35231613] [2022-04-08 15:11:40,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:40,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-08 15:11:40,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:40,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:40,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:40,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:11:40,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:40,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:11:40,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:40,945 INFO L87 Difference]: Start difference. First operand 619 states and 966 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:42,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:43,914 INFO L93 Difference]: Finished difference Result 1223 states and 1919 transitions. [2022-04-08 15:11:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:11:43,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-08 15:11:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 15:11:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 15:11:43,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-08 15:11:44,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:44,256 INFO L225 Difference]: With dead ends: 1223 [2022-04-08 15:11:44,257 INFO L226 Difference]: Without dead ends: 769 [2022-04-08 15:11:44,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:44,258 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 125 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:44,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 476 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:11:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2022-04-08 15:11:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2022-04-08 15:11:44,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:44,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 769 states. Second operand has 769 states, 764 states have (on average 1.5654450261780104) internal successors, (1196), 764 states have internal predecessors, (1196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:44,277 INFO L74 IsIncluded]: Start isIncluded. First operand 769 states. Second operand has 769 states, 764 states have (on average 1.5654450261780104) internal successors, (1196), 764 states have internal predecessors, (1196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:44,278 INFO L87 Difference]: Start difference. First operand 769 states. Second operand has 769 states, 764 states have (on average 1.5654450261780104) internal successors, (1196), 764 states have internal predecessors, (1196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:44,300 INFO L93 Difference]: Finished difference Result 769 states and 1200 transitions. [2022-04-08 15:11:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1200 transitions. [2022-04-08 15:11:44,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:44,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:44,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 769 states, 764 states have (on average 1.5654450261780104) internal successors, (1196), 764 states have internal predecessors, (1196), 3 states have call successors, (3), 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 769 states. [2022-04-08 15:11:44,303 INFO L87 Difference]: Start difference. First operand has 769 states, 764 states have (on average 1.5654450261780104) internal successors, (1196), 764 states have internal predecessors, (1196), 3 states have call successors, (3), 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 769 states. [2022-04-08 15:11:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:44,326 INFO L93 Difference]: Finished difference Result 769 states and 1200 transitions. [2022-04-08 15:11:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1200 transitions. [2022-04-08 15:11:44,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:44,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:44,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:44,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 764 states have (on average 1.5654450261780104) internal successors, (1196), 764 states have internal predecessors, (1196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1200 transitions. [2022-04-08 15:11:44,360 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1200 transitions. Word has length 118 [2022-04-08 15:11:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:44,360 INFO L478 AbstractCegarLoop]: Abstraction has 769 states and 1200 transitions. [2022-04-08 15:11:44,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:44,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 769 states and 1200 transitions. [2022-04-08 15:11:45,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1200 edges. 1200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1200 transitions. [2022-04-08 15:11:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 15:11:45,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:45,206 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:11:45,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 15:11:45,207 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:45,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1996377455, now seen corresponding path program 1 times [2022-04-08 15:11:45,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:45,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1991993656] [2022-04-08 15:11:45,208 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:45,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1996377455, now seen corresponding path program 2 times [2022-04-08 15:11:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:45,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228850017] [2022-04-08 15:11:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:45,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:45,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {21241#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {21235#true} is VALID [2022-04-08 15:11:45,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {21235#true} assume true; {21235#true} is VALID [2022-04-08 15:11:45,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21235#true} {21235#true} #593#return; {21235#true} is VALID [2022-04-08 15:11:45,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {21235#true} call ULTIMATE.init(); {21241#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:11:45,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {21241#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {21235#true} is VALID [2022-04-08 15:11:45,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {21235#true} assume true; {21235#true} is VALID [2022-04-08 15:11:45,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21235#true} {21235#true} #593#return; {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {21235#true} call #t~ret158 := main(); {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {21235#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; {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L272 TraceCheckUtils]: 6: Hoare triple {21235#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {21235#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); {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {21235#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; {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {21235#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; {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {21235#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {21235#true} assume !false; {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {21235#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {21235#true} assume 12292 == #t~mem49;havoc #t~mem49; {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {21235#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; {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {21235#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {21235#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21235#true} is VALID [2022-04-08 15:11:45,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {21235#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {21235#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); {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {21235#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {21235#true} assume !(0 == ~tmp___4~0); {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {21235#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); {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {21235#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); {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {21235#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {21235#true} ~skip~0 := 0; {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {21235#true} assume !false; {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {21235#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {21235#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {21235#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {21235#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {21235#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {21235#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {21235#true} assume 4368 == #t~mem54;havoc #t~mem54; {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {21235#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; {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {21235#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {21235#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); {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {21235#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; {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {21235#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); {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {21235#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {21235#true} ~skip~0 := 0; {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {21235#true} assume !false; {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {21235#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {21235#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {21235#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {21235#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {21235#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {21235#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {21235#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {21235#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {21235#true} assume 4384 == #t~mem56;havoc #t~mem56; {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {21235#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 51: Hoare triple {21235#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {21235#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {21235#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 54: Hoare triple {21235#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 55: Hoare triple {21235#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); {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 56: Hoare triple {21235#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {21235#true} ~skip~0 := 0; {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {21235#true} assume !false; {21235#true} is VALID [2022-04-08 15:11:45,403 INFO L290 TraceCheckUtils]: 59: Hoare triple {21235#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 60: Hoare triple {21235#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 61: Hoare triple {21235#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 62: Hoare triple {21235#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 63: Hoare triple {21235#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 64: Hoare triple {21235#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 65: Hoare triple {21235#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 66: Hoare triple {21235#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 67: Hoare triple {21235#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 68: Hoare triple {21235#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 69: Hoare triple {21235#true} assume 4400 == #t~mem58;havoc #t~mem58; {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 70: Hoare triple {21235#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); {21235#true} is VALID [2022-04-08 15:11:45,404 INFO L290 TraceCheckUtils]: 71: Hoare triple {21235#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; {21235#true} is VALID [2022-04-08 15:11:45,405 INFO L290 TraceCheckUtils]: 72: Hoare triple {21235#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,405 INFO L290 TraceCheckUtils]: 73: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,405 INFO L290 TraceCheckUtils]: 74: Hoare triple {21240#(= 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); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,405 INFO L290 TraceCheckUtils]: 75: Hoare triple {21240#(= 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); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,406 INFO L290 TraceCheckUtils]: 76: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,406 INFO L290 TraceCheckUtils]: 77: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,406 INFO L290 TraceCheckUtils]: 78: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,406 INFO L290 TraceCheckUtils]: 79: Hoare triple {21240#(= 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); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,407 INFO L290 TraceCheckUtils]: 80: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,407 INFO L290 TraceCheckUtils]: 81: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,407 INFO L290 TraceCheckUtils]: 82: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,407 INFO L290 TraceCheckUtils]: 83: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,408 INFO L290 TraceCheckUtils]: 84: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,408 INFO L290 TraceCheckUtils]: 85: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,408 INFO L290 TraceCheckUtils]: 86: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,408 INFO L290 TraceCheckUtils]: 87: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,409 INFO L290 TraceCheckUtils]: 88: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,409 INFO L290 TraceCheckUtils]: 89: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,409 INFO L290 TraceCheckUtils]: 90: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,410 INFO L290 TraceCheckUtils]: 91: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem60;havoc #t~mem60; {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,410 INFO L290 TraceCheckUtils]: 92: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {21240#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:45,410 INFO L290 TraceCheckUtils]: 93: Hoare triple {21240#(= 3 ssl3_connect_~blastFlag~0)} assume !(3 == ~blastFlag~0); {21236#false} is VALID [2022-04-08 15:11:45,410 INFO L290 TraceCheckUtils]: 94: Hoare triple {21236#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); {21236#false} is VALID [2022-04-08 15:11:45,410 INFO L290 TraceCheckUtils]: 95: Hoare triple {21236#false} assume !(0 == ~tmp___6~0); {21236#false} is VALID [2022-04-08 15:11:45,410 INFO L290 TraceCheckUtils]: 96: Hoare triple {21236#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); {21236#false} is VALID [2022-04-08 15:11:45,410 INFO L290 TraceCheckUtils]: 97: Hoare triple {21236#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21236#false} is VALID [2022-04-08 15:11:45,410 INFO L290 TraceCheckUtils]: 98: Hoare triple {21236#false} ~skip~0 := 0; {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 99: Hoare triple {21236#false} assume !false; {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 100: Hoare triple {21236#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); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 101: Hoare triple {21236#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 102: Hoare triple {21236#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 103: Hoare triple {21236#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 104: Hoare triple {21236#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 105: Hoare triple {21236#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 106: Hoare triple {21236#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 107: Hoare triple {21236#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 108: Hoare triple {21236#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 109: Hoare triple {21236#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 110: Hoare triple {21236#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 111: Hoare triple {21236#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,411 INFO L290 TraceCheckUtils]: 112: Hoare triple {21236#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,412 INFO L290 TraceCheckUtils]: 113: Hoare triple {21236#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {21236#false} is VALID [2022-04-08 15:11:45,412 INFO L290 TraceCheckUtils]: 114: Hoare triple {21236#false} assume 4432 == #t~mem62;havoc #t~mem62; {21236#false} is VALID [2022-04-08 15:11:45,412 INFO L290 TraceCheckUtils]: 115: Hoare triple {21236#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21236#false} is VALID [2022-04-08 15:11:45,412 INFO L290 TraceCheckUtils]: 116: Hoare triple {21236#false} assume 5 == ~blastFlag~0; {21236#false} is VALID [2022-04-08 15:11:45,412 INFO L290 TraceCheckUtils]: 117: Hoare triple {21236#false} assume !false; {21236#false} is VALID [2022-04-08 15:11:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 15:11:45,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:45,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228850017] [2022-04-08 15:11:45,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228850017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:45,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:45,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:45,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:45,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1991993656] [2022-04-08 15:11:45,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1991993656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:45,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:45,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:45,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927034517] [2022-04-08 15:11:45,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-08 15:11:45,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:45,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:45,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:45,481 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:11:45,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:45,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:11:45,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:45,483 INFO L87 Difference]: Start difference. First operand 769 states and 1200 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:47,498 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:48,515 INFO L93 Difference]: Finished difference Result 1499 states and 2345 transitions. [2022-04-08 15:11:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:11:48,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-08 15:11:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-08 15:11:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-08 15:11:48,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-08 15:11:48,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:48,886 INFO L225 Difference]: With dead ends: 1499 [2022-04-08 15:11:48,886 INFO L226 Difference]: Without dead ends: 895 [2022-04-08 15:11:48,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:48,888 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 128 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:48,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:11:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-04-08 15:11:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2022-04-08 15:11:48,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:48,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 895 states. Second operand has 895 states, 890 states have (on average 1.5595505617977528) internal successors, (1388), 890 states have internal predecessors, (1388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:48,921 INFO L74 IsIncluded]: Start isIncluded. First operand 895 states. Second operand has 895 states, 890 states have (on average 1.5595505617977528) internal successors, (1388), 890 states have internal predecessors, (1388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:48,923 INFO L87 Difference]: Start difference. First operand 895 states. Second operand has 895 states, 890 states have (on average 1.5595505617977528) internal successors, (1388), 890 states have internal predecessors, (1388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:48,952 INFO L93 Difference]: Finished difference Result 895 states and 1392 transitions. [2022-04-08 15:11:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1392 transitions. [2022-04-08 15:11:48,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:48,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:48,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 895 states, 890 states have (on average 1.5595505617977528) internal successors, (1388), 890 states have internal predecessors, (1388), 3 states have call successors, (3), 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 895 states. [2022-04-08 15:11:48,956 INFO L87 Difference]: Start difference. First operand has 895 states, 890 states have (on average 1.5595505617977528) internal successors, (1388), 890 states have internal predecessors, (1388), 3 states have call successors, (3), 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 895 states. [2022-04-08 15:11:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:48,986 INFO L93 Difference]: Finished difference Result 895 states and 1392 transitions. [2022-04-08 15:11:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1392 transitions. [2022-04-08 15:11:48,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:48,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:48,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:48,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 890 states have (on average 1.5595505617977528) internal successors, (1388), 890 states have internal predecessors, (1388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1392 transitions. [2022-04-08 15:11:49,029 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1392 transitions. Word has length 118 [2022-04-08 15:11:49,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:49,029 INFO L478 AbstractCegarLoop]: Abstraction has 895 states and 1392 transitions. [2022-04-08 15:11:49,029 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:49,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 895 states and 1392 transitions. [2022-04-08 15:11:50,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1392 edges. 1392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1392 transitions. [2022-04-08 15:11:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-08 15:11:50,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:50,080 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:11:50,080 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 15:11:50,080 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:50,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1079108204, now seen corresponding path program 1 times [2022-04-08 15:11:50,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:50,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266323774] [2022-04-08 15:12:03,960 WARN L232 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:12:12,962 WARN L232 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:12:14,578 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:12:14,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1079108204, now seen corresponding path program 2 times [2022-04-08 15:12:14,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:12:14,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778239057] [2022-04-08 15:12:14,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:12:14,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:12:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:12:14,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:12:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:12:14,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {27829#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {27822#true} is VALID [2022-04-08 15:12:14,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {27822#true} assume true; {27822#true} is VALID [2022-04-08 15:12:14,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27822#true} {27822#true} #593#return; {27822#true} is VALID [2022-04-08 15:12:14,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {27822#true} call ULTIMATE.init(); {27829#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:12:14,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {27829#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {27822#true} is VALID [2022-04-08 15:12:14,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {27822#true} assume true; {27822#true} is VALID [2022-04-08 15:12:14,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27822#true} {27822#true} #593#return; {27822#true} is VALID [2022-04-08 15:12:14,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {27822#true} call #t~ret158 := main(); {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {27822#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; {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {27822#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {27822#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); {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {27822#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; {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {27822#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; {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {27822#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {27822#true} assume !false; {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {27822#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {27822#true} assume 12292 == #t~mem49;havoc #t~mem49; {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {27822#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; {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {27822#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {27822#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {27822#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {27822#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); {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {27822#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {27822#true} assume !(0 == ~tmp___4~0); {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {27822#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); {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {27822#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); {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {27822#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {27822#true} ~skip~0 := 0; {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {27822#true} assume !false; {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {27822#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {27822#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {27822#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {27822#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {27822#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {27822#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {27822#true} assume 4368 == #t~mem54;havoc #t~mem54; {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {27822#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; {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {27822#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {27822#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); {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {27822#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; {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {27822#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); {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {27822#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {27822#true} ~skip~0 := 0; {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {27822#true} assume !false; {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {27822#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {27822#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {27822#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {27822#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {27822#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {27822#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {27822#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {27822#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {27822#true} assume 4384 == #t~mem56;havoc #t~mem56; {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {27822#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {27822#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {27822#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 53: Hoare triple {27822#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {27822#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 55: Hoare triple {27822#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); {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 56: Hoare triple {27822#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 57: Hoare triple {27822#true} ~skip~0 := 0; {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 58: Hoare triple {27822#true} assume !false; {27822#true} is VALID [2022-04-08 15:12:14,739 INFO L290 TraceCheckUtils]: 59: Hoare triple {27822#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 60: Hoare triple {27822#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 61: Hoare triple {27822#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 62: Hoare triple {27822#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 63: Hoare triple {27822#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 64: Hoare triple {27822#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 65: Hoare triple {27822#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 66: Hoare triple {27822#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 67: Hoare triple {27822#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 68: Hoare triple {27822#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 69: Hoare triple {27822#true} assume 4400 == #t~mem58;havoc #t~mem58; {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 70: Hoare triple {27822#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); {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 71: Hoare triple {27822#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; {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 72: Hoare triple {27822#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {27822#true} is VALID [2022-04-08 15:12:14,740 INFO L290 TraceCheckUtils]: 73: Hoare triple {27822#true} assume !(~ret~0 <= 0); {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {27822#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 75: Hoare triple {27822#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); {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 76: Hoare triple {27822#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {27822#true} ~skip~0 := 0; {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {27822#true} assume !false; {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 79: Hoare triple {27822#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 80: Hoare triple {27822#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 81: Hoare triple {27822#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 82: Hoare triple {27822#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 83: Hoare triple {27822#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 84: Hoare triple {27822#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 85: Hoare triple {27822#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 86: Hoare triple {27822#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,741 INFO L290 TraceCheckUtils]: 87: Hoare triple {27822#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,742 INFO L290 TraceCheckUtils]: 88: Hoare triple {27822#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,742 INFO L290 TraceCheckUtils]: 89: Hoare triple {27822#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,742 INFO L290 TraceCheckUtils]: 90: Hoare triple {27822#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27822#true} is VALID [2022-04-08 15:12:14,742 INFO L290 TraceCheckUtils]: 91: Hoare triple {27822#true} assume 4416 == #t~mem60;havoc #t~mem60; {27822#true} is VALID [2022-04-08 15:12:14,742 INFO L290 TraceCheckUtils]: 92: Hoare triple {27822#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {27822#true} is VALID [2022-04-08 15:12:14,742 INFO L290 TraceCheckUtils]: 93: Hoare triple {27822#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {27822#true} is VALID [2022-04-08 15:12:14,743 INFO L290 TraceCheckUtils]: 94: Hoare triple {27822#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); {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:12:14,743 INFO L290 TraceCheckUtils]: 95: Hoare triple {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(0 == ~tmp___6~0); {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:12:14,743 INFO L290 TraceCheckUtils]: 96: Hoare triple {27827#(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); {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:12:14,744 INFO L290 TraceCheckUtils]: 97: Hoare triple {27827#(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; {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:12:14,744 INFO L290 TraceCheckUtils]: 98: Hoare triple {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} ~skip~0 := 0; {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:12:14,744 INFO L290 TraceCheckUtils]: 99: Hoare triple {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !false; {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:12:14,744 INFO L290 TraceCheckUtils]: 100: Hoare triple {27827#(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); {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:12:14,745 INFO L290 TraceCheckUtils]: 101: Hoare triple {27827#(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); {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:12:14,745 INFO L290 TraceCheckUtils]: 102: Hoare triple {27827#(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); {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:12:14,745 INFO L290 TraceCheckUtils]: 103: Hoare triple {27827#(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); {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:12:14,746 INFO L290 TraceCheckUtils]: 104: Hoare triple {27827#(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); {27827#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-08 15:12:14,746 INFO L290 TraceCheckUtils]: 105: Hoare triple {27827#(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); {27828#(not (= |ssl3_connect_#t~mem54| 4368))} is VALID [2022-04-08 15:12:14,746 INFO L290 TraceCheckUtils]: 106: Hoare triple {27828#(not (= |ssl3_connect_#t~mem54| 4368))} assume 4368 == #t~mem54;havoc #t~mem54; {27823#false} is VALID [2022-04-08 15:12:14,746 INFO L290 TraceCheckUtils]: 107: Hoare triple {27823#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; {27823#false} is VALID [2022-04-08 15:12:14,746 INFO L290 TraceCheckUtils]: 108: Hoare triple {27823#false} assume !(0 == ~blastFlag~0); {27823#false} is VALID [2022-04-08 15:12:14,746 INFO L290 TraceCheckUtils]: 109: Hoare triple {27823#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {27823#false} is VALID [2022-04-08 15:12:14,746 INFO L290 TraceCheckUtils]: 110: Hoare triple {27823#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); {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 111: Hoare triple {27823#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; {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 112: Hoare triple {27823#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); {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 113: Hoare triple {27823#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 114: Hoare triple {27823#false} ~skip~0 := 0; {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 115: Hoare triple {27823#false} assume !false; {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 116: Hoare triple {27823#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); {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 117: Hoare triple {27823#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 118: Hoare triple {27823#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 119: Hoare triple {27823#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 120: Hoare triple {27823#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 121: Hoare triple {27823#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 122: Hoare triple {27823#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,747 INFO L290 TraceCheckUtils]: 123: Hoare triple {27823#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 124: Hoare triple {27823#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 125: Hoare triple {27823#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 126: Hoare triple {27823#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 127: Hoare triple {27823#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 128: Hoare triple {27823#false} assume 4416 == #t~mem60;havoc #t~mem60; {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 129: Hoare triple {27823#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 130: Hoare triple {27823#false} assume !(3 == ~blastFlag~0); {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 131: Hoare triple {27823#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); {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 132: Hoare triple {27823#false} assume !(0 == ~tmp___6~0); {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 133: Hoare triple {27823#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); {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 134: Hoare triple {27823#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 135: Hoare triple {27823#false} ~skip~0 := 0; {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 136: Hoare triple {27823#false} assume !false; {27823#false} is VALID [2022-04-08 15:12:14,748 INFO L290 TraceCheckUtils]: 137: Hoare triple {27823#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); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 138: Hoare triple {27823#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 139: Hoare triple {27823#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 140: Hoare triple {27823#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 141: Hoare triple {27823#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 142: Hoare triple {27823#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 143: Hoare triple {27823#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 144: Hoare triple {27823#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 145: Hoare triple {27823#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 146: Hoare triple {27823#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 147: Hoare triple {27823#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 148: Hoare triple {27823#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 149: Hoare triple {27823#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,749 INFO L290 TraceCheckUtils]: 150: Hoare triple {27823#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27823#false} is VALID [2022-04-08 15:12:14,750 INFO L290 TraceCheckUtils]: 151: Hoare triple {27823#false} assume 4432 == #t~mem62;havoc #t~mem62; {27823#false} is VALID [2022-04-08 15:12:14,750 INFO L290 TraceCheckUtils]: 152: Hoare triple {27823#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {27823#false} is VALID [2022-04-08 15:12:14,750 INFO L290 TraceCheckUtils]: 153: Hoare triple {27823#false} assume 5 == ~blastFlag~0; {27823#false} is VALID [2022-04-08 15:12:14,750 INFO L290 TraceCheckUtils]: 154: Hoare triple {27823#false} assume !false; {27823#false} is VALID [2022-04-08 15:12:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-08 15:12:14,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:12:14,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778239057] [2022-04-08 15:12:14,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778239057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:12:14,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:12:14,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:12:14,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:12:14,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266323774] [2022-04-08 15:12:14,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266323774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:12:14,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:12:14,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:12:14,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278939784] [2022-04-08 15:12:14,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:12:14,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-08 15:12:14,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:12:14,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:14,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:12:14,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:12:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:12:14,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:12:14,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:12:14,825 INFO L87 Difference]: Start difference. First operand 895 states and 1392 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:16,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:18,313 INFO L93 Difference]: Finished difference Result 2165 states and 3327 transitions. [2022-04-08 15:12:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:12:18,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-08 15:12:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:12:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 15:12:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 15:12:18,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-08 15:12:18,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:12:18,701 INFO L225 Difference]: With dead ends: 2165 [2022-04-08 15:12:18,701 INFO L226 Difference]: Without dead ends: 1433 [2022-04-08 15:12:18,703 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:12:18,709 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 114 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:12:18,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 502 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 500 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:12:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-04-08 15:12:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 991. [2022-04-08 15:12:18,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:12:18,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1433 states. Second operand has 991 states, 986 states have (on average 1.5608519269776877) internal successors, (1539), 986 states have internal predecessors, (1539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:18,770 INFO L74 IsIncluded]: Start isIncluded. First operand 1433 states. Second operand has 991 states, 986 states have (on average 1.5608519269776877) internal successors, (1539), 986 states have internal predecessors, (1539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:18,771 INFO L87 Difference]: Start difference. First operand 1433 states. Second operand has 991 states, 986 states have (on average 1.5608519269776877) internal successors, (1539), 986 states have internal predecessors, (1539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:18,860 INFO L93 Difference]: Finished difference Result 1433 states and 2175 transitions. [2022-04-08 15:12:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2175 transitions. [2022-04-08 15:12:18,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:12:18,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:12:18,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 986 states have (on average 1.5608519269776877) internal successors, (1539), 986 states have internal predecessors, (1539), 3 states have call successors, (3), 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 1433 states. [2022-04-08 15:12:18,863 INFO L87 Difference]: Start difference. First operand has 991 states, 986 states have (on average 1.5608519269776877) internal successors, (1539), 986 states have internal predecessors, (1539), 3 states have call successors, (3), 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 1433 states. [2022-04-08 15:12:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:18,923 INFO L93 Difference]: Finished difference Result 1433 states and 2175 transitions. [2022-04-08 15:12:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2175 transitions. [2022-04-08 15:12:18,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:12:18,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:12:18,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:12:18,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:12:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 986 states have (on average 1.5608519269776877) internal successors, (1539), 986 states have internal predecessors, (1539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1543 transitions. [2022-04-08 15:12:18,972 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1543 transitions. Word has length 155 [2022-04-08 15:12:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:12:18,973 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1543 transitions. [2022-04-08 15:12:18,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:18,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1543 transitions. [2022-04-08 15:12:20,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1543 edges. 1543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:12:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1543 transitions. [2022-04-08 15:12:20,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-08 15:12:20,179 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:12:20,179 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:12:20,179 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 15:12:20,180 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:12:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:12:20,180 INFO L85 PathProgramCache]: Analyzing trace with hash -186140401, now seen corresponding path program 1 times [2022-04-08 15:12:20,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:12:20,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [409999488] [2022-04-08 15:12:33,034 WARN L232 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:12:41,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:12:41,138 INFO L85 PathProgramCache]: Analyzing trace with hash -186140401, now seen corresponding path program 2 times [2022-04-08 15:12:41,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:12:41,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977791372] [2022-04-08 15:12:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:12:41,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:12:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:12:41,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:12:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:12:41,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {37019#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {37012#true} is VALID [2022-04-08 15:12:41,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {37012#true} assume true; {37012#true} is VALID [2022-04-08 15:12:41,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37012#true} {37012#true} #593#return; {37012#true} is VALID [2022-04-08 15:12:41,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {37012#true} call ULTIMATE.init(); {37019#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:12:41,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {37019#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {37012#true} is VALID [2022-04-08 15:12:41,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {37012#true} assume true; {37012#true} is VALID [2022-04-08 15:12:41,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37012#true} {37012#true} #593#return; {37012#true} is VALID [2022-04-08 15:12:41,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {37012#true} call #t~ret158 := main(); {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {37012#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; {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {37012#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {37012#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); {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {37012#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; {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {37012#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; {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {37012#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {37012#true} assume !false; {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {37012#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {37012#true} assume 12292 == #t~mem49;havoc #t~mem49; {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {37012#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; {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {37012#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {37012#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {37012#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {37012#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); {37012#true} is VALID [2022-04-08 15:12:41,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {37012#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {37012#true} is VALID [2022-04-08 15:12:41,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {37012#true} assume !(0 == ~tmp___4~0); {37012#true} is VALID [2022-04-08 15:12:41,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {37012#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); {37012#true} is VALID [2022-04-08 15:12:41,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {37012#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); {37012#true} is VALID [2022-04-08 15:12:41,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {37012#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37012#true} is VALID [2022-04-08 15:12:41,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {37012#true} ~skip~0 := 0; {37012#true} is VALID [2022-04-08 15:12:41,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {37012#true} assume !false; {37012#true} is VALID [2022-04-08 15:12:41,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {37012#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {37012#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {37012#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {37012#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {37012#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {37012#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {37012#true} assume 4368 == #t~mem54;havoc #t~mem54; {37012#true} is VALID [2022-04-08 15:12:41,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {37012#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; {37012#true} is VALID [2022-04-08 15:12:41,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {37012#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37012#true} is VALID [2022-04-08 15:12:41,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {37012#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); {37012#true} is VALID [2022-04-08 15:12:41,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {37012#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; {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {37012#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); {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {37012#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {37012#true} ~skip~0 := 0; {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {37012#true} assume !false; {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {37012#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {37012#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {37012#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {37012#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {37012#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {37012#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {37012#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {37012#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {37012#true} assume 4384 == #t~mem56;havoc #t~mem56; {37012#true} is VALID [2022-04-08 15:12:41,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {37012#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {37012#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {37012#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {37012#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {37012#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {37012#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); {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {37012#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {37012#true} ~skip~0 := 0; {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {37012#true} assume !false; {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {37012#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {37012#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {37012#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {37012#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {37012#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {37012#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {37012#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 66: Hoare triple {37012#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 67: Hoare triple {37012#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 68: Hoare triple {37012#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 69: Hoare triple {37012#true} assume 4400 == #t~mem58;havoc #t~mem58; {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 70: Hoare triple {37012#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); {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 71: Hoare triple {37012#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; {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 72: Hoare triple {37012#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 73: Hoare triple {37012#true} assume !(~ret~0 <= 0); {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 74: Hoare triple {37012#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 75: Hoare triple {37012#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); {37012#true} is VALID [2022-04-08 15:12:41,322 INFO L290 TraceCheckUtils]: 76: Hoare triple {37012#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 77: Hoare triple {37012#true} ~skip~0 := 0; {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 78: Hoare triple {37012#true} assume !false; {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 79: Hoare triple {37012#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 80: Hoare triple {37012#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 81: Hoare triple {37012#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 82: Hoare triple {37012#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 83: Hoare triple {37012#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 84: Hoare triple {37012#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 85: Hoare triple {37012#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 86: Hoare triple {37012#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 87: Hoare triple {37012#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 88: Hoare triple {37012#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 89: Hoare triple {37012#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,323 INFO L290 TraceCheckUtils]: 90: Hoare triple {37012#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37012#true} is VALID [2022-04-08 15:12:41,324 INFO L290 TraceCheckUtils]: 91: Hoare triple {37012#true} assume 4416 == #t~mem60;havoc #t~mem60; {37012#true} is VALID [2022-04-08 15:12:41,324 INFO L290 TraceCheckUtils]: 92: Hoare triple {37012#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37012#true} is VALID [2022-04-08 15:12:41,324 INFO L290 TraceCheckUtils]: 93: Hoare triple {37012#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37012#true} is VALID [2022-04-08 15:12:41,325 INFO L290 TraceCheckUtils]: 94: Hoare triple {37012#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); {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,325 INFO L290 TraceCheckUtils]: 95: Hoare triple {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,325 INFO L290 TraceCheckUtils]: 96: Hoare triple {37017#(= 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); {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,326 INFO L290 TraceCheckUtils]: 97: Hoare triple {37017#(= 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; {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,326 INFO L290 TraceCheckUtils]: 98: Hoare triple {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,326 INFO L290 TraceCheckUtils]: 99: Hoare triple {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,327 INFO L290 TraceCheckUtils]: 100: Hoare triple {37017#(= 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); {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,327 INFO L290 TraceCheckUtils]: 101: Hoare triple {37017#(= 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); {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,327 INFO L290 TraceCheckUtils]: 102: Hoare triple {37017#(= 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); {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,327 INFO L290 TraceCheckUtils]: 103: Hoare triple {37017#(= 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); {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,328 INFO L290 TraceCheckUtils]: 104: Hoare triple {37017#(= 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); {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,328 INFO L290 TraceCheckUtils]: 105: Hoare triple {37017#(= 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); {37017#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:12:41,328 INFO L290 TraceCheckUtils]: 106: Hoare triple {37017#(= 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); {37018#(= |ssl3_connect_#t~mem55| 4432)} is VALID [2022-04-08 15:12:41,329 INFO L290 TraceCheckUtils]: 107: Hoare triple {37018#(= |ssl3_connect_#t~mem55| 4432)} assume 4369 == #t~mem55;havoc #t~mem55; {37013#false} is VALID [2022-04-08 15:12:41,329 INFO L290 TraceCheckUtils]: 108: Hoare triple {37013#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; {37013#false} is VALID [2022-04-08 15:12:41,329 INFO L290 TraceCheckUtils]: 109: Hoare triple {37013#false} assume !(0 == ~blastFlag~0); {37013#false} is VALID [2022-04-08 15:12:41,329 INFO L290 TraceCheckUtils]: 110: Hoare triple {37013#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {37013#false} is VALID [2022-04-08 15:12:41,329 INFO L290 TraceCheckUtils]: 111: Hoare triple {37013#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); {37013#false} is VALID [2022-04-08 15:12:41,329 INFO L290 TraceCheckUtils]: 112: Hoare triple {37013#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; {37013#false} is VALID [2022-04-08 15:12:41,329 INFO L290 TraceCheckUtils]: 113: Hoare triple {37013#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); {37013#false} is VALID [2022-04-08 15:12:41,329 INFO L290 TraceCheckUtils]: 114: Hoare triple {37013#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37013#false} is VALID [2022-04-08 15:12:41,329 INFO L290 TraceCheckUtils]: 115: Hoare triple {37013#false} ~skip~0 := 0; {37013#false} is VALID [2022-04-08 15:12:41,329 INFO L290 TraceCheckUtils]: 116: Hoare triple {37013#false} assume !false; {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 117: Hoare triple {37013#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); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 118: Hoare triple {37013#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 119: Hoare triple {37013#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 120: Hoare triple {37013#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 121: Hoare triple {37013#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 122: Hoare triple {37013#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 123: Hoare triple {37013#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 124: Hoare triple {37013#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 125: Hoare triple {37013#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 126: Hoare triple {37013#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 127: Hoare triple {37013#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 128: Hoare triple {37013#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 129: Hoare triple {37013#false} assume 4416 == #t~mem60;havoc #t~mem60; {37013#false} is VALID [2022-04-08 15:12:41,330 INFO L290 TraceCheckUtils]: 130: Hoare triple {37013#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 131: Hoare triple {37013#false} assume !(3 == ~blastFlag~0); {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 132: Hoare triple {37013#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); {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 133: Hoare triple {37013#false} assume !(0 == ~tmp___6~0); {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 134: Hoare triple {37013#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); {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 135: Hoare triple {37013#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 136: Hoare triple {37013#false} ~skip~0 := 0; {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 137: Hoare triple {37013#false} assume !false; {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 138: Hoare triple {37013#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); {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 139: Hoare triple {37013#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 140: Hoare triple {37013#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 141: Hoare triple {37013#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 142: Hoare triple {37013#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,331 INFO L290 TraceCheckUtils]: 143: Hoare triple {37013#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 144: Hoare triple {37013#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 145: Hoare triple {37013#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 146: Hoare triple {37013#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 147: Hoare triple {37013#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 148: Hoare triple {37013#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 149: Hoare triple {37013#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 150: Hoare triple {37013#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 151: Hoare triple {37013#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 152: Hoare triple {37013#false} assume 4432 == #t~mem62;havoc #t~mem62; {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 153: Hoare triple {37013#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 154: Hoare triple {37013#false} assume 5 == ~blastFlag~0; {37013#false} is VALID [2022-04-08 15:12:41,332 INFO L290 TraceCheckUtils]: 155: Hoare triple {37013#false} assume !false; {37013#false} is VALID [2022-04-08 15:12:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-08 15:12:41,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:12:41,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977791372] [2022-04-08 15:12:41,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977791372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:12:41,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:12:41,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:12:41,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:12:41,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [409999488] [2022-04-08 15:12:41,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [409999488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:12:41,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:12:41,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:12:41,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179584376] [2022-04-08 15:12:41,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:12:41,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-08 15:12:41,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:12:41,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:41,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:12:41,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:12:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:12:41,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:12:41,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:12:41,427 INFO L87 Difference]: Start difference. First operand 991 states and 1543 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:43,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:44,989 INFO L93 Difference]: Finished difference Result 2119 states and 3248 transitions. [2022-04-08 15:12:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:12:44,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-08 15:12:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:12:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-08 15:12:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-08 15:12:45,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 467 transitions. [2022-04-08 15:12:45,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:12:45,410 INFO L225 Difference]: With dead ends: 2119 [2022-04-08 15:12:45,410 INFO L226 Difference]: Without dead ends: 1307 [2022-04-08 15:12:45,411 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:12:45,415 INFO L913 BasicCegarLoop]: 234 mSDtfsCounter, 98 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:12:45,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 557 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 530 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:12:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2022-04-08 15:12:45,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 991. [2022-04-08 15:12:45,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:12:45,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1307 states. Second operand has 991 states, 986 states have (on average 1.5557809330628802) internal successors, (1534), 986 states have internal predecessors, (1534), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:45,486 INFO L74 IsIncluded]: Start isIncluded. First operand 1307 states. Second operand has 991 states, 986 states have (on average 1.5557809330628802) internal successors, (1534), 986 states have internal predecessors, (1534), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:45,487 INFO L87 Difference]: Start difference. First operand 1307 states. Second operand has 991 states, 986 states have (on average 1.5557809330628802) internal successors, (1534), 986 states have internal predecessors, (1534), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:45,536 INFO L93 Difference]: Finished difference Result 1307 states and 1976 transitions. [2022-04-08 15:12:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1976 transitions. [2022-04-08 15:12:45,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:12:45,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:12:45,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 986 states have (on average 1.5557809330628802) internal successors, (1534), 986 states have internal predecessors, (1534), 3 states have call successors, (3), 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 1307 states. [2022-04-08 15:12:45,540 INFO L87 Difference]: Start difference. First operand has 991 states, 986 states have (on average 1.5557809330628802) internal successors, (1534), 986 states have internal predecessors, (1534), 3 states have call successors, (3), 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 1307 states. [2022-04-08 15:12:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:45,591 INFO L93 Difference]: Finished difference Result 1307 states and 1976 transitions. [2022-04-08 15:12:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1976 transitions. [2022-04-08 15:12:45,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:12:45,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:12:45,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:12:45,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:12:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 986 states have (on average 1.5557809330628802) internal successors, (1534), 986 states have internal predecessors, (1534), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1538 transitions. [2022-04-08 15:12:45,639 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1538 transitions. Word has length 156 [2022-04-08 15:12:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:12:45,640 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1538 transitions. [2022-04-08 15:12:45,640 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:12:45,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1538 transitions. [2022-04-08 15:12:46,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1538 edges. 1538 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:12:46,863 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1538 transitions. [2022-04-08 15:12:46,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-08 15:12:46,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:12:46,865 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 4, 4, 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] [2022-04-08 15:12:46,865 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 15:12:46,866 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:12:46,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:12:46,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1672065772, now seen corresponding path program 3 times [2022-04-08 15:12:46,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:12:46,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [286867490] [2022-04-08 15:12:55,270 WARN L232 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:13:03,871 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1672065772, now seen corresponding path program 4 times [2022-04-08 15:13:03,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:03,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572602472] [2022-04-08 15:13:03,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:03,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:04,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:04,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {45865#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {45858#true} is VALID [2022-04-08 15:13:04,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {45858#true} assume true; {45858#true} is VALID [2022-04-08 15:13:04,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45858#true} {45858#true} #593#return; {45858#true} is VALID [2022-04-08 15:13:04,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {45858#true} call ULTIMATE.init(); {45865#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:13:04,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {45865#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {45858#true} assume true; {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45858#true} {45858#true} #593#return; {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {45858#true} call #t~ret158 := main(); {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {45858#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; {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {45858#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {45858#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); {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {45858#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; {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {45858#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; {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {45858#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {45858#true} assume !false; {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {45858#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {45858#true} assume 12292 == #t~mem49;havoc #t~mem49; {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {45858#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; {45858#true} is VALID [2022-04-08 15:13:04,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {45858#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {45858#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {45858#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {45858#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); {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {45858#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {45858#true} assume !(0 == ~tmp___4~0); {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {45858#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); {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {45858#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); {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {45858#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {45858#true} ~skip~0 := 0; {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {45858#true} assume !false; {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {45858#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {45858#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {45858#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {45858#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {45858#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {45858#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {45858#true} assume 4368 == #t~mem54;havoc #t~mem54; {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {45858#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; {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {45858#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {45858#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); {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {45858#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; {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {45858#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); {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {45858#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {45858#true} ~skip~0 := 0; {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {45858#true} assume !false; {45858#true} is VALID [2022-04-08 15:13:04,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {45858#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {45858#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {45858#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {45858#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {45858#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {45858#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {45858#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {45858#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {45858#true} assume 4384 == #t~mem56;havoc #t~mem56; {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {45858#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {45858#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {45858#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {45858#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {45858#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {45858#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); {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {45858#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {45858#true} ~skip~0 := 0; {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {45858#true} assume !false; {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {45858#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {45858#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {45858#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {45858#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 63: Hoare triple {45858#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 64: Hoare triple {45858#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 65: Hoare triple {45858#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 66: Hoare triple {45858#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 67: Hoare triple {45858#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,055 INFO L290 TraceCheckUtils]: 68: Hoare triple {45858#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {45858#true} assume 4400 == #t~mem58;havoc #t~mem58; {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 70: Hoare triple {45858#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); {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 71: Hoare triple {45858#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; {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 72: Hoare triple {45858#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 73: Hoare triple {45858#true} assume !(~ret~0 <= 0); {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 74: Hoare triple {45858#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 75: Hoare triple {45858#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); {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 76: Hoare triple {45858#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 77: Hoare triple {45858#true} ~skip~0 := 0; {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 78: Hoare triple {45858#true} assume !false; {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 79: Hoare triple {45858#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 80: Hoare triple {45858#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 81: Hoare triple {45858#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,056 INFO L290 TraceCheckUtils]: 82: Hoare triple {45858#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,057 INFO L290 TraceCheckUtils]: 83: Hoare triple {45858#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {45858#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {45858#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,057 INFO L290 TraceCheckUtils]: 86: Hoare triple {45858#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,057 INFO L290 TraceCheckUtils]: 87: Hoare triple {45858#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,057 INFO L290 TraceCheckUtils]: 88: Hoare triple {45858#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,057 INFO L290 TraceCheckUtils]: 89: Hoare triple {45858#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,057 INFO L290 TraceCheckUtils]: 90: Hoare triple {45858#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45858#true} is VALID [2022-04-08 15:13:04,057 INFO L290 TraceCheckUtils]: 91: Hoare triple {45858#true} assume 4416 == #t~mem60;havoc #t~mem60; {45858#true} is VALID [2022-04-08 15:13:04,057 INFO L290 TraceCheckUtils]: 92: Hoare triple {45858#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {45858#true} is VALID [2022-04-08 15:13:04,057 INFO L290 TraceCheckUtils]: 93: Hoare triple {45858#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {45858#true} is VALID [2022-04-08 15:13:04,058 INFO L290 TraceCheckUtils]: 94: Hoare triple {45858#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); {45863#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:04,058 INFO L290 TraceCheckUtils]: 95: Hoare triple {45863#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {45863#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:04,059 INFO L290 TraceCheckUtils]: 96: Hoare triple {45863#(= 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); {45863#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:04,059 INFO L290 TraceCheckUtils]: 97: Hoare triple {45863#(= 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; {45863#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:04,059 INFO L290 TraceCheckUtils]: 98: Hoare triple {45863#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {45863#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:04,060 INFO L290 TraceCheckUtils]: 99: Hoare triple {45863#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {45863#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:04,060 INFO L290 TraceCheckUtils]: 100: Hoare triple {45863#(= 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); {45864#(= |ssl3_connect_#t~mem49| 4432)} is VALID [2022-04-08 15:13:04,060 INFO L290 TraceCheckUtils]: 101: Hoare triple {45864#(= |ssl3_connect_#t~mem49| 4432)} assume 12292 == #t~mem49;havoc #t~mem49; {45859#false} is VALID [2022-04-08 15:13:04,060 INFO L290 TraceCheckUtils]: 102: Hoare triple {45859#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; {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 103: Hoare triple {45859#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 104: Hoare triple {45859#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 105: Hoare triple {45859#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 106: Hoare triple {45859#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); {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 107: Hoare triple {45859#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 108: Hoare triple {45859#false} assume !(0 == ~tmp___4~0); {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 109: Hoare triple {45859#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); {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 110: Hoare triple {45859#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); {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 111: Hoare triple {45859#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 112: Hoare triple {45859#false} ~skip~0 := 0; {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 113: Hoare triple {45859#false} assume !false; {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 114: Hoare triple {45859#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); {45859#false} is VALID [2022-04-08 15:13:04,061 INFO L290 TraceCheckUtils]: 115: Hoare triple {45859#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 116: Hoare triple {45859#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 117: Hoare triple {45859#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 118: Hoare triple {45859#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 119: Hoare triple {45859#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 120: Hoare triple {45859#false} assume 4368 == #t~mem54;havoc #t~mem54; {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 121: Hoare triple {45859#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; {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 122: Hoare triple {45859#false} assume !(0 == ~blastFlag~0); {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 123: Hoare triple {45859#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 124: Hoare triple {45859#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); {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 125: Hoare triple {45859#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; {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 126: Hoare triple {45859#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); {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 127: Hoare triple {45859#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 128: Hoare triple {45859#false} ~skip~0 := 0; {45859#false} is VALID [2022-04-08 15:13:04,062 INFO L290 TraceCheckUtils]: 129: Hoare triple {45859#false} assume !false; {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 130: Hoare triple {45859#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); {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 131: Hoare triple {45859#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 132: Hoare triple {45859#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 133: Hoare triple {45859#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 134: Hoare triple {45859#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 135: Hoare triple {45859#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 136: Hoare triple {45859#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 137: Hoare triple {45859#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 138: Hoare triple {45859#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 139: Hoare triple {45859#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 140: Hoare triple {45859#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,063 INFO L290 TraceCheckUtils]: 141: Hoare triple {45859#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 142: Hoare triple {45859#false} assume 4416 == #t~mem60;havoc #t~mem60; {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 143: Hoare triple {45859#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 144: Hoare triple {45859#false} assume !(3 == ~blastFlag~0); {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 145: Hoare triple {45859#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); {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 146: Hoare triple {45859#false} assume !(0 == ~tmp___6~0); {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 147: Hoare triple {45859#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); {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 148: Hoare triple {45859#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 149: Hoare triple {45859#false} ~skip~0 := 0; {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 150: Hoare triple {45859#false} assume !false; {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 151: Hoare triple {45859#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); {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 152: Hoare triple {45859#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 153: Hoare triple {45859#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 154: Hoare triple {45859#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,064 INFO L290 TraceCheckUtils]: 155: Hoare triple {45859#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 156: Hoare triple {45859#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 157: Hoare triple {45859#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 158: Hoare triple {45859#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 159: Hoare triple {45859#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 160: Hoare triple {45859#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 161: Hoare triple {45859#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 162: Hoare triple {45859#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 163: Hoare triple {45859#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 164: Hoare triple {45859#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 165: Hoare triple {45859#false} assume 4432 == #t~mem62;havoc #t~mem62; {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 166: Hoare triple {45859#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 167: Hoare triple {45859#false} assume 5 == ~blastFlag~0; {45859#false} is VALID [2022-04-08 15:13:04,065 INFO L290 TraceCheckUtils]: 168: Hoare triple {45859#false} assume !false; {45859#false} is VALID [2022-04-08 15:13:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-04-08 15:13:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:04,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572602472] [2022-04-08 15:13:04,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572602472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:04,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:04,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:04,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:04,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [286867490] [2022-04-08 15:13:04,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [286867490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:04,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:04,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:04,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133782527] [2022-04-08 15:13:04,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:04,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2022-04-08 15:13:04,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:04,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:04,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:04,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:04,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:04,141 INFO L87 Difference]: Start difference. First operand 991 states and 1538 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:06,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:13:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:07,617 INFO L93 Difference]: Finished difference Result 2277 states and 3489 transitions. [2022-04-08 15:13:07,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:07,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2022-04-08 15:13:07,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-08 15:13:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-08 15:13:07,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 465 transitions. [2022-04-08 15:13:07,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:07,996 INFO L225 Difference]: With dead ends: 2277 [2022-04-08 15:13:07,997 INFO L226 Difference]: Without dead ends: 1302 [2022-04-08 15:13:07,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:13:07,998 INFO L913 BasicCegarLoop]: 233 mSDtfsCounter, 103 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:07,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 555 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 525 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:13:07,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2022-04-08 15:13:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 991. [2022-04-08 15:13:08,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:08,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.550709939148073) internal successors, (1529), 986 states have internal predecessors, (1529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:08,030 INFO L74 IsIncluded]: Start isIncluded. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.550709939148073) internal successors, (1529), 986 states have internal predecessors, (1529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:08,031 INFO L87 Difference]: Start difference. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.550709939148073) internal successors, (1529), 986 states have internal predecessors, (1529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:08,080 INFO L93 Difference]: Finished difference Result 1302 states and 1966 transitions. [2022-04-08 15:13:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1966 transitions. [2022-04-08 15:13:08,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:08,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:08,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 986 states have (on average 1.550709939148073) internal successors, (1529), 986 states have internal predecessors, (1529), 3 states have call successors, (3), 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 1302 states. [2022-04-08 15:13:08,083 INFO L87 Difference]: Start difference. First operand has 991 states, 986 states have (on average 1.550709939148073) internal successors, (1529), 986 states have internal predecessors, (1529), 3 states have call successors, (3), 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 1302 states. [2022-04-08 15:13:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:08,131 INFO L93 Difference]: Finished difference Result 1302 states and 1966 transitions. [2022-04-08 15:13:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1966 transitions. [2022-04-08 15:13:08,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:08,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:08,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:08,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 986 states have (on average 1.550709939148073) internal successors, (1529), 986 states have internal predecessors, (1529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1533 transitions. [2022-04-08 15:13:08,191 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1533 transitions. Word has length 169 [2022-04-08 15:13:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:08,191 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1533 transitions. [2022-04-08 15:13:08,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:08,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1533 transitions. [2022-04-08 15:13:09,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1533 edges. 1533 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1533 transitions. [2022-04-08 15:13:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-08 15:13:09,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:09,274 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 4, 4, 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] [2022-04-08 15:13:09,274 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 15:13:09,275 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:09,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:09,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2084891954, now seen corresponding path program 1 times [2022-04-08 15:13:09,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:09,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1750443757] [2022-04-08 15:13:27,797 WARN L232 SmtUtils]: Spent 13.07s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:13:35,827 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:35,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2084891954, now seen corresponding path program 2 times [2022-04-08 15:13:35,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:35,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639709825] [2022-04-08 15:13:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:35,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:35,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:35,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {55017#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {55010#true} is VALID [2022-04-08 15:13:35,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {55010#true} assume true; {55010#true} is VALID [2022-04-08 15:13:35,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55010#true} {55010#true} #593#return; {55010#true} is VALID [2022-04-08 15:13:35,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {55010#true} call ULTIMATE.init(); {55017#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:13:35,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {55017#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {55010#true} is VALID [2022-04-08 15:13:35,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {55010#true} assume true; {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55010#true} {55010#true} #593#return; {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {55010#true} call #t~ret158 := main(); {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {55010#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; {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L272 TraceCheckUtils]: 6: Hoare triple {55010#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {55010#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); {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {55010#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; {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {55010#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; {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {55010#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {55010#true} assume !false; {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {55010#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {55010#true} assume 12292 == #t~mem49;havoc #t~mem49; {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {55010#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; {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {55010#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {55010#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {55010#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {55010#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); {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {55010#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {55010#true} assume !(0 == ~tmp___4~0); {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {55010#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); {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {55010#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); {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {55010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {55010#true} ~skip~0 := 0; {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {55010#true} assume !false; {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {55010#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {55010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {55010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {55010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {55010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {55010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {55010#true} assume 4368 == #t~mem54;havoc #t~mem54; {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {55010#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; {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {55010#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {55010#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); {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {55010#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; {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {55010#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); {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {55010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {55010#true} ~skip~0 := 0; {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {55010#true} assume !false; {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {55010#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 42: Hoare triple {55010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 43: Hoare triple {55010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 44: Hoare triple {55010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,998 INFO L290 TraceCheckUtils]: 45: Hoare triple {55010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 46: Hoare triple {55010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 47: Hoare triple {55010#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 48: Hoare triple {55010#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 49: Hoare triple {55010#true} assume 4384 == #t~mem56;havoc #t~mem56; {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 50: Hoare triple {55010#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 51: Hoare triple {55010#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 52: Hoare triple {55010#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 53: Hoare triple {55010#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {55010#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 55: Hoare triple {55010#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); {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {55010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 57: Hoare triple {55010#true} ~skip~0 := 0; {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 58: Hoare triple {55010#true} assume !false; {55010#true} is VALID [2022-04-08 15:13:35,999 INFO L290 TraceCheckUtils]: 59: Hoare triple {55010#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 60: Hoare triple {55010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 61: Hoare triple {55010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 62: Hoare triple {55010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 63: Hoare triple {55010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 64: Hoare triple {55010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 65: Hoare triple {55010#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 66: Hoare triple {55010#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 67: Hoare triple {55010#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 68: Hoare triple {55010#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 69: Hoare triple {55010#true} assume 4400 == #t~mem58;havoc #t~mem58; {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 70: Hoare triple {55010#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); {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 71: Hoare triple {55010#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; {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 72: Hoare triple {55010#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {55010#true} is VALID [2022-04-08 15:13:36,000 INFO L290 TraceCheckUtils]: 73: Hoare triple {55010#true} assume !(~ret~0 <= 0); {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 74: Hoare triple {55010#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 75: Hoare triple {55010#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); {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 76: Hoare triple {55010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 77: Hoare triple {55010#true} ~skip~0 := 0; {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 78: Hoare triple {55010#true} assume !false; {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 79: Hoare triple {55010#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {55010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {55010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 82: Hoare triple {55010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 83: Hoare triple {55010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 84: Hoare triple {55010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 85: Hoare triple {55010#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 86: Hoare triple {55010#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,001 INFO L290 TraceCheckUtils]: 87: Hoare triple {55010#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,002 INFO L290 TraceCheckUtils]: 88: Hoare triple {55010#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,002 INFO L290 TraceCheckUtils]: 89: Hoare triple {55010#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,002 INFO L290 TraceCheckUtils]: 90: Hoare triple {55010#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55010#true} is VALID [2022-04-08 15:13:36,002 INFO L290 TraceCheckUtils]: 91: Hoare triple {55010#true} assume 4416 == #t~mem60;havoc #t~mem60; {55010#true} is VALID [2022-04-08 15:13:36,002 INFO L290 TraceCheckUtils]: 92: Hoare triple {55010#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {55010#true} is VALID [2022-04-08 15:13:36,002 INFO L290 TraceCheckUtils]: 93: Hoare triple {55010#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {55010#true} is VALID [2022-04-08 15:13:36,003 INFO L290 TraceCheckUtils]: 94: Hoare triple {55010#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); {55015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:36,003 INFO L290 TraceCheckUtils]: 95: Hoare triple {55015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {55015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:36,003 INFO L290 TraceCheckUtils]: 96: Hoare triple {55015#(= 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); {55015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:36,004 INFO L290 TraceCheckUtils]: 97: Hoare triple {55015#(= 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; {55015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:36,004 INFO L290 TraceCheckUtils]: 98: Hoare triple {55015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {55015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:36,004 INFO L290 TraceCheckUtils]: 99: Hoare triple {55015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {55015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:36,005 INFO L290 TraceCheckUtils]: 100: Hoare triple {55015#(= 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); {55015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:13:36,005 INFO L290 TraceCheckUtils]: 101: Hoare triple {55015#(= 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); {55016#(= |ssl3_connect_#t~mem50| 4432)} is VALID [2022-04-08 15:13:36,005 INFO L290 TraceCheckUtils]: 102: Hoare triple {55016#(= |ssl3_connect_#t~mem50| 4432)} assume 16384 == #t~mem50;havoc #t~mem50; {55011#false} is VALID [2022-04-08 15:13:36,005 INFO L290 TraceCheckUtils]: 103: Hoare triple {55011#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,005 INFO L290 TraceCheckUtils]: 104: Hoare triple {55011#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 105: Hoare triple {55011#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 106: Hoare triple {55011#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); {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 107: Hoare triple {55011#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 108: Hoare triple {55011#false} assume !(0 == ~tmp___4~0); {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 109: Hoare triple {55011#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); {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 110: Hoare triple {55011#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); {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 111: Hoare triple {55011#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 112: Hoare triple {55011#false} ~skip~0 := 0; {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 113: Hoare triple {55011#false} assume !false; {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 114: Hoare triple {55011#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); {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 115: Hoare triple {55011#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 116: Hoare triple {55011#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 117: Hoare triple {55011#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,006 INFO L290 TraceCheckUtils]: 118: Hoare triple {55011#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 119: Hoare triple {55011#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 120: Hoare triple {55011#false} assume 4368 == #t~mem54;havoc #t~mem54; {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 121: Hoare triple {55011#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; {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 122: Hoare triple {55011#false} assume !(0 == ~blastFlag~0); {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 123: Hoare triple {55011#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 124: Hoare triple {55011#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); {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 125: Hoare triple {55011#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; {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 126: Hoare triple {55011#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); {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 127: Hoare triple {55011#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 128: Hoare triple {55011#false} ~skip~0 := 0; {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 129: Hoare triple {55011#false} assume !false; {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 130: Hoare triple {55011#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); {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 131: Hoare triple {55011#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,007 INFO L290 TraceCheckUtils]: 132: Hoare triple {55011#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 133: Hoare triple {55011#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 134: Hoare triple {55011#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 135: Hoare triple {55011#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 136: Hoare triple {55011#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 137: Hoare triple {55011#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 138: Hoare triple {55011#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 139: Hoare triple {55011#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 140: Hoare triple {55011#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 141: Hoare triple {55011#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 142: Hoare triple {55011#false} assume 4416 == #t~mem60;havoc #t~mem60; {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 143: Hoare triple {55011#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 144: Hoare triple {55011#false} assume !(3 == ~blastFlag~0); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 145: Hoare triple {55011#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); {55011#false} is VALID [2022-04-08 15:13:36,008 INFO L290 TraceCheckUtils]: 146: Hoare triple {55011#false} assume !(0 == ~tmp___6~0); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 147: Hoare triple {55011#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); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 148: Hoare triple {55011#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 149: Hoare triple {55011#false} ~skip~0 := 0; {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 150: Hoare triple {55011#false} assume !false; {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 151: Hoare triple {55011#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); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 152: Hoare triple {55011#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 153: Hoare triple {55011#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 154: Hoare triple {55011#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 155: Hoare triple {55011#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 156: Hoare triple {55011#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 157: Hoare triple {55011#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 158: Hoare triple {55011#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 159: Hoare triple {55011#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 160: Hoare triple {55011#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,009 INFO L290 TraceCheckUtils]: 161: Hoare triple {55011#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,010 INFO L290 TraceCheckUtils]: 162: Hoare triple {55011#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,010 INFO L290 TraceCheckUtils]: 163: Hoare triple {55011#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,010 INFO L290 TraceCheckUtils]: 164: Hoare triple {55011#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55011#false} is VALID [2022-04-08 15:13:36,010 INFO L290 TraceCheckUtils]: 165: Hoare triple {55011#false} assume 4432 == #t~mem62;havoc #t~mem62; {55011#false} is VALID [2022-04-08 15:13:36,010 INFO L290 TraceCheckUtils]: 166: Hoare triple {55011#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {55011#false} is VALID [2022-04-08 15:13:36,010 INFO L290 TraceCheckUtils]: 167: Hoare triple {55011#false} assume 5 == ~blastFlag~0; {55011#false} is VALID [2022-04-08 15:13:36,010 INFO L290 TraceCheckUtils]: 168: Hoare triple {55011#false} assume !false; {55011#false} is VALID [2022-04-08 15:13:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-04-08 15:13:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:36,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639709825] [2022-04-08 15:13:36,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639709825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:36,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:36,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:36,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:36,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1750443757] [2022-04-08 15:13:36,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1750443757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:36,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:36,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831564830] [2022-04-08 15:13:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:36,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2022-04-08 15:13:36,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:36,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:36,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:36,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:36,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:36,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:36,086 INFO L87 Difference]: Start difference. First operand 991 states and 1533 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:38,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:13:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:39,496 INFO L93 Difference]: Finished difference Result 2277 states and 3479 transitions. [2022-04-08 15:13:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:39,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2022-04-08 15:13:39,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-08 15:13:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-08 15:13:39,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 464 transitions. [2022-04-08 15:13:39,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:39,830 INFO L225 Difference]: With dead ends: 2277 [2022-04-08 15:13:39,830 INFO L226 Difference]: Without dead ends: 1302 [2022-04-08 15:13:39,832 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:13:39,832 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 101 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:39,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 553 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 524 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:13:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2022-04-08 15:13:39,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 991. [2022-04-08 15:13:39,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:39,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.5456389452332657) internal successors, (1524), 986 states have internal predecessors, (1524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:39,865 INFO L74 IsIncluded]: Start isIncluded. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.5456389452332657) internal successors, (1524), 986 states have internal predecessors, (1524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:39,866 INFO L87 Difference]: Start difference. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.5456389452332657) internal successors, (1524), 986 states have internal predecessors, (1524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:39,914 INFO L93 Difference]: Finished difference Result 1302 states and 1961 transitions. [2022-04-08 15:13:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1961 transitions. [2022-04-08 15:13:39,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:39,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:39,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 986 states have (on average 1.5456389452332657) internal successors, (1524), 986 states have internal predecessors, (1524), 3 states have call successors, (3), 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 1302 states. [2022-04-08 15:13:39,918 INFO L87 Difference]: Start difference. First operand has 991 states, 986 states have (on average 1.5456389452332657) internal successors, (1524), 986 states have internal predecessors, (1524), 3 states have call successors, (3), 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 1302 states. [2022-04-08 15:13:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:39,967 INFO L93 Difference]: Finished difference Result 1302 states and 1961 transitions. [2022-04-08 15:13:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1961 transitions. [2022-04-08 15:13:39,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:39,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:39,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:39,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 986 states have (on average 1.5456389452332657) internal successors, (1524), 986 states have internal predecessors, (1524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1528 transitions. [2022-04-08 15:13:40,013 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1528 transitions. Word has length 169 [2022-04-08 15:13:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:40,013 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1528 transitions. [2022-04-08 15:13:40,013 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:40,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1528 transitions. [2022-04-08 15:13:41,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1528 edges. 1528 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1528 transitions. [2022-04-08 15:13:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-08 15:13:41,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:41,083 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 4, 4, 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] [2022-04-08 15:13:41,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 15:13:41,084 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:41,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:41,085 INFO L85 PathProgramCache]: Analyzing trace with hash -666681003, now seen corresponding path program 1 times [2022-04-08 15:13:41,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:41,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2026093502] [2022-04-08 15:13:56,527 WARN L232 SmtUtils]: Spent 13.98s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:14:10,908 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash -666681003, now seen corresponding path program 2 times [2022-04-08 15:14:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:10,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316440897] [2022-04-08 15:14:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:11,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:11,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {64169#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {64162#true} is VALID [2022-04-08 15:14:11,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {64162#true} assume true; {64162#true} is VALID [2022-04-08 15:14:11,148 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64162#true} {64162#true} #593#return; {64162#true} is VALID [2022-04-08 15:14:11,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {64162#true} call ULTIMATE.init(); {64169#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:11,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {64169#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {64162#true} is VALID [2022-04-08 15:14:11,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {64162#true} assume true; {64162#true} is VALID [2022-04-08 15:14:11,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64162#true} {64162#true} #593#return; {64162#true} is VALID [2022-04-08 15:14:11,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {64162#true} call #t~ret158 := main(); {64162#true} is VALID [2022-04-08 15:14:11,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {64162#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; {64162#true} is VALID [2022-04-08 15:14:11,149 INFO L272 TraceCheckUtils]: 6: Hoare triple {64162#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {64162#true} is VALID [2022-04-08 15:14:11,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {64162#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); {64162#true} is VALID [2022-04-08 15:14:11,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {64162#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; {64162#true} is VALID [2022-04-08 15:14:11,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {64162#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; {64162#true} is VALID [2022-04-08 15:14:11,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {64162#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {64162#true} assume !false; {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {64162#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {64162#true} assume 12292 == #t~mem49;havoc #t~mem49; {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {64162#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; {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {64162#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {64162#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {64162#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {64162#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); {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {64162#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {64162#true} assume !(0 == ~tmp___4~0); {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {64162#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); {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {64162#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); {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {64162#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64162#true} is VALID [2022-04-08 15:14:11,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {64162#true} ~skip~0 := 0; {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {64162#true} assume !false; {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {64162#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {64162#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {64162#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {64162#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {64162#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {64162#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {64162#true} assume 4368 == #t~mem54;havoc #t~mem54; {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {64162#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; {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {64162#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {64162#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); {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {64162#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; {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {64162#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); {64162#true} is VALID [2022-04-08 15:14:11,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {64162#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {64162#true} ~skip~0 := 0; {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {64162#true} assume !false; {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {64162#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {64162#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {64162#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {64162#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {64162#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {64162#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {64162#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 48: Hoare triple {64162#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {64162#true} assume 4384 == #t~mem56;havoc #t~mem56; {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {64162#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 51: Hoare triple {64162#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {64162#true} is VALID [2022-04-08 15:14:11,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {64162#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 53: Hoare triple {64162#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 54: Hoare triple {64162#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 55: Hoare triple {64162#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); {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 56: Hoare triple {64162#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {64162#true} ~skip~0 := 0; {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {64162#true} assume !false; {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {64162#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 60: Hoare triple {64162#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {64162#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 62: Hoare triple {64162#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 63: Hoare triple {64162#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 64: Hoare triple {64162#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 65: Hoare triple {64162#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {64162#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 67: Hoare triple {64162#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {64162#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {64162#true} assume 4400 == #t~mem58;havoc #t~mem58; {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {64162#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); {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {64162#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; {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 72: Hoare triple {64162#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 73: Hoare triple {64162#true} assume !(~ret~0 <= 0); {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 74: Hoare triple {64162#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 75: Hoare triple {64162#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); {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 76: Hoare triple {64162#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {64162#true} ~skip~0 := 0; {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 78: Hoare triple {64162#true} assume !false; {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 79: Hoare triple {64162#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,154 INFO L290 TraceCheckUtils]: 80: Hoare triple {64162#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 81: Hoare triple {64162#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 82: Hoare triple {64162#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 83: Hoare triple {64162#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {64162#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {64162#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 86: Hoare triple {64162#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 87: Hoare triple {64162#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 88: Hoare triple {64162#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 89: Hoare triple {64162#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 90: Hoare triple {64162#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 91: Hoare triple {64162#true} assume 4416 == #t~mem60;havoc #t~mem60; {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 92: Hoare triple {64162#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {64162#true} is VALID [2022-04-08 15:14:11,155 INFO L290 TraceCheckUtils]: 93: Hoare triple {64162#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {64162#true} is VALID [2022-04-08 15:14:11,156 INFO L290 TraceCheckUtils]: 94: Hoare triple {64162#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); {64167#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:11,157 INFO L290 TraceCheckUtils]: 95: Hoare triple {64167#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {64167#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:11,157 INFO L290 TraceCheckUtils]: 96: Hoare triple {64167#(= 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); {64167#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:11,157 INFO L290 TraceCheckUtils]: 97: Hoare triple {64167#(= 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; {64167#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:11,158 INFO L290 TraceCheckUtils]: 98: Hoare triple {64167#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {64167#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:11,158 INFO L290 TraceCheckUtils]: 99: Hoare triple {64167#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {64167#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:11,158 INFO L290 TraceCheckUtils]: 100: Hoare triple {64167#(= 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); {64167#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:11,159 INFO L290 TraceCheckUtils]: 101: Hoare triple {64167#(= 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); {64167#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:11,159 INFO L290 TraceCheckUtils]: 102: Hoare triple {64167#(= 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); {64168#(= |ssl3_connect_#t~mem51| 4432)} is VALID [2022-04-08 15:14:11,159 INFO L290 TraceCheckUtils]: 103: Hoare triple {64168#(= |ssl3_connect_#t~mem51| 4432)} assume 4096 == #t~mem51;havoc #t~mem51; {64163#false} is VALID [2022-04-08 15:14:11,159 INFO L290 TraceCheckUtils]: 104: Hoare triple {64163#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,159 INFO L290 TraceCheckUtils]: 105: Hoare triple {64163#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 106: Hoare triple {64163#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 107: Hoare triple {64163#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); {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 108: Hoare triple {64163#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 109: Hoare triple {64163#false} assume !(0 == ~tmp___4~0); {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 110: Hoare triple {64163#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); {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 111: Hoare triple {64163#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); {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 112: Hoare triple {64163#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 113: Hoare triple {64163#false} ~skip~0 := 0; {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 114: Hoare triple {64163#false} assume !false; {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 115: Hoare triple {64163#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); {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 116: Hoare triple {64163#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 117: Hoare triple {64163#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 118: Hoare triple {64163#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,160 INFO L290 TraceCheckUtils]: 119: Hoare triple {64163#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,161 INFO L290 TraceCheckUtils]: 120: Hoare triple {64163#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,161 INFO L290 TraceCheckUtils]: 121: Hoare triple {64163#false} assume 4368 == #t~mem54;havoc #t~mem54; {64163#false} is VALID [2022-04-08 15:14:11,161 INFO L290 TraceCheckUtils]: 122: Hoare triple {64163#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; {64163#false} is VALID [2022-04-08 15:14:11,161 INFO L290 TraceCheckUtils]: 123: Hoare triple {64163#false} assume !(0 == ~blastFlag~0); {64163#false} is VALID [2022-04-08 15:14:11,161 INFO L290 TraceCheckUtils]: 124: Hoare triple {64163#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {64163#false} is VALID [2022-04-08 15:14:11,173 INFO L290 TraceCheckUtils]: 125: Hoare triple {64163#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); {64163#false} is VALID [2022-04-08 15:14:11,173 INFO L290 TraceCheckUtils]: 126: Hoare triple {64163#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; {64163#false} is VALID [2022-04-08 15:14:11,173 INFO L290 TraceCheckUtils]: 127: Hoare triple {64163#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); {64163#false} is VALID [2022-04-08 15:14:11,173 INFO L290 TraceCheckUtils]: 128: Hoare triple {64163#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64163#false} is VALID [2022-04-08 15:14:11,173 INFO L290 TraceCheckUtils]: 129: Hoare triple {64163#false} ~skip~0 := 0; {64163#false} is VALID [2022-04-08 15:14:11,173 INFO L290 TraceCheckUtils]: 130: Hoare triple {64163#false} assume !false; {64163#false} is VALID [2022-04-08 15:14:11,173 INFO L290 TraceCheckUtils]: 131: Hoare triple {64163#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); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 132: Hoare triple {64163#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 133: Hoare triple {64163#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 134: Hoare triple {64163#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 135: Hoare triple {64163#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 136: Hoare triple {64163#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 137: Hoare triple {64163#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 138: Hoare triple {64163#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 139: Hoare triple {64163#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 140: Hoare triple {64163#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 141: Hoare triple {64163#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 142: Hoare triple {64163#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 143: Hoare triple {64163#false} assume 4416 == #t~mem60;havoc #t~mem60; {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 144: Hoare triple {64163#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {64163#false} is VALID [2022-04-08 15:14:11,174 INFO L290 TraceCheckUtils]: 145: Hoare triple {64163#false} assume !(3 == ~blastFlag~0); {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 146: Hoare triple {64163#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); {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 147: Hoare triple {64163#false} assume !(0 == ~tmp___6~0); {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 148: Hoare triple {64163#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); {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 149: Hoare triple {64163#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 150: Hoare triple {64163#false} ~skip~0 := 0; {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 151: Hoare triple {64163#false} assume !false; {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 152: Hoare triple {64163#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); {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 153: Hoare triple {64163#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 154: Hoare triple {64163#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 155: Hoare triple {64163#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 156: Hoare triple {64163#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 157: Hoare triple {64163#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 158: Hoare triple {64163#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,175 INFO L290 TraceCheckUtils]: 159: Hoare triple {64163#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,176 INFO L290 TraceCheckUtils]: 160: Hoare triple {64163#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,176 INFO L290 TraceCheckUtils]: 161: Hoare triple {64163#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,176 INFO L290 TraceCheckUtils]: 162: Hoare triple {64163#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,176 INFO L290 TraceCheckUtils]: 163: Hoare triple {64163#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,176 INFO L290 TraceCheckUtils]: 164: Hoare triple {64163#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,176 INFO L290 TraceCheckUtils]: 165: Hoare triple {64163#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {64163#false} is VALID [2022-04-08 15:14:11,176 INFO L290 TraceCheckUtils]: 166: Hoare triple {64163#false} assume 4432 == #t~mem62;havoc #t~mem62; {64163#false} is VALID [2022-04-08 15:14:11,176 INFO L290 TraceCheckUtils]: 167: Hoare triple {64163#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {64163#false} is VALID [2022-04-08 15:14:11,176 INFO L290 TraceCheckUtils]: 168: Hoare triple {64163#false} assume 5 == ~blastFlag~0; {64163#false} is VALID [2022-04-08 15:14:11,176 INFO L290 TraceCheckUtils]: 169: Hoare triple {64163#false} assume !false; {64163#false} is VALID [2022-04-08 15:14:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-04-08 15:14:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:11,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316440897] [2022-04-08 15:14:11,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316440897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:11,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:11,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:11,177 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:11,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2026093502] [2022-04-08 15:14:11,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2026093502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:11,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:11,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497264747] [2022-04-08 15:14:11,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:11,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 170 [2022-04-08 15:14:11,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:11,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:11,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:11,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:11,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:11,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:11,265 INFO L87 Difference]: Start difference. First operand 991 states and 1528 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:13,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:14:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:14,703 INFO L93 Difference]: Finished difference Result 2277 states and 3469 transitions. [2022-04-08 15:14:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:14,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 170 [2022-04-08 15:14:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-08 15:14:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-08 15:14:14,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-08 15:14:15,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:15,078 INFO L225 Difference]: With dead ends: 2277 [2022-04-08 15:14:15,079 INFO L226 Difference]: Without dead ends: 1302 [2022-04-08 15:14:15,080 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:14:15,080 INFO L913 BasicCegarLoop]: 231 mSDtfsCounter, 99 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:15,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 551 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 523 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:14:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2022-04-08 15:14:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 991. [2022-04-08 15:14:15,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:15,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.5405679513184585) internal successors, (1519), 986 states have internal predecessors, (1519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:15,115 INFO L74 IsIncluded]: Start isIncluded. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.5405679513184585) internal successors, (1519), 986 states have internal predecessors, (1519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:15,116 INFO L87 Difference]: Start difference. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.5405679513184585) internal successors, (1519), 986 states have internal predecessors, (1519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:15,164 INFO L93 Difference]: Finished difference Result 1302 states and 1956 transitions. [2022-04-08 15:14:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1956 transitions. [2022-04-08 15:14:15,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:15,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:15,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 986 states have (on average 1.5405679513184585) internal successors, (1519), 986 states have internal predecessors, (1519), 3 states have call successors, (3), 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 1302 states. [2022-04-08 15:14:15,168 INFO L87 Difference]: Start difference. First operand has 991 states, 986 states have (on average 1.5405679513184585) internal successors, (1519), 986 states have internal predecessors, (1519), 3 states have call successors, (3), 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 1302 states. [2022-04-08 15:14:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:15,216 INFO L93 Difference]: Finished difference Result 1302 states and 1956 transitions. [2022-04-08 15:14:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1956 transitions. [2022-04-08 15:14:15,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:15,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:15,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:15,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 986 states have (on average 1.5405679513184585) internal successors, (1519), 986 states have internal predecessors, (1519), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1523 transitions. [2022-04-08 15:14:15,262 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1523 transitions. Word has length 170 [2022-04-08 15:14:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:15,262 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1523 transitions. [2022-04-08 15:14:15,262 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:15,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1523 transitions. [2022-04-08 15:14:16,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1523 edges. 1523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1523 transitions. [2022-04-08 15:14:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-08 15:14:16,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:16,635 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 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] [2022-04-08 15:14:16,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 15:14:16,635 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1188486231, now seen corresponding path program 1 times [2022-04-08 15:14:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [529613698] [2022-04-08 15:14:30,500 WARN L232 SmtUtils]: Spent 8.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-08 15:14:37,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1188486231, now seen corresponding path program 2 times [2022-04-08 15:14:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:37,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544119884] [2022-04-08 15:14:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:38,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:38,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {73321#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {73314#true} is VALID [2022-04-08 15:14:38,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {73314#true} assume true; {73314#true} is VALID [2022-04-08 15:14:38,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73314#true} {73314#true} #593#return; {73314#true} is VALID [2022-04-08 15:14:38,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {73314#true} call ULTIMATE.init(); {73321#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:14:38,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {73321#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {73314#true} assume true; {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73314#true} {73314#true} #593#return; {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {73314#true} call #t~ret158 := main(); {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {73314#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; {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L272 TraceCheckUtils]: 6: Hoare triple {73314#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {73314#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); {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {73314#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; {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {73314#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; {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {73314#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {73314#true} assume !false; {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {73314#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {73314#true} assume 12292 == #t~mem49;havoc #t~mem49; {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {73314#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; {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {73314#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {73314#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {73314#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {73314#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); {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {73314#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {73314#true} assume !(0 == ~tmp___4~0); {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {73314#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); {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {73314#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); {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {73314#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {73314#true} ~skip~0 := 0; {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {73314#true} assume !false; {73314#true} is VALID [2022-04-08 15:14:38,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {73314#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {73314#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {73314#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {73314#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {73314#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {73314#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {73314#true} assume 4368 == #t~mem54;havoc #t~mem54; {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {73314#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; {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {73314#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {73314#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); {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {73314#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; {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {73314#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); {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {73314#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {73314#true} ~skip~0 := 0; {73314#true} is VALID [2022-04-08 15:14:38,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {73314#true} assume !false; {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {73314#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {73314#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {73314#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {73314#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {73314#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {73314#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 47: Hoare triple {73314#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {73314#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {73314#true} assume 4384 == #t~mem56;havoc #t~mem56; {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {73314#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 51: Hoare triple {73314#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 52: Hoare triple {73314#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {73314#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 54: Hoare triple {73314#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {73314#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); {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {73314#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {73314#true} ~skip~0 := 0; {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {73314#true} assume !false; {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 59: Hoare triple {73314#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {73314#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {73314#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {73314#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {73314#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {73314#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,151 INFO L290 TraceCheckUtils]: 65: Hoare triple {73314#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {73314#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 67: Hoare triple {73314#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 68: Hoare triple {73314#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 69: Hoare triple {73314#true} assume 4400 == #t~mem58;havoc #t~mem58; {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {73314#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); {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 71: Hoare triple {73314#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; {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {73314#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {73314#true} assume !(~ret~0 <= 0); {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 74: Hoare triple {73314#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 75: Hoare triple {73314#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); {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 76: Hoare triple {73314#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 77: Hoare triple {73314#true} ~skip~0 := 0; {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 78: Hoare triple {73314#true} assume !false; {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 79: Hoare triple {73314#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,152 INFO L290 TraceCheckUtils]: 80: Hoare triple {73314#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 81: Hoare triple {73314#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 82: Hoare triple {73314#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 83: Hoare triple {73314#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 84: Hoare triple {73314#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 85: Hoare triple {73314#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 86: Hoare triple {73314#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 87: Hoare triple {73314#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 88: Hoare triple {73314#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 89: Hoare triple {73314#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 90: Hoare triple {73314#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 91: Hoare triple {73314#true} assume 4416 == #t~mem60;havoc #t~mem60; {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 92: Hoare triple {73314#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {73314#true} is VALID [2022-04-08 15:14:38,153 INFO L290 TraceCheckUtils]: 93: Hoare triple {73314#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {73314#true} is VALID [2022-04-08 15:14:38,154 INFO L290 TraceCheckUtils]: 94: Hoare triple {73314#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); {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:38,155 INFO L290 TraceCheckUtils]: 95: Hoare triple {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:38,155 INFO L290 TraceCheckUtils]: 96: Hoare triple {73319#(= 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); {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:38,155 INFO L290 TraceCheckUtils]: 97: Hoare triple {73319#(= 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; {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:38,156 INFO L290 TraceCheckUtils]: 98: Hoare triple {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:38,156 INFO L290 TraceCheckUtils]: 99: Hoare triple {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:38,156 INFO L290 TraceCheckUtils]: 100: Hoare triple {73319#(= 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); {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:38,157 INFO L290 TraceCheckUtils]: 101: Hoare triple {73319#(= 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); {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:38,157 INFO L290 TraceCheckUtils]: 102: Hoare triple {73319#(= 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); {73319#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:14:38,157 INFO L290 TraceCheckUtils]: 103: Hoare triple {73319#(= 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); {73320#(= |ssl3_connect_#t~mem52| 4432)} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 104: Hoare triple {73320#(= |ssl3_connect_#t~mem52| 4432)} assume 20480 == #t~mem52;havoc #t~mem52; {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 105: Hoare triple {73315#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 106: Hoare triple {73315#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 107: Hoare triple {73315#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 108: Hoare triple {73315#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); {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 109: Hoare triple {73315#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 110: Hoare triple {73315#false} assume !(0 == ~tmp___4~0); {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 111: Hoare triple {73315#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); {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 112: Hoare triple {73315#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); {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 113: Hoare triple {73315#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 114: Hoare triple {73315#false} ~skip~0 := 0; {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 115: Hoare triple {73315#false} assume !false; {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 116: Hoare triple {73315#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); {73315#false} is VALID [2022-04-08 15:14:38,158 INFO L290 TraceCheckUtils]: 117: Hoare triple {73315#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 118: Hoare triple {73315#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 119: Hoare triple {73315#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 120: Hoare triple {73315#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 121: Hoare triple {73315#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 122: Hoare triple {73315#false} assume 4368 == #t~mem54;havoc #t~mem54; {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 123: Hoare triple {73315#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; {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 124: Hoare triple {73315#false} assume !(0 == ~blastFlag~0); {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 125: Hoare triple {73315#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 126: Hoare triple {73315#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); {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 127: Hoare triple {73315#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; {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 128: Hoare triple {73315#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); {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 129: Hoare triple {73315#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 130: Hoare triple {73315#false} ~skip~0 := 0; {73315#false} is VALID [2022-04-08 15:14:38,159 INFO L290 TraceCheckUtils]: 131: Hoare triple {73315#false} assume !false; {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 132: Hoare triple {73315#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); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 133: Hoare triple {73315#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 134: Hoare triple {73315#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 135: Hoare triple {73315#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 136: Hoare triple {73315#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 137: Hoare triple {73315#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 138: Hoare triple {73315#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 139: Hoare triple {73315#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 140: Hoare triple {73315#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 141: Hoare triple {73315#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 142: Hoare triple {73315#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 143: Hoare triple {73315#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 144: Hoare triple {73315#false} assume 4416 == #t~mem60;havoc #t~mem60; {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 145: Hoare triple {73315#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {73315#false} is VALID [2022-04-08 15:14:38,160 INFO L290 TraceCheckUtils]: 146: Hoare triple {73315#false} assume !(3 == ~blastFlag~0); {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 147: Hoare triple {73315#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); {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 148: Hoare triple {73315#false} assume !(0 == ~tmp___6~0); {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 149: Hoare triple {73315#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); {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 150: Hoare triple {73315#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 151: Hoare triple {73315#false} ~skip~0 := 0; {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 152: Hoare triple {73315#false} assume !false; {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 153: Hoare triple {73315#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); {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 154: Hoare triple {73315#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 155: Hoare triple {73315#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 156: Hoare triple {73315#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 157: Hoare triple {73315#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 158: Hoare triple {73315#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 159: Hoare triple {73315#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,161 INFO L290 TraceCheckUtils]: 160: Hoare triple {73315#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,162 INFO L290 TraceCheckUtils]: 161: Hoare triple {73315#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,162 INFO L290 TraceCheckUtils]: 162: Hoare triple {73315#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,162 INFO L290 TraceCheckUtils]: 163: Hoare triple {73315#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,162 INFO L290 TraceCheckUtils]: 164: Hoare triple {73315#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,162 INFO L290 TraceCheckUtils]: 165: Hoare triple {73315#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,162 INFO L290 TraceCheckUtils]: 166: Hoare triple {73315#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {73315#false} is VALID [2022-04-08 15:14:38,162 INFO L290 TraceCheckUtils]: 167: Hoare triple {73315#false} assume 4432 == #t~mem62;havoc #t~mem62; {73315#false} is VALID [2022-04-08 15:14:38,162 INFO L290 TraceCheckUtils]: 168: Hoare triple {73315#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {73315#false} is VALID [2022-04-08 15:14:38,162 INFO L290 TraceCheckUtils]: 169: Hoare triple {73315#false} assume 5 == ~blastFlag~0; {73315#false} is VALID [2022-04-08 15:14:38,162 INFO L290 TraceCheckUtils]: 170: Hoare triple {73315#false} assume !false; {73315#false} is VALID [2022-04-08 15:14:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-04-08 15:14:38,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:38,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544119884] [2022-04-08 15:14:38,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544119884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:38,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:38,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:38,163 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:38,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [529613698] [2022-04-08 15:14:38,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [529613698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:38,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:38,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:38,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473943782] [2022-04-08 15:14:38,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:38,164 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 171 [2022-04-08 15:14:38,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:38,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:38,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:38,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:38,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:38,268 INFO L87 Difference]: Start difference. First operand 991 states and 1523 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:40,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:14:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:41,777 INFO L93 Difference]: Finished difference Result 2277 states and 3459 transitions. [2022-04-08 15:14:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:41,778 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 171 [2022-04-08 15:14:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-08 15:14:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-08 15:14:41,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 462 transitions. [2022-04-08 15:14:42,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:42,116 INFO L225 Difference]: With dead ends: 2277 [2022-04-08 15:14:42,116 INFO L226 Difference]: Without dead ends: 1302 [2022-04-08 15:14:42,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:14:42,118 INFO L913 BasicCegarLoop]: 230 mSDtfsCounter, 97 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:42,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 549 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 522 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:14:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2022-04-08 15:14:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 991. [2022-04-08 15:14:42,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:42,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.5354969574036512) internal successors, (1514), 986 states have internal predecessors, (1514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:42,156 INFO L74 IsIncluded]: Start isIncluded. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.5354969574036512) internal successors, (1514), 986 states have internal predecessors, (1514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:42,157 INFO L87 Difference]: Start difference. First operand 1302 states. Second operand has 991 states, 986 states have (on average 1.5354969574036512) internal successors, (1514), 986 states have internal predecessors, (1514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:42,205 INFO L93 Difference]: Finished difference Result 1302 states and 1951 transitions. [2022-04-08 15:14:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1951 transitions. [2022-04-08 15:14:42,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:42,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:42,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 986 states have (on average 1.5354969574036512) internal successors, (1514), 986 states have internal predecessors, (1514), 3 states have call successors, (3), 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 1302 states. [2022-04-08 15:14:42,209 INFO L87 Difference]: Start difference. First operand has 991 states, 986 states have (on average 1.5354969574036512) internal successors, (1514), 986 states have internal predecessors, (1514), 3 states have call successors, (3), 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 1302 states. [2022-04-08 15:14:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:42,258 INFO L93 Difference]: Finished difference Result 1302 states and 1951 transitions. [2022-04-08 15:14:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1951 transitions. [2022-04-08 15:14:42,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:42,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:42,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:42,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 986 states have (on average 1.5354969574036512) internal successors, (1514), 986 states have internal predecessors, (1514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1518 transitions. [2022-04-08 15:14:42,304 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1518 transitions. Word has length 171 [2022-04-08 15:14:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:42,304 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1518 transitions. [2022-04-08 15:14:42,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:42,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1518 transitions. [2022-04-08 15:14:43,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1518 edges. 1518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1518 transitions. [2022-04-08 15:14:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-04-08 15:14:43,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:43,587 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 5, 5, 4, 4, 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] [2022-04-08 15:14:43,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 15:14:43,587 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:43,587 INFO L85 PathProgramCache]: Analyzing trace with hash -176288678, now seen corresponding path program 1 times [2022-04-08 15:14:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:43,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724932107] [2022-04-08 15:14:58,646 WARN L232 SmtUtils]: Spent 8.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-08 15:15:05,861 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:05,862 INFO L85 PathProgramCache]: Analyzing trace with hash -176288678, now seen corresponding path program 2 times [2022-04-08 15:15:05,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:05,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900244945] [2022-04-08 15:15:05,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:05,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:06,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:15:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:06,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {82473#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {82466#true} is VALID [2022-04-08 15:15:06,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {82466#true} assume true; {82466#true} is VALID [2022-04-08 15:15:06,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82466#true} {82466#true} #593#return; {82466#true} is VALID [2022-04-08 15:15:06,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {82466#true} call ULTIMATE.init(); {82473#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:15:06,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {82473#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {82466#true} is VALID [2022-04-08 15:15:06,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {82466#true} assume true; {82466#true} is VALID [2022-04-08 15:15:06,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82466#true} {82466#true} #593#return; {82466#true} is VALID [2022-04-08 15:15:06,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {82466#true} call #t~ret158 := main(); {82466#true} is VALID [2022-04-08 15:15:06,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {82466#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; {82466#true} is VALID [2022-04-08 15:15:06,090 INFO L272 TraceCheckUtils]: 6: Hoare triple {82466#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {82466#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); {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {82466#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; {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {82466#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; {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {82466#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {82466#true} assume !false; {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {82466#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {82466#true} assume 12292 == #t~mem49;havoc #t~mem49; {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {82466#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; {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {82466#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {82466#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {82466#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {82466#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); {82466#true} is VALID [2022-04-08 15:15:06,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {82466#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {82466#true} assume !(0 == ~tmp___4~0); {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {82466#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); {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {82466#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); {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {82466#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {82466#true} ~skip~0 := 0; {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {82466#true} assume !false; {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {82466#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {82466#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {82466#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {82466#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {82466#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {82466#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {82466#true} assume 4368 == #t~mem54;havoc #t~mem54; {82466#true} is VALID [2022-04-08 15:15:06,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {82466#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; {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {82466#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {82466#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); {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {82466#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; {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {82466#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); {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {82466#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {82466#true} ~skip~0 := 0; {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {82466#true} assume !false; {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {82466#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 42: Hoare triple {82466#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 43: Hoare triple {82466#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {82466#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {82466#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {82466#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {82466#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {82466#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {82466#true} assume 4384 == #t~mem56;havoc #t~mem56; {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {82466#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {82466#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {82466#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 53: Hoare triple {82466#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 54: Hoare triple {82466#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 55: Hoare triple {82466#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); {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {82466#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {82466#true} ~skip~0 := 0; {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {82466#true} assume !false; {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {82466#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {82466#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {82466#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {82466#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {82466#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {82466#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 65: Hoare triple {82466#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {82466#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 67: Hoare triple {82466#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 68: Hoare triple {82466#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 69: Hoare triple {82466#true} assume 4400 == #t~mem58;havoc #t~mem58; {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 70: Hoare triple {82466#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); {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 71: Hoare triple {82466#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; {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 72: Hoare triple {82466#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 73: Hoare triple {82466#true} assume !(~ret~0 <= 0); {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 74: Hoare triple {82466#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 75: Hoare triple {82466#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); {82466#true} is VALID [2022-04-08 15:15:06,095 INFO L290 TraceCheckUtils]: 76: Hoare triple {82466#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 77: Hoare triple {82466#true} ~skip~0 := 0; {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 78: Hoare triple {82466#true} assume !false; {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 79: Hoare triple {82466#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 80: Hoare triple {82466#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 81: Hoare triple {82466#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 82: Hoare triple {82466#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 83: Hoare triple {82466#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 84: Hoare triple {82466#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 85: Hoare triple {82466#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 86: Hoare triple {82466#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 87: Hoare triple {82466#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 88: Hoare triple {82466#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 89: Hoare triple {82466#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,096 INFO L290 TraceCheckUtils]: 90: Hoare triple {82466#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {82466#true} is VALID [2022-04-08 15:15:06,097 INFO L290 TraceCheckUtils]: 91: Hoare triple {82466#true} assume 4416 == #t~mem60;havoc #t~mem60; {82466#true} is VALID [2022-04-08 15:15:06,097 INFO L290 TraceCheckUtils]: 92: Hoare triple {82466#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {82466#true} is VALID [2022-04-08 15:15:06,097 INFO L290 TraceCheckUtils]: 93: Hoare triple {82466#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {82466#true} is VALID [2022-04-08 15:15:06,098 INFO L290 TraceCheckUtils]: 94: Hoare triple {82466#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); {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:06,098 INFO L290 TraceCheckUtils]: 95: Hoare triple {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:06,098 INFO L290 TraceCheckUtils]: 96: Hoare triple {82471#(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); {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:06,099 INFO L290 TraceCheckUtils]: 97: Hoare triple {82471#(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; {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:06,099 INFO L290 TraceCheckUtils]: 98: Hoare triple {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:06,099 INFO L290 TraceCheckUtils]: 99: Hoare triple {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:06,100 INFO L290 TraceCheckUtils]: 100: Hoare triple {82471#(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); {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:06,100 INFO L290 TraceCheckUtils]: 101: Hoare triple {82471#(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); {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:06,100 INFO L290 TraceCheckUtils]: 102: Hoare triple {82471#(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); {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:06,100 INFO L290 TraceCheckUtils]: 103: Hoare triple {82471#(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); {82471#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:15:06,101 INFO L290 TraceCheckUtils]: 104: Hoare triple {82471#(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); {82472#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-08 15:15:06,101 INFO L290 TraceCheckUtils]: 105: Hoare triple {82472#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {82467#false} is VALID [2022-04-08 15:15:06,101 INFO L290 TraceCheckUtils]: 106: Hoare triple {82467#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,101 INFO L290 TraceCheckUtils]: 107: Hoare triple {82467#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {82467#false} is VALID [2022-04-08 15:15:06,101 INFO L290 TraceCheckUtils]: 108: Hoare triple {82467#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,101 INFO L290 TraceCheckUtils]: 109: Hoare triple {82467#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); {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 110: Hoare triple {82467#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 111: Hoare triple {82467#false} assume !(0 == ~tmp___4~0); {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 112: Hoare triple {82467#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); {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 113: Hoare triple {82467#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); {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 114: Hoare triple {82467#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 115: Hoare triple {82467#false} ~skip~0 := 0; {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 116: Hoare triple {82467#false} assume !false; {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 117: Hoare triple {82467#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); {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 118: Hoare triple {82467#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 119: Hoare triple {82467#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 120: Hoare triple {82467#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 121: Hoare triple {82467#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 122: Hoare triple {82467#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,102 INFO L290 TraceCheckUtils]: 123: Hoare triple {82467#false} assume 4368 == #t~mem54;havoc #t~mem54; {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 124: Hoare triple {82467#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; {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 125: Hoare triple {82467#false} assume !(0 == ~blastFlag~0); {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 126: Hoare triple {82467#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 127: Hoare triple {82467#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); {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 128: Hoare triple {82467#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; {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 129: Hoare triple {82467#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); {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 130: Hoare triple {82467#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 131: Hoare triple {82467#false} ~skip~0 := 0; {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 132: Hoare triple {82467#false} assume !false; {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 133: Hoare triple {82467#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); {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 134: Hoare triple {82467#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 135: Hoare triple {82467#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 136: Hoare triple {82467#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 137: Hoare triple {82467#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,103 INFO L290 TraceCheckUtils]: 138: Hoare triple {82467#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 139: Hoare triple {82467#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 140: Hoare triple {82467#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 141: Hoare triple {82467#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 142: Hoare triple {82467#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 143: Hoare triple {82467#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 144: Hoare triple {82467#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 145: Hoare triple {82467#false} assume 4416 == #t~mem60;havoc #t~mem60; {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 146: Hoare triple {82467#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 147: Hoare triple {82467#false} assume !(3 == ~blastFlag~0); {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 148: Hoare triple {82467#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); {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 149: Hoare triple {82467#false} assume !(0 == ~tmp___6~0); {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 150: Hoare triple {82467#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); {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 151: Hoare triple {82467#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {82467#false} is VALID [2022-04-08 15:15:06,104 INFO L290 TraceCheckUtils]: 152: Hoare triple {82467#false} ~skip~0 := 0; {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 153: Hoare triple {82467#false} assume !false; {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 154: Hoare triple {82467#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); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 155: Hoare triple {82467#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 156: Hoare triple {82467#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 157: Hoare triple {82467#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 158: Hoare triple {82467#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 159: Hoare triple {82467#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 160: Hoare triple {82467#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 161: Hoare triple {82467#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 162: Hoare triple {82467#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 163: Hoare triple {82467#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 164: Hoare triple {82467#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 165: Hoare triple {82467#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,105 INFO L290 TraceCheckUtils]: 166: Hoare triple {82467#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,106 INFO L290 TraceCheckUtils]: 167: Hoare triple {82467#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {82467#false} is VALID [2022-04-08 15:15:06,106 INFO L290 TraceCheckUtils]: 168: Hoare triple {82467#false} assume 4432 == #t~mem62;havoc #t~mem62; {82467#false} is VALID [2022-04-08 15:15:06,106 INFO L290 TraceCheckUtils]: 169: Hoare triple {82467#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {82467#false} is VALID [2022-04-08 15:15:06,106 INFO L290 TraceCheckUtils]: 170: Hoare triple {82467#false} assume 5 == ~blastFlag~0; {82467#false} is VALID [2022-04-08 15:15:06,106 INFO L290 TraceCheckUtils]: 171: Hoare triple {82467#false} assume !false; {82467#false} is VALID [2022-04-08 15:15:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-04-08 15:15:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:15:06,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900244945] [2022-04-08 15:15:06,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900244945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:06,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:06,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:06,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:15:06,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724932107] [2022-04-08 15:15:06,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724932107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:06,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:06,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:06,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599598737] [2022-04-08 15:15:06,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:15:06,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 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 172 [2022-04-08 15:15:06,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:15:06,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:06,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:06,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:15:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:06,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:15:06,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:15:06,187 INFO L87 Difference]: Start difference. First operand 991 states and 1518 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:08,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:15:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:09,413 INFO L93 Difference]: Finished difference Result 2354 states and 3552 transitions. [2022-04-08 15:15:09,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:15:09,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 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 172 [2022-04-08 15:15:09,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 15:15:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 15:15:09,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-08 15:15:09,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:09,819 INFO L225 Difference]: With dead ends: 2354 [2022-04-08 15:15:09,820 INFO L226 Difference]: Without dead ends: 1379 [2022-04-08 15:15:09,821 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:15:09,821 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 115 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:09,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:15:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-04-08 15:15:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 991. [2022-04-08 15:15:09,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:09,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1379 states. Second operand has 991 states, 986 states have (on average 1.5182555780933062) internal successors, (1497), 986 states have internal predecessors, (1497), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:09,866 INFO L74 IsIncluded]: Start isIncluded. First operand 1379 states. Second operand has 991 states, 986 states have (on average 1.5182555780933062) internal successors, (1497), 986 states have internal predecessors, (1497), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:09,867 INFO L87 Difference]: Start difference. First operand 1379 states. Second operand has 991 states, 986 states have (on average 1.5182555780933062) internal successors, (1497), 986 states have internal predecessors, (1497), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:09,921 INFO L93 Difference]: Finished difference Result 1379 states and 2037 transitions. [2022-04-08 15:15:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2037 transitions. [2022-04-08 15:15:09,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:09,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:09,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 986 states have (on average 1.5182555780933062) internal successors, (1497), 986 states have internal predecessors, (1497), 3 states have call successors, (3), 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 1379 states. [2022-04-08 15:15:09,924 INFO L87 Difference]: Start difference. First operand has 991 states, 986 states have (on average 1.5182555780933062) internal successors, (1497), 986 states have internal predecessors, (1497), 3 states have call successors, (3), 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 1379 states. [2022-04-08 15:15:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:09,978 INFO L93 Difference]: Finished difference Result 1379 states and 2037 transitions. [2022-04-08 15:15:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2037 transitions. [2022-04-08 15:15:09,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:09,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:09,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:09,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 986 states have (on average 1.5182555780933062) internal successors, (1497), 986 states have internal predecessors, (1497), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1501 transitions. [2022-04-08 15:15:10,026 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1501 transitions. Word has length 172 [2022-04-08 15:15:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:10,026 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1501 transitions. [2022-04-08 15:15:10,026 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:10,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1501 transitions. [2022-04-08 15:15:11,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1501 edges. 1501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1501 transitions. [2022-04-08 15:15:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-04-08 15:15:11,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:11,360 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:15:11,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 15:15:11,360 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1301764362, now seen corresponding path program 1 times [2022-04-08 15:15:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:11,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950724924] [2022-04-08 15:15:35,433 WARN L232 SmtUtils]: Spent 18.28s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:15:44,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1301764362, now seen corresponding path program 2 times [2022-04-08 15:15:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:44,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836947556] [2022-04-08 15:15:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:15:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:44,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {91933#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {91926#true} is VALID [2022-04-08 15:15:44,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {91926#true} assume true; {91926#true} is VALID [2022-04-08 15:15:44,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91926#true} {91926#true} #593#return; {91926#true} is VALID [2022-04-08 15:15:44,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {91926#true} call ULTIMATE.init(); {91933#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:15:44,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {91933#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {91926#true} is VALID [2022-04-08 15:15:44,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {91926#true} assume true; {91926#true} is VALID [2022-04-08 15:15:44,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91926#true} {91926#true} #593#return; {91926#true} is VALID [2022-04-08 15:15:44,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {91926#true} call #t~ret158 := main(); {91926#true} is VALID [2022-04-08 15:15:44,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {91926#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; {91926#true} is VALID [2022-04-08 15:15:44,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {91926#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {91926#true} is VALID [2022-04-08 15:15:44,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {91926#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); {91926#true} is VALID [2022-04-08 15:15:44,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {91926#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; {91926#true} is VALID [2022-04-08 15:15:44,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {91926#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; {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {91926#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {91926#true} assume !false; {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {91926#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {91926#true} assume 12292 == #t~mem49;havoc #t~mem49; {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {91926#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; {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {91926#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {91926#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {91926#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {91926#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); {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {91926#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {91926#true} assume !(0 == ~tmp___4~0); {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {91926#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); {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {91926#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); {91926#true} is VALID [2022-04-08 15:15:44,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {91926#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {91926#true} ~skip~0 := 0; {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {91926#true} assume !false; {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {91926#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {91926#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {91926#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {91926#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {91926#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {91926#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {91926#true} assume 4368 == #t~mem54;havoc #t~mem54; {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {91926#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; {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {91926#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {91926#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); {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {91926#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; {91926#true} is VALID [2022-04-08 15:15:44,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {91926#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); {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {91926#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {91926#true} ~skip~0 := 0; {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {91926#true} assume !false; {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {91926#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {91926#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {91926#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {91926#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {91926#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {91926#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {91926#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {91926#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {91926#true} assume 4384 == #t~mem56;havoc #t~mem56; {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 50: Hoare triple {91926#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {91926#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {91926#true} is VALID [2022-04-08 15:15:44,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {91926#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {91926#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 54: Hoare triple {91926#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {91926#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); {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {91926#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {91926#true} ~skip~0 := 0; {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {91926#true} assume !false; {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 59: Hoare triple {91926#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 60: Hoare triple {91926#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {91926#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {91926#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 63: Hoare triple {91926#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 64: Hoare triple {91926#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {91926#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {91926#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 67: Hoare triple {91926#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {91926#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {91926#true} assume 4400 == #t~mem58;havoc #t~mem58; {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {91926#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); {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 71: Hoare triple {91926#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; {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 72: Hoare triple {91926#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 73: Hoare triple {91926#true} assume !(~ret~0 <= 0); {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {91926#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {91926#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); {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {91926#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {91926#true} ~skip~0 := 0; {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 78: Hoare triple {91926#true} assume !false; {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 79: Hoare triple {91926#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,331 INFO L290 TraceCheckUtils]: 80: Hoare triple {91926#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 81: Hoare triple {91926#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 82: Hoare triple {91926#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 83: Hoare triple {91926#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 84: Hoare triple {91926#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 85: Hoare triple {91926#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 86: Hoare triple {91926#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 87: Hoare triple {91926#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 88: Hoare triple {91926#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 89: Hoare triple {91926#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 90: Hoare triple {91926#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 91: Hoare triple {91926#true} assume 4416 == #t~mem60;havoc #t~mem60; {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 92: Hoare triple {91926#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {91926#true} is VALID [2022-04-08 15:15:44,332 INFO L290 TraceCheckUtils]: 93: Hoare triple {91926#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {91926#true} is VALID [2022-04-08 15:15:44,333 INFO L290 TraceCheckUtils]: 94: Hoare triple {91926#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); {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,334 INFO L290 TraceCheckUtils]: 95: Hoare triple {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,334 INFO L290 TraceCheckUtils]: 96: Hoare triple {91931#(= 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); {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,334 INFO L290 TraceCheckUtils]: 97: Hoare triple {91931#(= 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; {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,335 INFO L290 TraceCheckUtils]: 98: Hoare triple {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,335 INFO L290 TraceCheckUtils]: 99: Hoare triple {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,335 INFO L290 TraceCheckUtils]: 100: Hoare triple {91931#(= 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); {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,336 INFO L290 TraceCheckUtils]: 101: Hoare triple {91931#(= 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); {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,336 INFO L290 TraceCheckUtils]: 102: Hoare triple {91931#(= 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); {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,336 INFO L290 TraceCheckUtils]: 103: Hoare triple {91931#(= 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); {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,336 INFO L290 TraceCheckUtils]: 104: Hoare triple {91931#(= 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); {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,337 INFO L290 TraceCheckUtils]: 105: Hoare triple {91931#(= 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); {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,337 INFO L290 TraceCheckUtils]: 106: Hoare triple {91931#(= 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); {91931#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:15:44,337 INFO L290 TraceCheckUtils]: 107: Hoare triple {91931#(= 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); {91932#(= |ssl3_connect_#t~mem56| 4432)} is VALID [2022-04-08 15:15:44,338 INFO L290 TraceCheckUtils]: 108: Hoare triple {91932#(= |ssl3_connect_#t~mem56| 4432)} assume 4384 == #t~mem56;havoc #t~mem56; {91927#false} is VALID [2022-04-08 15:15:44,338 INFO L290 TraceCheckUtils]: 109: Hoare triple {91927#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {91927#false} is VALID [2022-04-08 15:15:44,338 INFO L290 TraceCheckUtils]: 110: Hoare triple {91927#false} assume !(1 == ~blastFlag~0); {91927#false} is VALID [2022-04-08 15:15:44,338 INFO L290 TraceCheckUtils]: 111: Hoare triple {91927#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,338 INFO L290 TraceCheckUtils]: 112: Hoare triple {91927#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,338 INFO L290 TraceCheckUtils]: 113: Hoare triple {91927#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,338 INFO L290 TraceCheckUtils]: 114: Hoare triple {91927#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); {91927#false} is VALID [2022-04-08 15:15:44,338 INFO L290 TraceCheckUtils]: 115: Hoare triple {91927#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {91927#false} is VALID [2022-04-08 15:15:44,338 INFO L290 TraceCheckUtils]: 116: Hoare triple {91927#false} ~skip~0 := 0; {91927#false} is VALID [2022-04-08 15:15:44,338 INFO L290 TraceCheckUtils]: 117: Hoare triple {91927#false} assume !false; {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 118: Hoare triple {91927#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); {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 119: Hoare triple {91927#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 120: Hoare triple {91927#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 121: Hoare triple {91927#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 122: Hoare triple {91927#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 123: Hoare triple {91927#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 124: Hoare triple {91927#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 125: Hoare triple {91927#false} assume 4369 == #t~mem55;havoc #t~mem55; {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 126: Hoare triple {91927#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; {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 127: Hoare triple {91927#false} assume !(0 == ~blastFlag~0); {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 128: Hoare triple {91927#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 129: Hoare triple {91927#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); {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 130: Hoare triple {91927#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; {91927#false} is VALID [2022-04-08 15:15:44,339 INFO L290 TraceCheckUtils]: 131: Hoare triple {91927#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); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 132: Hoare triple {91927#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 133: Hoare triple {91927#false} ~skip~0 := 0; {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 134: Hoare triple {91927#false} assume !false; {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 135: Hoare triple {91927#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); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 136: Hoare triple {91927#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 137: Hoare triple {91927#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 138: Hoare triple {91927#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 139: Hoare triple {91927#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 140: Hoare triple {91927#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 141: Hoare triple {91927#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 142: Hoare triple {91927#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 143: Hoare triple {91927#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 144: Hoare triple {91927#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 145: Hoare triple {91927#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,340 INFO L290 TraceCheckUtils]: 146: Hoare triple {91927#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 147: Hoare triple {91927#false} assume 4416 == #t~mem60;havoc #t~mem60; {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 148: Hoare triple {91927#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 149: Hoare triple {91927#false} assume !(3 == ~blastFlag~0); {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 150: Hoare triple {91927#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); {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 151: Hoare triple {91927#false} assume !(0 == ~tmp___6~0); {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 152: Hoare triple {91927#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); {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 153: Hoare triple {91927#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 154: Hoare triple {91927#false} ~skip~0 := 0; {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 155: Hoare triple {91927#false} assume !false; {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 156: Hoare triple {91927#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); {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 157: Hoare triple {91927#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 158: Hoare triple {91927#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 159: Hoare triple {91927#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,341 INFO L290 TraceCheckUtils]: 160: Hoare triple {91927#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 161: Hoare triple {91927#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 162: Hoare triple {91927#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 163: Hoare triple {91927#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 164: Hoare triple {91927#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 165: Hoare triple {91927#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 166: Hoare triple {91927#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 167: Hoare triple {91927#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 168: Hoare triple {91927#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 169: Hoare triple {91927#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 170: Hoare triple {91927#false} assume 4432 == #t~mem62;havoc #t~mem62; {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 171: Hoare triple {91927#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 172: Hoare triple {91927#false} assume 5 == ~blastFlag~0; {91927#false} is VALID [2022-04-08 15:15:44,342 INFO L290 TraceCheckUtils]: 173: Hoare triple {91927#false} assume !false; {91927#false} is VALID [2022-04-08 15:15:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-04-08 15:15:44,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:15:44,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836947556] [2022-04-08 15:15:44,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836947556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:44,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:44,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:44,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:15:44,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950724924] [2022-04-08 15:15:44,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950724924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:44,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:44,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:15:44,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032940008] [2022-04-08 15:15:44,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:15:44,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 174 [2022-04-08 15:15:44,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:15:44,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:44,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:44,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:15:44,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:44,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:15:44,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:15:44,424 INFO L87 Difference]: Start difference. First operand 991 states and 1501 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:46,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:15:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:47,856 INFO L93 Difference]: Finished difference Result 2232 states and 3360 transitions. [2022-04-08 15:15:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:15:47,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 174 [2022-04-08 15:15:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-08 15:15:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-08 15:15:47,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-08 15:15:48,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:48,178 INFO L225 Difference]: With dead ends: 2232 [2022-04-08 15:15:48,178 INFO L226 Difference]: Without dead ends: 1257 [2022-04-08 15:15:48,180 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:15:48,180 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 84 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:48,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 533 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 498 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:15:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2022-04-08 15:15:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 991. [2022-04-08 15:15:48,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:48,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1257 states. Second operand has 991 states, 986 states have (on average 1.513184584178499) internal successors, (1492), 986 states have internal predecessors, (1492), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:48,227 INFO L74 IsIncluded]: Start isIncluded. First operand 1257 states. Second operand has 991 states, 986 states have (on average 1.513184584178499) internal successors, (1492), 986 states have internal predecessors, (1492), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:48,228 INFO L87 Difference]: Start difference. First operand 1257 states. Second operand has 991 states, 986 states have (on average 1.513184584178499) internal successors, (1492), 986 states have internal predecessors, (1492), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:48,273 INFO L93 Difference]: Finished difference Result 1257 states and 1874 transitions. [2022-04-08 15:15:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1874 transitions. [2022-04-08 15:15:48,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:48,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:48,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 986 states have (on average 1.513184584178499) internal successors, (1492), 986 states have internal predecessors, (1492), 3 states have call successors, (3), 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 1257 states. [2022-04-08 15:15:48,276 INFO L87 Difference]: Start difference. First operand has 991 states, 986 states have (on average 1.513184584178499) internal successors, (1492), 986 states have internal predecessors, (1492), 3 states have call successors, (3), 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 1257 states. [2022-04-08 15:15:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:48,322 INFO L93 Difference]: Finished difference Result 1257 states and 1874 transitions. [2022-04-08 15:15:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1874 transitions. [2022-04-08 15:15:48,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:48,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:48,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:48,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 986 states have (on average 1.513184584178499) internal successors, (1492), 986 states have internal predecessors, (1492), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1496 transitions. [2022-04-08 15:15:48,368 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1496 transitions. Word has length 174 [2022-04-08 15:15:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:48,369 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1496 transitions. [2022-04-08 15:15:48,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:48,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1496 transitions. [2022-04-08 15:15:49,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1496 edges. 1496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1496 transitions. [2022-04-08 15:15:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-04-08 15:15:49,676 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:49,676 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:15:49,676 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 15:15:49,676 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1607849248, now seen corresponding path program 1 times [2022-04-08 15:15:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:49,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [949679337] [2022-04-08 15:16:04,269 WARN L232 SmtUtils]: Spent 8.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-08 15:16:12,317 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:16:12,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1607849248, now seen corresponding path program 2 times [2022-04-08 15:16:12,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:16:12,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069453145] [2022-04-08 15:16:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:16:12,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:16:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:16:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:16:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:16:12,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {100905#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {100898#true} is VALID [2022-04-08 15:16:12,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {100898#true} assume true; {100898#true} is VALID [2022-04-08 15:16:12,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100898#true} {100898#true} #593#return; {100898#true} is VALID [2022-04-08 15:16:12,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {100898#true} call ULTIMATE.init(); {100905#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:16:12,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {100905#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {100898#true} is VALID [2022-04-08 15:16:12,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {100898#true} assume true; {100898#true} is VALID [2022-04-08 15:16:12,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100898#true} {100898#true} #593#return; {100898#true} is VALID [2022-04-08 15:16:12,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {100898#true} call #t~ret158 := main(); {100898#true} is VALID [2022-04-08 15:16:12,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {100898#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; {100898#true} is VALID [2022-04-08 15:16:12,532 INFO L272 TraceCheckUtils]: 6: Hoare triple {100898#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {100898#true} is VALID [2022-04-08 15:16:12,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {100898#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); {100898#true} is VALID [2022-04-08 15:16:12,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {100898#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; {100898#true} is VALID [2022-04-08 15:16:12,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {100898#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; {100898#true} is VALID [2022-04-08 15:16:12,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {100898#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {100898#true} is VALID [2022-04-08 15:16:12,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {100898#true} assume !false; {100898#true} is VALID [2022-04-08 15:16:12,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {100898#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {100898#true} assume 12292 == #t~mem49;havoc #t~mem49; {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {100898#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; {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {100898#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {100898#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {100898#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {100898#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); {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {100898#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {100898#true} assume !(0 == ~tmp___4~0); {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {100898#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); {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {100898#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); {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {100898#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {100898#true} ~skip~0 := 0; {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {100898#true} assume !false; {100898#true} is VALID [2022-04-08 15:16:12,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {100898#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {100898#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {100898#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {100898#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {100898#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {100898#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {100898#true} assume 4368 == #t~mem54;havoc #t~mem54; {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {100898#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; {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {100898#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {100898#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); {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {100898#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; {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {100898#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); {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {100898#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {100898#true} ~skip~0 := 0; {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {100898#true} assume !false; {100898#true} is VALID [2022-04-08 15:16:12,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {100898#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {100898#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {100898#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {100898#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 45: Hoare triple {100898#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {100898#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {100898#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {100898#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {100898#true} assume 4384 == #t~mem56;havoc #t~mem56; {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {100898#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {100898#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {100898#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {100898#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {100898#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 55: Hoare triple {100898#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); {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {100898#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 57: Hoare triple {100898#true} ~skip~0 := 0; {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 58: Hoare triple {100898#true} assume !false; {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 59: Hoare triple {100898#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 60: Hoare triple {100898#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 61: Hoare triple {100898#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 62: Hoare triple {100898#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {100898#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 64: Hoare triple {100898#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 65: Hoare triple {100898#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 66: Hoare triple {100898#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 67: Hoare triple {100898#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,538 INFO L290 TraceCheckUtils]: 68: Hoare triple {100898#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 69: Hoare triple {100898#true} assume 4400 == #t~mem58;havoc #t~mem58; {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 70: Hoare triple {100898#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); {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 71: Hoare triple {100898#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; {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 72: Hoare triple {100898#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 73: Hoare triple {100898#true} assume !(~ret~0 <= 0); {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 74: Hoare triple {100898#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 75: Hoare triple {100898#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); {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 76: Hoare triple {100898#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 77: Hoare triple {100898#true} ~skip~0 := 0; {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 78: Hoare triple {100898#true} assume !false; {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 79: Hoare triple {100898#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 80: Hoare triple {100898#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 81: Hoare triple {100898#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,539 INFO L290 TraceCheckUtils]: 82: Hoare triple {100898#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,540 INFO L290 TraceCheckUtils]: 83: Hoare triple {100898#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,540 INFO L290 TraceCheckUtils]: 84: Hoare triple {100898#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,540 INFO L290 TraceCheckUtils]: 85: Hoare triple {100898#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,540 INFO L290 TraceCheckUtils]: 86: Hoare triple {100898#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,540 INFO L290 TraceCheckUtils]: 87: Hoare triple {100898#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,540 INFO L290 TraceCheckUtils]: 88: Hoare triple {100898#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,540 INFO L290 TraceCheckUtils]: 89: Hoare triple {100898#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,540 INFO L290 TraceCheckUtils]: 90: Hoare triple {100898#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {100898#true} is VALID [2022-04-08 15:16:12,540 INFO L290 TraceCheckUtils]: 91: Hoare triple {100898#true} assume 4416 == #t~mem60;havoc #t~mem60; {100898#true} is VALID [2022-04-08 15:16:12,540 INFO L290 TraceCheckUtils]: 92: Hoare triple {100898#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {100898#true} is VALID [2022-04-08 15:16:12,540 INFO L290 TraceCheckUtils]: 93: Hoare triple {100898#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {100898#true} is VALID [2022-04-08 15:16:12,541 INFO L290 TraceCheckUtils]: 94: Hoare triple {100898#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); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,541 INFO L290 TraceCheckUtils]: 95: Hoare triple {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,542 INFO L290 TraceCheckUtils]: 96: Hoare triple {100903#(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); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,542 INFO L290 TraceCheckUtils]: 97: Hoare triple {100903#(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; {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,543 INFO L290 TraceCheckUtils]: 98: Hoare triple {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,543 INFO L290 TraceCheckUtils]: 99: Hoare triple {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,543 INFO L290 TraceCheckUtils]: 100: Hoare triple {100903#(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); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,544 INFO L290 TraceCheckUtils]: 101: Hoare triple {100903#(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); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,544 INFO L290 TraceCheckUtils]: 102: Hoare triple {100903#(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); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,544 INFO L290 TraceCheckUtils]: 103: Hoare triple {100903#(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); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,545 INFO L290 TraceCheckUtils]: 104: Hoare triple {100903#(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); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,545 INFO L290 TraceCheckUtils]: 105: Hoare triple {100903#(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); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,545 INFO L290 TraceCheckUtils]: 106: Hoare triple {100903#(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); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,546 INFO L290 TraceCheckUtils]: 107: Hoare triple {100903#(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); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,546 INFO L290 TraceCheckUtils]: 108: Hoare triple {100903#(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); {100903#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:12,546 INFO L290 TraceCheckUtils]: 109: Hoare triple {100903#(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); {100904#(not (= |ssl3_connect_#t~mem58| 4400))} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 110: Hoare triple {100904#(not (= |ssl3_connect_#t~mem58| 4400))} assume 4400 == #t~mem58;havoc #t~mem58; {100899#false} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 111: Hoare triple {100899#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); {100899#false} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 112: Hoare triple {100899#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;~skip~0 := 1; {100899#false} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 113: Hoare triple {100899#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 114: Hoare triple {100899#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); {100899#false} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 115: Hoare triple {100899#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100899#false} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 116: Hoare triple {100899#false} ~skip~0 := 0; {100899#false} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 117: Hoare triple {100899#false} assume !false; {100899#false} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 118: Hoare triple {100899#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); {100899#false} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 119: Hoare triple {100899#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 120: Hoare triple {100899#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,547 INFO L290 TraceCheckUtils]: 121: Hoare triple {100899#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 122: Hoare triple {100899#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 123: Hoare triple {100899#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 124: Hoare triple {100899#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 125: Hoare triple {100899#false} assume 4369 == #t~mem55;havoc #t~mem55; {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 126: Hoare triple {100899#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; {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 127: Hoare triple {100899#false} assume !(0 == ~blastFlag~0); {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 128: Hoare triple {100899#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 129: Hoare triple {100899#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); {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 130: Hoare triple {100899#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; {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 131: Hoare triple {100899#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); {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 132: Hoare triple {100899#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 133: Hoare triple {100899#false} ~skip~0 := 0; {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 134: Hoare triple {100899#false} assume !false; {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 135: Hoare triple {100899#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); {100899#false} is VALID [2022-04-08 15:16:12,548 INFO L290 TraceCheckUtils]: 136: Hoare triple {100899#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 137: Hoare triple {100899#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 138: Hoare triple {100899#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 139: Hoare triple {100899#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 140: Hoare triple {100899#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 141: Hoare triple {100899#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 142: Hoare triple {100899#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 143: Hoare triple {100899#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 144: Hoare triple {100899#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 145: Hoare triple {100899#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 146: Hoare triple {100899#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 147: Hoare triple {100899#false} assume 4416 == #t~mem60;havoc #t~mem60; {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 148: Hoare triple {100899#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 149: Hoare triple {100899#false} assume !(3 == ~blastFlag~0); {100899#false} is VALID [2022-04-08 15:16:12,549 INFO L290 TraceCheckUtils]: 150: Hoare triple {100899#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); {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 151: Hoare triple {100899#false} assume !(0 == ~tmp___6~0); {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 152: Hoare triple {100899#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); {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 153: Hoare triple {100899#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 154: Hoare triple {100899#false} ~skip~0 := 0; {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 155: Hoare triple {100899#false} assume !false; {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 156: Hoare triple {100899#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); {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 157: Hoare triple {100899#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 158: Hoare triple {100899#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 159: Hoare triple {100899#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 160: Hoare triple {100899#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 161: Hoare triple {100899#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 162: Hoare triple {100899#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 163: Hoare triple {100899#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,550 INFO L290 TraceCheckUtils]: 164: Hoare triple {100899#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,551 INFO L290 TraceCheckUtils]: 165: Hoare triple {100899#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,551 INFO L290 TraceCheckUtils]: 166: Hoare triple {100899#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,551 INFO L290 TraceCheckUtils]: 167: Hoare triple {100899#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,551 INFO L290 TraceCheckUtils]: 168: Hoare triple {100899#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,551 INFO L290 TraceCheckUtils]: 169: Hoare triple {100899#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {100899#false} is VALID [2022-04-08 15:16:12,551 INFO L290 TraceCheckUtils]: 170: Hoare triple {100899#false} assume 4432 == #t~mem62;havoc #t~mem62; {100899#false} is VALID [2022-04-08 15:16:12,551 INFO L290 TraceCheckUtils]: 171: Hoare triple {100899#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100899#false} is VALID [2022-04-08 15:16:12,551 INFO L290 TraceCheckUtils]: 172: Hoare triple {100899#false} assume 5 == ~blastFlag~0; {100899#false} is VALID [2022-04-08 15:16:12,551 INFO L290 TraceCheckUtils]: 173: Hoare triple {100899#false} assume !false; {100899#false} is VALID [2022-04-08 15:16:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-04-08 15:16:12,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:16:12,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069453145] [2022-04-08 15:16:12,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069453145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:16:12,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:16:12,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:16:12,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:16:12,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [949679337] [2022-04-08 15:16:12,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [949679337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:16:12,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:16:12,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:16:12,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276194736] [2022-04-08 15:16:12,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:16:12,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 174 [2022-04-08 15:16:12,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:16:12,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:12,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:12,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:16:12,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:16:12,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:16:12,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:16:12,653 INFO L87 Difference]: Start difference. First operand 991 states and 1496 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:14,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:16:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:15,885 INFO L93 Difference]: Finished difference Result 2484 states and 3718 transitions. [2022-04-08 15:16:15,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:16:15,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 174 [2022-04-08 15:16:15,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:16:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 15:16:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 15:16:15,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-08 15:16:16,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:16,273 INFO L225 Difference]: With dead ends: 2484 [2022-04-08 15:16:16,273 INFO L226 Difference]: Without dead ends: 1509 [2022-04-08 15:16:16,274 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:16:16,275 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 109 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:16:16,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 284 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:16:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2022-04-08 15:16:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1096. [2022-04-08 15:16:16,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:16:16,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1509 states. Second operand has 1096 states, 1091 states have (on average 1.5132905591200734) internal successors, (1651), 1091 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:16,349 INFO L74 IsIncluded]: Start isIncluded. First operand 1509 states. Second operand has 1096 states, 1091 states have (on average 1.5132905591200734) internal successors, (1651), 1091 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:16,350 INFO L87 Difference]: Start difference. First operand 1509 states. Second operand has 1096 states, 1091 states have (on average 1.5132905591200734) internal successors, (1651), 1091 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:16,412 INFO L93 Difference]: Finished difference Result 1509 states and 2231 transitions. [2022-04-08 15:16:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2231 transitions. [2022-04-08 15:16:16,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:16:16,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:16:16,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 1096 states, 1091 states have (on average 1.5132905591200734) internal successors, (1651), 1091 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 1509 states. [2022-04-08 15:16:16,416 INFO L87 Difference]: Start difference. First operand has 1096 states, 1091 states have (on average 1.5132905591200734) internal successors, (1651), 1091 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 1509 states. [2022-04-08 15:16:16,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:16,479 INFO L93 Difference]: Finished difference Result 1509 states and 2231 transitions. [2022-04-08 15:16:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2231 transitions. [2022-04-08 15:16:16,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:16:16,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:16:16,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:16:16,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:16:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1091 states have (on average 1.5132905591200734) internal successors, (1651), 1091 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1655 transitions. [2022-04-08 15:16:16,536 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1655 transitions. Word has length 174 [2022-04-08 15:16:16,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:16:16,536 INFO L478 AbstractCegarLoop]: Abstraction has 1096 states and 1655 transitions. [2022-04-08 15:16:16,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:16,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1096 states and 1655 transitions. [2022-04-08 15:16:17,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1655 edges. 1655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1655 transitions. [2022-04-08 15:16:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-08 15:16:17,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:16:17,900 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 5, 4, 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] [2022-04-08 15:16:17,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 15:16:17,900 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:16:17,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:16:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash 30823655, now seen corresponding path program 1 times [2022-04-08 15:16:17,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:16:17,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [698831081] [2022-04-08 15:16:36,170 WARN L232 SmtUtils]: Spent 12.76s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:16:42,810 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:16:42,810 INFO L85 PathProgramCache]: Analyzing trace with hash 30823655, now seen corresponding path program 2 times [2022-04-08 15:16:42,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:16:42,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865907459] [2022-04-08 15:16:42,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:16:42,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:16:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:16:42,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:16:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:16:42,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {111095#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {111088#true} is VALID [2022-04-08 15:16:42,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {111088#true} assume true; {111088#true} is VALID [2022-04-08 15:16:42,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111088#true} {111088#true} #593#return; {111088#true} is VALID [2022-04-08 15:16:42,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {111088#true} call ULTIMATE.init(); {111095#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:16:42,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {111095#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {111088#true} assume true; {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111088#true} {111088#true} #593#return; {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {111088#true} call #t~ret158 := main(); {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {111088#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; {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {111088#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {111088#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); {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {111088#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; {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {111088#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; {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {111088#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {111088#true} assume !false; {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {111088#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {111088#true} assume 12292 == #t~mem49;havoc #t~mem49; {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {111088#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; {111088#true} is VALID [2022-04-08 15:16:42,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {111088#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {111088#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {111088#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {111088#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); {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {111088#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {111088#true} assume !(0 == ~tmp___4~0); {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {111088#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); {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {111088#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); {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {111088#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {111088#true} ~skip~0 := 0; {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {111088#true} assume !false; {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {111088#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {111088#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {111088#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {111088#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {111088#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {111088#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {111088#true} assume 4368 == #t~mem54;havoc #t~mem54; {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {111088#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; {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {111088#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {111088#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); {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {111088#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; {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {111088#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); {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {111088#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {111088#true} ~skip~0 := 0; {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {111088#true} assume !false; {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {111088#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {111088#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {111088#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 44: Hoare triple {111088#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {111088#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {111088#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {111088#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {111088#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {111088#true} assume 4384 == #t~mem56;havoc #t~mem56; {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {111088#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {111088#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 52: Hoare triple {111088#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 53: Hoare triple {111088#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 54: Hoare triple {111088#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 55: Hoare triple {111088#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); {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 56: Hoare triple {111088#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {111088#true} is VALID [2022-04-08 15:16:42,985 INFO L290 TraceCheckUtils]: 57: Hoare triple {111088#true} ~skip~0 := 0; {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 58: Hoare triple {111088#true} assume !false; {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 59: Hoare triple {111088#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 60: Hoare triple {111088#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 61: Hoare triple {111088#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {111088#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 63: Hoare triple {111088#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 64: Hoare triple {111088#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 65: Hoare triple {111088#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 66: Hoare triple {111088#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 67: Hoare triple {111088#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 68: Hoare triple {111088#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 69: Hoare triple {111088#true} assume 4400 == #t~mem58;havoc #t~mem58; {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 70: Hoare triple {111088#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); {111088#true} is VALID [2022-04-08 15:16:42,986 INFO L290 TraceCheckUtils]: 71: Hoare triple {111088#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; {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 72: Hoare triple {111088#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 73: Hoare triple {111088#true} assume !(~ret~0 <= 0); {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 74: Hoare triple {111088#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 75: Hoare triple {111088#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); {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 76: Hoare triple {111088#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 77: Hoare triple {111088#true} ~skip~0 := 0; {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 78: Hoare triple {111088#true} assume !false; {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 79: Hoare triple {111088#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 80: Hoare triple {111088#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 81: Hoare triple {111088#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 82: Hoare triple {111088#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 83: Hoare triple {111088#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 84: Hoare triple {111088#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,987 INFO L290 TraceCheckUtils]: 85: Hoare triple {111088#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,988 INFO L290 TraceCheckUtils]: 86: Hoare triple {111088#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,988 INFO L290 TraceCheckUtils]: 87: Hoare triple {111088#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,988 INFO L290 TraceCheckUtils]: 88: Hoare triple {111088#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,988 INFO L290 TraceCheckUtils]: 89: Hoare triple {111088#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,988 INFO L290 TraceCheckUtils]: 90: Hoare triple {111088#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {111088#true} is VALID [2022-04-08 15:16:42,988 INFO L290 TraceCheckUtils]: 91: Hoare triple {111088#true} assume 4416 == #t~mem60;havoc #t~mem60; {111088#true} is VALID [2022-04-08 15:16:42,988 INFO L290 TraceCheckUtils]: 92: Hoare triple {111088#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {111088#true} is VALID [2022-04-08 15:16:42,988 INFO L290 TraceCheckUtils]: 93: Hoare triple {111088#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {111088#true} is VALID [2022-04-08 15:16:42,989 INFO L290 TraceCheckUtils]: 94: Hoare triple {111088#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); {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,989 INFO L290 TraceCheckUtils]: 95: Hoare triple {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,990 INFO L290 TraceCheckUtils]: 96: Hoare triple {111093#(not (= 4385 (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); {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,990 INFO L290 TraceCheckUtils]: 97: Hoare triple {111093#(not (= 4385 (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; {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,990 INFO L290 TraceCheckUtils]: 98: Hoare triple {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,991 INFO L290 TraceCheckUtils]: 99: Hoare triple {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,991 INFO L290 TraceCheckUtils]: 100: Hoare triple {111093#(not (= 4385 (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); {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,991 INFO L290 TraceCheckUtils]: 101: Hoare triple {111093#(not (= 4385 (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); {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,992 INFO L290 TraceCheckUtils]: 102: Hoare triple {111093#(not (= 4385 (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); {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,992 INFO L290 TraceCheckUtils]: 103: Hoare triple {111093#(not (= 4385 (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); {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,992 INFO L290 TraceCheckUtils]: 104: Hoare triple {111093#(not (= 4385 (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); {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,993 INFO L290 TraceCheckUtils]: 105: Hoare triple {111093#(not (= 4385 (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); {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,993 INFO L290 TraceCheckUtils]: 106: Hoare triple {111093#(not (= 4385 (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); {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,993 INFO L290 TraceCheckUtils]: 107: Hoare triple {111093#(not (= 4385 (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); {111093#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:16:42,994 INFO L290 TraceCheckUtils]: 108: Hoare triple {111093#(not (= 4385 (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); {111094#(not (= |ssl3_connect_#t~mem57| 4385))} is VALID [2022-04-08 15:16:42,994 INFO L290 TraceCheckUtils]: 109: Hoare triple {111094#(not (= |ssl3_connect_#t~mem57| 4385))} assume 4385 == #t~mem57;havoc #t~mem57; {111089#false} is VALID [2022-04-08 15:16:42,994 INFO L290 TraceCheckUtils]: 110: Hoare triple {111089#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {111089#false} is VALID [2022-04-08 15:16:42,994 INFO L290 TraceCheckUtils]: 111: Hoare triple {111089#false} assume !(1 == ~blastFlag~0); {111089#false} is VALID [2022-04-08 15:16:42,994 INFO L290 TraceCheckUtils]: 112: Hoare triple {111089#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,994 INFO L290 TraceCheckUtils]: 113: Hoare triple {111089#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,994 INFO L290 TraceCheckUtils]: 114: Hoare triple {111089#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,994 INFO L290 TraceCheckUtils]: 115: Hoare triple {111089#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); {111089#false} is VALID [2022-04-08 15:16:42,994 INFO L290 TraceCheckUtils]: 116: Hoare triple {111089#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 117: Hoare triple {111089#false} ~skip~0 := 0; {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 118: Hoare triple {111089#false} assume !false; {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 119: Hoare triple {111089#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); {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 120: Hoare triple {111089#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 121: Hoare triple {111089#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 122: Hoare triple {111089#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 123: Hoare triple {111089#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 124: Hoare triple {111089#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 125: Hoare triple {111089#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 126: Hoare triple {111089#false} assume 4369 == #t~mem55;havoc #t~mem55; {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 127: Hoare triple {111089#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; {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 128: Hoare triple {111089#false} assume !(0 == ~blastFlag~0); {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 129: Hoare triple {111089#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {111089#false} is VALID [2022-04-08 15:16:42,995 INFO L290 TraceCheckUtils]: 130: Hoare triple {111089#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); {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 131: Hoare triple {111089#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; {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 132: Hoare triple {111089#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); {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 133: Hoare triple {111089#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 134: Hoare triple {111089#false} ~skip~0 := 0; {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 135: Hoare triple {111089#false} assume !false; {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 136: Hoare triple {111089#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); {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 137: Hoare triple {111089#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 138: Hoare triple {111089#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 139: Hoare triple {111089#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 140: Hoare triple {111089#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 141: Hoare triple {111089#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 142: Hoare triple {111089#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 143: Hoare triple {111089#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,996 INFO L290 TraceCheckUtils]: 144: Hoare triple {111089#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 145: Hoare triple {111089#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 146: Hoare triple {111089#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 147: Hoare triple {111089#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 148: Hoare triple {111089#false} assume 4416 == #t~mem60;havoc #t~mem60; {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 149: Hoare triple {111089#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 150: Hoare triple {111089#false} assume !(3 == ~blastFlag~0); {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 151: Hoare triple {111089#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); {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 152: Hoare triple {111089#false} assume !(0 == ~tmp___6~0); {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 153: Hoare triple {111089#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); {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 154: Hoare triple {111089#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 155: Hoare triple {111089#false} ~skip~0 := 0; {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 156: Hoare triple {111089#false} assume !false; {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 157: Hoare triple {111089#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); {111089#false} is VALID [2022-04-08 15:16:42,997 INFO L290 TraceCheckUtils]: 158: Hoare triple {111089#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 159: Hoare triple {111089#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 160: Hoare triple {111089#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 161: Hoare triple {111089#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 162: Hoare triple {111089#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 163: Hoare triple {111089#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 164: Hoare triple {111089#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 165: Hoare triple {111089#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 166: Hoare triple {111089#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 167: Hoare triple {111089#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 168: Hoare triple {111089#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 169: Hoare triple {111089#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 170: Hoare triple {111089#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 171: Hoare triple {111089#false} assume 4432 == #t~mem62;havoc #t~mem62; {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 172: Hoare triple {111089#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {111089#false} is VALID [2022-04-08 15:16:42,998 INFO L290 TraceCheckUtils]: 173: Hoare triple {111089#false} assume 5 == ~blastFlag~0; {111089#false} is VALID [2022-04-08 15:16:42,999 INFO L290 TraceCheckUtils]: 174: Hoare triple {111089#false} assume !false; {111089#false} is VALID [2022-04-08 15:16:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-04-08 15:16:42,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:16:42,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865907459] [2022-04-08 15:16:42,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865907459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:16:42,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:16:42,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:16:43,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:16:43,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [698831081] [2022-04-08 15:16:43,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [698831081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:16:43,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:16:43,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:16:43,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100523961] [2022-04-08 15:16:43,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:16:43,000 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 175 [2022-04-08 15:16:43,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:16:43,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:43,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:43,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:16:43,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:16:43,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:16:43,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:16:43,079 INFO L87 Difference]: Start difference. First operand 1096 states and 1655 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:45,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:16:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:46,424 INFO L93 Difference]: Finished difference Result 2564 states and 3826 transitions. [2022-04-08 15:16:46,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:16:46,426 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 175 [2022-04-08 15:16:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:16:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 15:16:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 15:16:46,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-08 15:16:46,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:46,728 INFO L225 Difference]: With dead ends: 2564 [2022-04-08 15:16:46,728 INFO L226 Difference]: Without dead ends: 1484 [2022-04-08 15:16:46,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-08 15:16:46,730 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 110 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:16:46,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:16:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2022-04-08 15:16:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1096. [2022-04-08 15:16:46,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:16:46,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1484 states. Second operand has 1096 states, 1091 states have (on average 1.4986251145737854) internal successors, (1635), 1091 states have internal predecessors, (1635), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:46,806 INFO L74 IsIncluded]: Start isIncluded. First operand 1484 states. Second operand has 1096 states, 1091 states have (on average 1.4986251145737854) internal successors, (1635), 1091 states have internal predecessors, (1635), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:46,807 INFO L87 Difference]: Start difference. First operand 1484 states. Second operand has 1096 states, 1091 states have (on average 1.4986251145737854) internal successors, (1635), 1091 states have internal predecessors, (1635), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:46,869 INFO L93 Difference]: Finished difference Result 1484 states and 2175 transitions. [2022-04-08 15:16:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2175 transitions. [2022-04-08 15:16:46,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:16:46,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:16:46,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 1096 states, 1091 states have (on average 1.4986251145737854) internal successors, (1635), 1091 states have internal predecessors, (1635), 3 states have call successors, (3), 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 1484 states. [2022-04-08 15:16:46,872 INFO L87 Difference]: Start difference. First operand has 1096 states, 1091 states have (on average 1.4986251145737854) internal successors, (1635), 1091 states have internal predecessors, (1635), 3 states have call successors, (3), 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 1484 states. [2022-04-08 15:16:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:16:46,933 INFO L93 Difference]: Finished difference Result 1484 states and 2175 transitions. [2022-04-08 15:16:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2175 transitions. [2022-04-08 15:16:46,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:16:46,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:16:46,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:16:46,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:16:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1091 states have (on average 1.4986251145737854) internal successors, (1635), 1091 states have internal predecessors, (1635), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1639 transitions. [2022-04-08 15:16:46,989 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1639 transitions. Word has length 175 [2022-04-08 15:16:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:16:46,989 INFO L478 AbstractCegarLoop]: Abstraction has 1096 states and 1639 transitions. [2022-04-08 15:16:46,990 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:16:46,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1096 states and 1639 transitions. [2022-04-08 15:16:48,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1639 edges. 1639 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:16:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1639 transitions. [2022-04-08 15:16:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-08 15:16:48,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:16:48,264 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 4, 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, 1, 1, 1] [2022-04-08 15:16:48,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 15:16:48,264 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:16:48,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:16:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1359712797, now seen corresponding path program 1 times [2022-04-08 15:16:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:16:48,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1292777507] [2022-04-08 15:17:04,618 WARN L232 SmtUtils]: Spent 10.30s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:17:13,283 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:17:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1359712797, now seen corresponding path program 2 times [2022-04-08 15:17:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:17:13,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660330002] [2022-04-08 15:17:13,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:17:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:17:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:17:13,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:17:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:17:13,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {121395#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {121388#true} is VALID [2022-04-08 15:17:13,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {121388#true} assume true; {121388#true} is VALID [2022-04-08 15:17:13,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121388#true} {121388#true} #593#return; {121388#true} is VALID [2022-04-08 15:17:13,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {121388#true} call ULTIMATE.init(); {121395#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:17:13,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {121395#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {121388#true} is VALID [2022-04-08 15:17:13,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {121388#true} assume true; {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121388#true} {121388#true} #593#return; {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {121388#true} call #t~ret158 := main(); {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {121388#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; {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L272 TraceCheckUtils]: 6: Hoare triple {121388#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {121388#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); {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {121388#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; {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {121388#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; {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {121388#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {121388#true} assume !false; {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {121388#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {121388#true} assume 12292 == #t~mem49;havoc #t~mem49; {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {121388#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; {121388#true} is VALID [2022-04-08 15:17:13,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {121388#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {121388#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {121388#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {121388#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); {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {121388#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {121388#true} assume !(0 == ~tmp___4~0); {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {121388#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); {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {121388#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); {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {121388#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {121388#true} ~skip~0 := 0; {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {121388#true} assume !false; {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {121388#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {121388#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {121388#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {121388#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {121388#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {121388#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {121388#true} assume 4368 == #t~mem54;havoc #t~mem54; {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {121388#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; {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {121388#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {121388#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); {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {121388#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; {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {121388#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); {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {121388#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {121388#true} ~skip~0 := 0; {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {121388#true} assume !false; {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 41: Hoare triple {121388#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 42: Hoare triple {121388#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {121388#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {121388#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {121388#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 46: Hoare triple {121388#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 47: Hoare triple {121388#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 48: Hoare triple {121388#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {121388#true} assume 4384 == #t~mem56;havoc #t~mem56; {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {121388#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 51: Hoare triple {121388#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {121388#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {121388#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {121388#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {121388#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); {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {121388#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121388#true} is VALID [2022-04-08 15:17:13,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {121388#true} ~skip~0 := 0; {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {121388#true} assume !false; {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {121388#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 60: Hoare triple {121388#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {121388#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {121388#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 63: Hoare triple {121388#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 64: Hoare triple {121388#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 65: Hoare triple {121388#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 66: Hoare triple {121388#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 67: Hoare triple {121388#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 68: Hoare triple {121388#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 69: Hoare triple {121388#true} assume 4400 == #t~mem58;havoc #t~mem58; {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 70: Hoare triple {121388#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); {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 71: Hoare triple {121388#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; {121388#true} is VALID [2022-04-08 15:17:13,472 INFO L290 TraceCheckUtils]: 72: Hoare triple {121388#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 73: Hoare triple {121388#true} assume !(~ret~0 <= 0); {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 74: Hoare triple {121388#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 75: Hoare triple {121388#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); {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 76: Hoare triple {121388#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 77: Hoare triple {121388#true} ~skip~0 := 0; {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 78: Hoare triple {121388#true} assume !false; {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 79: Hoare triple {121388#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 80: Hoare triple {121388#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 81: Hoare triple {121388#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 82: Hoare triple {121388#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 83: Hoare triple {121388#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 84: Hoare triple {121388#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 85: Hoare triple {121388#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,473 INFO L290 TraceCheckUtils]: 86: Hoare triple {121388#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,474 INFO L290 TraceCheckUtils]: 87: Hoare triple {121388#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,474 INFO L290 TraceCheckUtils]: 88: Hoare triple {121388#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,474 INFO L290 TraceCheckUtils]: 89: Hoare triple {121388#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,474 INFO L290 TraceCheckUtils]: 90: Hoare triple {121388#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {121388#true} is VALID [2022-04-08 15:17:13,474 INFO L290 TraceCheckUtils]: 91: Hoare triple {121388#true} assume 4416 == #t~mem60;havoc #t~mem60; {121388#true} is VALID [2022-04-08 15:17:13,474 INFO L290 TraceCheckUtils]: 92: Hoare triple {121388#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {121388#true} is VALID [2022-04-08 15:17:13,474 INFO L290 TraceCheckUtils]: 93: Hoare triple {121388#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {121388#true} is VALID [2022-04-08 15:17:13,475 INFO L290 TraceCheckUtils]: 94: Hoare triple {121388#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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,475 INFO L290 TraceCheckUtils]: 95: Hoare triple {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,475 INFO L290 TraceCheckUtils]: 96: Hoare triple {121393#(= 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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,476 INFO L290 TraceCheckUtils]: 97: Hoare triple {121393#(= 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; {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,476 INFO L290 TraceCheckUtils]: 98: Hoare triple {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,476 INFO L290 TraceCheckUtils]: 99: Hoare triple {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,477 INFO L290 TraceCheckUtils]: 100: Hoare triple {121393#(= 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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,477 INFO L290 TraceCheckUtils]: 101: Hoare triple {121393#(= 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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,477 INFO L290 TraceCheckUtils]: 102: Hoare triple {121393#(= 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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,478 INFO L290 TraceCheckUtils]: 103: Hoare triple {121393#(= 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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,478 INFO L290 TraceCheckUtils]: 104: Hoare triple {121393#(= 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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,478 INFO L290 TraceCheckUtils]: 105: Hoare triple {121393#(= 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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,479 INFO L290 TraceCheckUtils]: 106: Hoare triple {121393#(= 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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,479 INFO L290 TraceCheckUtils]: 107: Hoare triple {121393#(= 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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,479 INFO L290 TraceCheckUtils]: 108: Hoare triple {121393#(= 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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,480 INFO L290 TraceCheckUtils]: 109: Hoare triple {121393#(= 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); {121393#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:13,480 INFO L290 TraceCheckUtils]: 110: Hoare triple {121393#(= 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); {121394#(= |ssl3_connect_#t~mem59| 4432)} is VALID [2022-04-08 15:17:13,480 INFO L290 TraceCheckUtils]: 111: Hoare triple {121394#(= |ssl3_connect_#t~mem59| 4432)} assume 4401 == #t~mem59;havoc #t~mem59; {121389#false} is VALID [2022-04-08 15:17:13,480 INFO L290 TraceCheckUtils]: 112: Hoare triple {121389#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); {121389#false} is VALID [2022-04-08 15:17:13,480 INFO L290 TraceCheckUtils]: 113: Hoare triple {121389#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;~skip~0 := 1; {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 114: Hoare triple {121389#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 115: Hoare triple {121389#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); {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 116: Hoare triple {121389#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 117: Hoare triple {121389#false} ~skip~0 := 0; {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 118: Hoare triple {121389#false} assume !false; {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 119: Hoare triple {121389#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); {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 120: Hoare triple {121389#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 121: Hoare triple {121389#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 122: Hoare triple {121389#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 123: Hoare triple {121389#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 124: Hoare triple {121389#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 125: Hoare triple {121389#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 126: Hoare triple {121389#false} assume 4369 == #t~mem55;havoc #t~mem55; {121389#false} is VALID [2022-04-08 15:17:13,481 INFO L290 TraceCheckUtils]: 127: Hoare triple {121389#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; {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 128: Hoare triple {121389#false} assume !(0 == ~blastFlag~0); {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 129: Hoare triple {121389#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 130: Hoare triple {121389#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); {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 131: Hoare triple {121389#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; {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 132: Hoare triple {121389#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); {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 133: Hoare triple {121389#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 134: Hoare triple {121389#false} ~skip~0 := 0; {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 135: Hoare triple {121389#false} assume !false; {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 136: Hoare triple {121389#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); {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 137: Hoare triple {121389#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 138: Hoare triple {121389#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 139: Hoare triple {121389#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 140: Hoare triple {121389#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,482 INFO L290 TraceCheckUtils]: 141: Hoare triple {121389#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 142: Hoare triple {121389#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 143: Hoare triple {121389#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 144: Hoare triple {121389#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 145: Hoare triple {121389#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 146: Hoare triple {121389#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 147: Hoare triple {121389#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 148: Hoare triple {121389#false} assume 4416 == #t~mem60;havoc #t~mem60; {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 149: Hoare triple {121389#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 150: Hoare triple {121389#false} assume !(3 == ~blastFlag~0); {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 151: Hoare triple {121389#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); {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 152: Hoare triple {121389#false} assume !(0 == ~tmp___6~0); {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 153: Hoare triple {121389#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); {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 154: Hoare triple {121389#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121389#false} is VALID [2022-04-08 15:17:13,483 INFO L290 TraceCheckUtils]: 155: Hoare triple {121389#false} ~skip~0 := 0; {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 156: Hoare triple {121389#false} assume !false; {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 157: Hoare triple {121389#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); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 158: Hoare triple {121389#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 159: Hoare triple {121389#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 160: Hoare triple {121389#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 161: Hoare triple {121389#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 162: Hoare triple {121389#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 163: Hoare triple {121389#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 164: Hoare triple {121389#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 165: Hoare triple {121389#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 166: Hoare triple {121389#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 167: Hoare triple {121389#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 168: Hoare triple {121389#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 169: Hoare triple {121389#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,484 INFO L290 TraceCheckUtils]: 170: Hoare triple {121389#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {121389#false} is VALID [2022-04-08 15:17:13,485 INFO L290 TraceCheckUtils]: 171: Hoare triple {121389#false} assume 4432 == #t~mem62;havoc #t~mem62; {121389#false} is VALID [2022-04-08 15:17:13,485 INFO L290 TraceCheckUtils]: 172: Hoare triple {121389#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {121389#false} is VALID [2022-04-08 15:17:13,485 INFO L290 TraceCheckUtils]: 173: Hoare triple {121389#false} assume 5 == ~blastFlag~0; {121389#false} is VALID [2022-04-08 15:17:13,485 INFO L290 TraceCheckUtils]: 174: Hoare triple {121389#false} assume !false; {121389#false} is VALID [2022-04-08 15:17:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-04-08 15:17:13,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:17:13,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660330002] [2022-04-08 15:17:13,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660330002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:17:13,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:17:13,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:17:13,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:17:13,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1292777507] [2022-04-08 15:17:13,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1292777507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:17:13,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:17:13,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:17:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31065294] [2022-04-08 15:17:13,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:17:13,486 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 175 [2022-04-08 15:17:13,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:17:13,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:13,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:17:13,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:17:13,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:17:13,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:17:13,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:17:13,567 INFO L87 Difference]: Start difference. First operand 1096 states and 1639 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:15,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:17:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:16,981 INFO L93 Difference]: Finished difference Result 2398 states and 3581 transitions. [2022-04-08 15:17:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:17:16,981 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 175 [2022-04-08 15:17:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:17:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-08 15:17:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-08 15:17:16,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 433 transitions. [2022-04-08 15:17:17,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:17:17,335 INFO L225 Difference]: With dead ends: 2398 [2022-04-08 15:17:17,335 INFO L226 Difference]: Without dead ends: 1318 [2022-04-08 15:17:17,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:17:17,337 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 68 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:17:17,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 511 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:17:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-04-08 15:17:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1096. [2022-04-08 15:17:17,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:17:17,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1318 states. Second operand has 1096 states, 1091 states have (on average 1.4940421631530705) internal successors, (1630), 1091 states have internal predecessors, (1630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:17,397 INFO L74 IsIncluded]: Start isIncluded. First operand 1318 states. Second operand has 1096 states, 1091 states have (on average 1.4940421631530705) internal successors, (1630), 1091 states have internal predecessors, (1630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:17,398 INFO L87 Difference]: Start difference. First operand 1318 states. Second operand has 1096 states, 1091 states have (on average 1.4940421631530705) internal successors, (1630), 1091 states have internal predecessors, (1630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:17,448 INFO L93 Difference]: Finished difference Result 1318 states and 1957 transitions. [2022-04-08 15:17:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1957 transitions. [2022-04-08 15:17:17,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:17:17,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:17:17,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 1096 states, 1091 states have (on average 1.4940421631530705) internal successors, (1630), 1091 states have internal predecessors, (1630), 3 states have call successors, (3), 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 1318 states. [2022-04-08 15:17:17,451 INFO L87 Difference]: Start difference. First operand has 1096 states, 1091 states have (on average 1.4940421631530705) internal successors, (1630), 1091 states have internal predecessors, (1630), 3 states have call successors, (3), 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 1318 states. [2022-04-08 15:17:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:17:17,498 INFO L93 Difference]: Finished difference Result 1318 states and 1957 transitions. [2022-04-08 15:17:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1957 transitions. [2022-04-08 15:17:17,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:17:17,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:17:17,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:17:17,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:17:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1091 states have (on average 1.4940421631530705) internal successors, (1630), 1091 states have internal predecessors, (1630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1634 transitions. [2022-04-08 15:17:17,581 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1634 transitions. Word has length 175 [2022-04-08 15:17:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:17:17,581 INFO L478 AbstractCegarLoop]: Abstraction has 1096 states and 1634 transitions. [2022-04-08 15:17:17,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:17:17,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1096 states and 1634 transitions. [2022-04-08 15:17:19,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1634 edges. 1634 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:17:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1634 transitions. [2022-04-08 15:17:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-08 15:17:19,007 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:17:19,007 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 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] [2022-04-08 15:17:19,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 15:17:19,008 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:17:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:17:19,008 INFO L85 PathProgramCache]: Analyzing trace with hash 802686578, now seen corresponding path program 1 times [2022-04-08 15:17:19,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:17:19,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1962871624] [2022-04-08 15:17:32,536 WARN L232 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 15:17:41,507 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:17:41,507 INFO L85 PathProgramCache]: Analyzing trace with hash 802686578, now seen corresponding path program 2 times [2022-04-08 15:17:41,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:17:41,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031495566] [2022-04-08 15:17:41,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:17:41,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:17:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:17:41,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:17:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:17:41,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {131034#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {131024#true} is VALID [2022-04-08 15:17:41,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {131024#true} assume true; {131024#true} is VALID [2022-04-08 15:17:41,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131024#true} {131024#true} #593#return; {131024#true} is VALID [2022-04-08 15:17:41,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {131024#true} call ULTIMATE.init(); {131034#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:17:41,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {131034#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {131024#true} is VALID [2022-04-08 15:17:41,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {131024#true} assume true; {131024#true} is VALID [2022-04-08 15:17:41,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131024#true} {131024#true} #593#return; {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {131024#true} call #t~ret158 := main(); {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {131024#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; {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L272 TraceCheckUtils]: 6: Hoare triple {131024#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {131024#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; {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {131024#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; {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {131024#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {131024#true} assume !false; {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {131024#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {131024#true} assume 12292 == #t~mem49;havoc #t~mem49; {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {131024#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; {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {131024#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {131024#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {131024#true} is VALID [2022-04-08 15:17:41,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {131024#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {131024#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {131024#true} assume !(0 == ~tmp___4~0); {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {131024#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {131024#true} ~skip~0 := 0; {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {131024#true} assume !false; {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {131024#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {131024#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {131024#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {131024#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {131024#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {131024#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {131024#true} assume 4368 == #t~mem54;havoc #t~mem54; {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {131024#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; {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {131024#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {131024#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; {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {131024#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {131024#true} ~skip~0 := 0; {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {131024#true} assume !false; {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {131024#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {131024#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {131024#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {131024#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 45: Hoare triple {131024#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {131024#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 47: Hoare triple {131024#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {131024#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {131024#true} assume 4384 == #t~mem56;havoc #t~mem56; {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {131024#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {131024#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 52: Hoare triple {131024#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {131024#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {131024#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 55: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {131024#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {131024#true} ~skip~0 := 0; {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {131024#true} assume !false; {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 59: Hoare triple {131024#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,703 INFO L290 TraceCheckUtils]: 60: Hoare triple {131024#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 61: Hoare triple {131024#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 62: Hoare triple {131024#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {131024#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 64: Hoare triple {131024#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 65: Hoare triple {131024#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 66: Hoare triple {131024#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 67: Hoare triple {131024#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 68: Hoare triple {131024#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 69: Hoare triple {131024#true} assume 4400 == #t~mem58;havoc #t~mem58; {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {131024#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; {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {131024#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 73: Hoare triple {131024#true} assume !(~ret~0 <= 0); {131024#true} is VALID [2022-04-08 15:17:41,704 INFO L290 TraceCheckUtils]: 74: Hoare triple {131024#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,705 INFO L290 TraceCheckUtils]: 75: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {131024#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {131024#true} is VALID [2022-04-08 15:17:41,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {131024#true} ~skip~0 := 0; {131024#true} is VALID [2022-04-08 15:17:41,705 INFO L290 TraceCheckUtils]: 78: Hoare triple {131024#true} assume !false; {131024#true} is VALID [2022-04-08 15:17:41,705 INFO L290 TraceCheckUtils]: 79: Hoare triple {131024#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,705 INFO L290 TraceCheckUtils]: 80: Hoare triple {131024#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,705 INFO L290 TraceCheckUtils]: 81: Hoare triple {131024#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,705 INFO L290 TraceCheckUtils]: 82: Hoare triple {131024#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,705 INFO L290 TraceCheckUtils]: 83: Hoare triple {131024#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,705 INFO L290 TraceCheckUtils]: 84: Hoare triple {131024#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,705 INFO L290 TraceCheckUtils]: 85: Hoare triple {131024#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,706 INFO L290 TraceCheckUtils]: 86: Hoare triple {131024#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {131029#(= |ssl3_connect_#t~mem56| (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:17:41,706 INFO L290 TraceCheckUtils]: 87: Hoare triple {131029#(= |ssl3_connect_#t~mem56| (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); {131030#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:17:41,706 INFO L290 TraceCheckUtils]: 88: Hoare triple {131030#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {131030#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:17:41,706 INFO L290 TraceCheckUtils]: 89: Hoare triple {131030#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {131030#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-08 15:17:41,707 INFO L290 TraceCheckUtils]: 90: Hoare triple {131030#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {131031#(not (= |ssl3_connect_#t~mem60| 4384))} is VALID [2022-04-08 15:17:41,707 INFO L290 TraceCheckUtils]: 91: Hoare triple {131031#(not (= |ssl3_connect_#t~mem60| 4384))} assume 4416 == #t~mem60;havoc #t~mem60; {131024#true} is VALID [2022-04-08 15:17:41,707 INFO L290 TraceCheckUtils]: 92: Hoare triple {131024#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {131024#true} is VALID [2022-04-08 15:17:41,707 INFO L290 TraceCheckUtils]: 93: Hoare triple {131024#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {131024#true} is VALID [2022-04-08 15:17:41,707 INFO L290 TraceCheckUtils]: 94: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,707 INFO L290 TraceCheckUtils]: 95: Hoare triple {131024#true} assume !(0 == ~tmp___6~0); {131024#true} is VALID [2022-04-08 15:17:41,707 INFO L290 TraceCheckUtils]: 96: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,707 INFO L290 TraceCheckUtils]: 97: Hoare triple {131024#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {131024#true} is VALID [2022-04-08 15:17:41,707 INFO L290 TraceCheckUtils]: 98: Hoare triple {131024#true} ~skip~0 := 0; {131024#true} is VALID [2022-04-08 15:17:41,707 INFO L290 TraceCheckUtils]: 99: Hoare triple {131024#true} assume !false; {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 100: Hoare triple {131024#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 101: Hoare triple {131024#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 102: Hoare triple {131024#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 103: Hoare triple {131024#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 104: Hoare triple {131024#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 105: Hoare triple {131024#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 106: Hoare triple {131024#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 107: Hoare triple {131024#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 108: Hoare triple {131024#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 109: Hoare triple {131024#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 110: Hoare triple {131024#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 111: Hoare triple {131024#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 112: Hoare triple {131024#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,708 INFO L290 TraceCheckUtils]: 113: Hoare triple {131024#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 114: Hoare triple {131024#true} assume 4432 == #t~mem62;havoc #t~mem62; {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 115: Hoare triple {131024#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 116: Hoare triple {131024#true} assume !(5 == ~blastFlag~0); {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 117: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 118: Hoare triple {131024#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); {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 119: Hoare triple {131024#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 120: Hoare triple {131024#true} ~skip~0 := 0; {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 121: Hoare triple {131024#true} assume !false; {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 122: Hoare triple {131024#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 123: Hoare triple {131024#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 124: Hoare triple {131024#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 125: Hoare triple {131024#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 126: Hoare triple {131024#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,709 INFO L290 TraceCheckUtils]: 127: Hoare triple {131024#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,710 INFO L290 TraceCheckUtils]: 128: Hoare triple {131024#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {131024#true} is VALID [2022-04-08 15:17:41,710 INFO L290 TraceCheckUtils]: 129: Hoare triple {131024#true} assume 4369 == #t~mem55;havoc #t~mem55; {131024#true} is VALID [2022-04-08 15:17:41,710 INFO L290 TraceCheckUtils]: 130: Hoare triple {131024#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; {131024#true} is VALID [2022-04-08 15:17:41,710 INFO L290 TraceCheckUtils]: 131: Hoare triple {131024#true} assume !(0 == ~blastFlag~0); {131024#true} is VALID [2022-04-08 15:17:41,710 INFO L290 TraceCheckUtils]: 132: Hoare triple {131024#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {131024#true} is VALID [2022-04-08 15:17:41,711 INFO L290 TraceCheckUtils]: 133: Hoare triple {131024#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); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,711 INFO L290 TraceCheckUtils]: 134: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} 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; {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,711 INFO L290 TraceCheckUtils]: 135: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,712 INFO L290 TraceCheckUtils]: 136: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,712 INFO L290 TraceCheckUtils]: 137: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} ~skip~0 := 0; {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,712 INFO L290 TraceCheckUtils]: 138: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !false; {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,712 INFO L290 TraceCheckUtils]: 139: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,713 INFO L290 TraceCheckUtils]: 140: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,713 INFO L290 TraceCheckUtils]: 141: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,713 INFO L290 TraceCheckUtils]: 142: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,713 INFO L290 TraceCheckUtils]: 143: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,714 INFO L290 TraceCheckUtils]: 144: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,714 INFO L290 TraceCheckUtils]: 145: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,714 INFO L290 TraceCheckUtils]: 146: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,714 INFO L290 TraceCheckUtils]: 147: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,715 INFO L290 TraceCheckUtils]: 148: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,715 INFO L290 TraceCheckUtils]: 149: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-08 15:17:41,715 INFO L290 TraceCheckUtils]: 150: Hoare triple {131032#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {131033#(not (= |ssl3_connect_#t~mem60| 4416))} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 151: Hoare triple {131033#(not (= |ssl3_connect_#t~mem60| 4416))} assume 4416 == #t~mem60;havoc #t~mem60; {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 152: Hoare triple {131025#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 153: Hoare triple {131025#false} assume !(3 == ~blastFlag~0); {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 154: Hoare triple {131025#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); {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 155: Hoare triple {131025#false} assume !(0 == ~tmp___6~0); {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 156: Hoare triple {131025#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); {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 157: Hoare triple {131025#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 158: Hoare triple {131025#false} ~skip~0 := 0; {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 159: Hoare triple {131025#false} assume !false; {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 160: Hoare triple {131025#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); {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 161: Hoare triple {131025#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 162: Hoare triple {131025#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 163: Hoare triple {131025#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,716 INFO L290 TraceCheckUtils]: 164: Hoare triple {131025#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 165: Hoare triple {131025#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 166: Hoare triple {131025#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 167: Hoare triple {131025#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 168: Hoare triple {131025#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 169: Hoare triple {131025#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 170: Hoare triple {131025#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 171: Hoare triple {131025#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 172: Hoare triple {131025#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 173: Hoare triple {131025#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 174: Hoare triple {131025#false} assume 4432 == #t~mem62;havoc #t~mem62; {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 175: Hoare triple {131025#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 176: Hoare triple {131025#false} assume 5 == ~blastFlag~0; {131025#false} is VALID [2022-04-08 15:17:41,717 INFO L290 TraceCheckUtils]: 177: Hoare triple {131025#false} assume !false; {131025#false} is VALID [2022-04-08 15:17:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 201 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-04-08 15:17:41,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:17:41,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031495566] [2022-04-08 15:17:41,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031495566] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 15:17:41,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229144143] [2022-04-08 15:17:41,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 15:17:41,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 15:17:41,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 15:17:41,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 15:17:41,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 15:18:34,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 15:18:34,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 15:18:34,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 15:18:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:18:34,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 15:18:34,742 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-08 15:18:34,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-08 15:18:34,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-08 15:18:34,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-08 15:18:34,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9