/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/loops/s3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:01:00,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:01:00,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:01:00,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:01:00,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:01:00,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:01:00,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:01:00,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:01:00,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:01:00,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:01:00,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:01:00,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:01:00,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:01:00,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:01:00,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:01:00,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:01:00,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:01:00,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:01:00,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:01:00,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:01:00,143 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:01:00,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:01:00,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:01:00,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:01:00,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:01:00,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:01:00,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:01:00,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:01:00,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:01:00,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:01:00,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:01:00,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:01:00,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:01:00,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:01:00,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:01:00,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:01:00,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:01:00,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:01:00,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:01:00,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:01:00,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:01:00,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:01:00,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:01:00,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:01:00,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:01:00,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:01:00,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:01:00,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:01:00,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:01:00,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:01:00,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:01:00,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:01:00,164 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:01:00,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:01:00,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:01:00,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:01:00,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:01:00,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:01:00,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:01:00,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:01:00,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:01:00,165 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:01:00,165 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:01:00,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:01:00,166 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:01:00,166 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:01:00,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:01:00,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:01:00,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:01:00,361 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:01:00,361 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:01:00,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2022-04-28 09:01:00,404 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c657b627/87629635e38f4382ab26761895c3ae4d/FLAG1feee784d [2022-04-28 09:01:00,814 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:01:00,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2022-04-28 09:01:00,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c657b627/87629635e38f4382ab26761895c3ae4d/FLAG1feee784d [2022-04-28 09:01:01,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c657b627/87629635e38f4382ab26761895c3ae4d [2022-04-28 09:01:01,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:01:01,166 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:01:01,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:01:01,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:01:01,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:01:01,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:01:01" (1/1) ... [2022-04-28 09:01:01,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370f344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:01, skipping insertion in model container [2022-04-28 09:01:01,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:01:01" (1/1) ... [2022-04-28 09:01:01,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:01:01,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:01:01,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[64167,64180] [2022-04-28 09:01:01,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:01:01,570 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:01:01,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[64167,64180] [2022-04-28 09:01:01,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:01:01,682 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:01:01,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:01 WrapperNode [2022-04-28 09:01:01,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:01:01,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:01:01,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:01:01,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:01:01,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:01" (1/1) ... [2022-04-28 09:01:01,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:01" (1/1) ... [2022-04-28 09:01:01,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:01" (1/1) ... [2022-04-28 09:01:01,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:01" (1/1) ... [2022-04-28 09:01:01,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:01" (1/1) ... [2022-04-28 09:01:01,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:01" (1/1) ... [2022-04-28 09:01:01,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:01" (1/1) ... [2022-04-28 09:01:01,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:01:01,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:01:01,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:01:01,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:01:01,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:01" (1/1) ... [2022-04-28 09:01:01,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:01:01,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:01,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:01:01,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:01:01,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:01:01,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:01:01,861 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:01:01,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-28 09:01:01,862 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-28 09:01:01,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:01:01,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-28 09:01:01,862 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 09:01:01,862 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 09:01:01,862 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 09:01:01,862 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:01:01,863 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:01:01,863 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:01:01,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:01:01,863 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 09:01:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:01:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 09:01:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:01:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 09:01:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 09:01:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:01:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:01:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:01:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 09:01:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 09:01:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 09:01:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 09:01:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:01:02,051 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:01:02,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:01:04,490 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 09:01:04,905 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-28 09:01:04,905 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-28 09:01:04,919 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:01:04,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:01:04,925 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:01:04,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:01:04 BoogieIcfgContainer [2022-04-28 09:01:04,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:01:04,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:01:04,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:01:04,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:01:04,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:01:01" (1/3) ... [2022-04-28 09:01:04,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e638908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:01:04, skipping insertion in model container [2022-04-28 09:01:04,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:01" (2/3) ... [2022-04-28 09:01:04,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e638908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:01:04, skipping insertion in model container [2022-04-28 09:01:04,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:01:04" (3/3) ... [2022-04-28 09:01:04,933 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-04-28 09:01:04,944 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:01:04,944 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:01:04,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:01:04,992 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@738a8865, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@713a1f10 [2022-04-28 09:01:04,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:01:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:01:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 09:01:05,005 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:05,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:05,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:05,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:05,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 1 times [2022-04-28 09:01:05,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:05,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1908366878] [2022-04-28 09:01:05,021 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:01:05,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 2 times [2022-04-28 09:01:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:05,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468133873] [2022-04-28 09:01:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:05,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:05,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {143#true} is VALID [2022-04-28 09:01:05,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-28 09:01:05,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-28 09:01:05,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {149#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:05,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {143#true} is VALID [2022-04-28 09:01:05,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-28 09:01:05,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-28 09:01:05,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-28 09:01:05,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {143#true} is VALID [2022-04-28 09:01:05,481 INFO L272 TraceCheckUtils]: 6: Hoare triple {143#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {143#true} is VALID [2022-04-28 09:01:05,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !false; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem56;havoc #t~mem56; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {148#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 09:01:05,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {148#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-28 09:01:05,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-28 09:01:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:05,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:05,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468133873] [2022-04-28 09:01:05,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468133873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:05,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:05,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:01:05,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:05,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1908366878] [2022-04-28 09:01:05,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1908366878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:05,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:05,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:01:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476116955] [2022-04-28 09:01:05,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 09:01:05,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:05,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:05,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:05,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:01:05,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:05,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:01:05,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:01:05,555 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:07,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:08,646 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2022-04-28 09:01:08,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:01:08,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 09:01:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 637 transitions. [2022-04-28 09:01:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 637 transitions. [2022-04-28 09:01:08,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 637 transitions. [2022-04-28 09:01:09,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 637 edges. 637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:09,192 INFO L225 Difference]: With dead ends: 385 [2022-04-28 09:01:09,192 INFO L226 Difference]: Without dead ends: 223 [2022-04-28 09:01:09,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:01:09,213 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 179 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:09,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 419 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 09:01:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-04-28 09:01:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-04-28 09:01:09,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:09,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:09,273 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:09,273 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:09,281 INFO L93 Difference]: Finished difference Result 223 states and 327 transitions. [2022-04-28 09:01:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2022-04-28 09:01:09,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:09,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:09,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 223 states. [2022-04-28 09:01:09,284 INFO L87 Difference]: Start difference. First operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 223 states. [2022-04-28 09:01:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:09,293 INFO L93 Difference]: Finished difference Result 223 states and 327 transitions. [2022-04-28 09:01:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2022-04-28 09:01:09,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:09,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:09,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:09,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2022-04-28 09:01:09,310 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2022-04-28 09:01:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:09,310 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2022-04-28 09:01:09,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:09,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 223 states and 327 transitions. [2022-04-28 09:01:09,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2022-04-28 09:01:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 09:01:09,558 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:09,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:09,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:01:09,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash 969835136, now seen corresponding path program 1 times [2022-04-28 09:01:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:09,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1086134951] [2022-04-28 09:01:09,560 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash 969835136, now seen corresponding path program 2 times [2022-04-28 09:01:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:09,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601433204] [2022-04-28 09:01:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:09,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:09,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {1820#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {1814#true} is VALID [2022-04-28 09:01:09,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {1814#true} assume true; {1814#true} is VALID [2022-04-28 09:01:09,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1814#true} {1814#true} #591#return; {1814#true} is VALID [2022-04-28 09:01:09,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {1814#true} call ULTIMATE.init(); {1820#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:09,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {1820#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {1814#true} is VALID [2022-04-28 09:01:09,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {1814#true} assume true; {1814#true} is VALID [2022-04-28 09:01:09,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1814#true} {1814#true} #591#return; {1814#true} is VALID [2022-04-28 09:01:09,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {1814#true} call #t~ret159 := main(); {1814#true} is VALID [2022-04-28 09:01:09,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {1814#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {1814#true} is VALID [2022-04-28 09:01:09,733 INFO L272 TraceCheckUtils]: 6: Hoare triple {1814#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {1814#true} is VALID [2022-04-28 09:01:09,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {1814#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1814#true} is VALID [2022-04-28 09:01:09,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {1814#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {1814#true} is VALID [2022-04-28 09:01:09,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {1814#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {1814#true} is VALID [2022-04-28 09:01:09,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {1814#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1814#true} is VALID [2022-04-28 09:01:09,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {1814#true} assume !false; {1814#true} is VALID [2022-04-28 09:01:09,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {1814#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 09:01:09,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {1814#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 09:01:09,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {1814#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 09:01:09,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {1814#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 09:01:09,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {1814#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 09:01:09,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {1814#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1814#true} is VALID [2022-04-28 09:01:09,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {1814#true} assume 4368 == #t~mem48;havoc #t~mem48; {1814#true} is VALID [2022-04-28 09:01:09,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {1814#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {1814#true} is VALID [2022-04-28 09:01:09,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {1814#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {1819#(= 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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !false; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume 4432 == #t~mem56;havoc #t~mem56; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {1819#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 09:01:09,751 INFO L290 TraceCheckUtils]: 43: Hoare triple {1819#(= ssl3_connect_~blastFlag~0 1)} assume 5 == ~blastFlag~0; {1815#false} is VALID [2022-04-28 09:01:09,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {1815#false} assume !false; {1815#false} is VALID [2022-04-28 09:01:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:09,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:09,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601433204] [2022-04-28 09:01:09,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601433204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:09,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:09,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:01:09,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:09,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1086134951] [2022-04-28 09:01:09,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1086134951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:09,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:09,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:01:09,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305981879] [2022-04-28 09:01:09,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 09:01:09,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:09,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:09,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:09,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:01:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:09,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:01:09,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:01:09,804 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:11,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:12,794 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2022-04-28 09:01:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:01:12,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 09:01:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-28 09:01:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-28 09:01:12,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 492 transitions. [2022-04-28 09:01:13,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:13,153 INFO L225 Difference]: With dead ends: 432 [2022-04-28 09:01:13,153 INFO L226 Difference]: Without dead ends: 325 [2022-04-28 09:01:13,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:01:13,154 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:13,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 09:01:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-04-28 09:01:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-04-28 09:01:13,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:13,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:13,178 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:13,178 INFO L87 Difference]: Start difference. First operand 325 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:13,186 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2022-04-28 09:01:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-28 09:01:13,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:13,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:13,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 325 states. [2022-04-28 09:01:13,188 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 325 states. [2022-04-28 09:01:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:13,195 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2022-04-28 09:01:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-28 09:01:13,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:13,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:13,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:13,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2022-04-28 09:01:13,204 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2022-04-28 09:01:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:13,204 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2022-04-28 09:01:13,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:13,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 476 transitions. [2022-04-28 09:01:13,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-28 09:01:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 09:01:13,544 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:13,545 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:13,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:01:13,545 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:13,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2112862728, now seen corresponding path program 1 times [2022-04-28 09:01:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:13,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [875405290] [2022-04-28 09:01:13,548 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2112862728, now seen corresponding path program 2 times [2022-04-28 09:01:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:13,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480946210] [2022-04-28 09:01:13,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:13,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:13,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {3994#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {3987#true} is VALID [2022-04-28 09:01:13,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {3987#true} assume true; {3987#true} is VALID [2022-04-28 09:01:13,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3987#true} {3987#true} #591#return; {3987#true} is VALID [2022-04-28 09:01:13,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {3987#true} call ULTIMATE.init(); {3994#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:13,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {3994#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {3987#true} is VALID [2022-04-28 09:01:13,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {3987#true} assume true; {3987#true} is VALID [2022-04-28 09:01:13,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3987#true} {3987#true} #591#return; {3987#true} is VALID [2022-04-28 09:01:13,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {3987#true} call #t~ret159 := main(); {3987#true} is VALID [2022-04-28 09:01:13,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {3987#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {3987#true} is VALID [2022-04-28 09:01:13,817 INFO L272 TraceCheckUtils]: 6: Hoare triple {3987#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {3987#true} is VALID [2022-04-28 09:01:13,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {3987#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {3987#true} is VALID [2022-04-28 09:01:13,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {3987#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {3987#true} is VALID [2022-04-28 09:01:13,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {3987#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {3987#true} is VALID [2022-04-28 09:01:13,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {3987#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3987#true} is VALID [2022-04-28 09:01:13,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {3987#true} assume !false; {3987#true} is VALID [2022-04-28 09:01:13,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {3987#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {3987#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {3987#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {3987#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {3987#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {3987#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {3987#true} assume 4368 == #t~mem48;havoc #t~mem48; {3987#true} is VALID [2022-04-28 09:01:13,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {3987#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {3987#true} is VALID [2022-04-28 09:01:13,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {3987#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3987#true} is VALID [2022-04-28 09:01:13,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {3987#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {3987#true} is VALID [2022-04-28 09:01:13,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {3987#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {3987#true} is VALID [2022-04-28 09:01:13,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {3987#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {3987#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {3987#true} is VALID [2022-04-28 09:01:13,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {3987#true} ~skip~0 := 0; {3987#true} is VALID [2022-04-28 09:01:13,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {3987#true} assume !false; {3987#true} is VALID [2022-04-28 09:01:13,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {3987#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {3987#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {3987#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {3987#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {3987#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {3987#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {3987#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {3987#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {3987#true} assume 4384 == #t~mem50;havoc #t~mem50; {3987#true} is VALID [2022-04-28 09:01:13,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {3987#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {3987#true} is VALID [2022-04-28 09:01:13,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {3987#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {3987#true} is VALID [2022-04-28 09:01:13,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {3987#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {3987#true} is VALID [2022-04-28 09:01:13,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {3987#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,833 INFO L290 TraceCheckUtils]: 40: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} ~skip~0 := 0; {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !false; {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,840 INFO L290 TraceCheckUtils]: 50: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,842 INFO L290 TraceCheckUtils]: 53: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,843 INFO L290 TraceCheckUtils]: 56: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,843 INFO L290 TraceCheckUtils]: 57: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:13,843 INFO L290 TraceCheckUtils]: 58: Hoare triple {3992#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3993#(= |ssl3_connect_#t~mem56| 4560)} is VALID [2022-04-28 09:01:13,846 INFO L290 TraceCheckUtils]: 59: Hoare triple {3993#(= |ssl3_connect_#t~mem56| 4560)} assume 4432 == #t~mem56;havoc #t~mem56; {3988#false} is VALID [2022-04-28 09:01:13,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {3988#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {3988#false} is VALID [2022-04-28 09:01:13,846 INFO L290 TraceCheckUtils]: 61: Hoare triple {3988#false} assume 5 == ~blastFlag~0; {3988#false} is VALID [2022-04-28 09:01:13,847 INFO L290 TraceCheckUtils]: 62: Hoare triple {3988#false} assume !false; {3988#false} is VALID [2022-04-28 09:01:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 09:01:13,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:13,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480946210] [2022-04-28 09:01:13,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480946210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:13,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:13,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:13,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:13,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [875405290] [2022-04-28 09:01:13,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [875405290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:13,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:13,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196673315] [2022-04-28 09:01:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:13,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 09:01:13,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:13,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:13,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:13,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:13,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:01:13,900 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:15,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:17,493 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2022-04-28 09:01:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:17,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 09:01:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2022-04-28 09:01:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2022-04-28 09:01:17,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 481 transitions. [2022-04-28 09:01:17,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 481 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:17,847 INFO L225 Difference]: With dead ends: 825 [2022-04-28 09:01:17,847 INFO L226 Difference]: Without dead ends: 513 [2022-04-28 09:01:17,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:01:17,867 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 98 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:17,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 582 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 552 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 09:01:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-04-28 09:01:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2022-04-28 09:01:17,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:17,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 513 states. Second operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:17,887 INFO L74 IsIncluded]: Start isIncluded. First operand 513 states. Second operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:17,888 INFO L87 Difference]: Start difference. First operand 513 states. Second operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:17,900 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2022-04-28 09:01:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 755 transitions. [2022-04-28 09:01:17,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:17,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:17,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 513 states. [2022-04-28 09:01:17,903 INFO L87 Difference]: Start difference. First operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 513 states. [2022-04-28 09:01:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:17,920 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2022-04-28 09:01:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 755 transitions. [2022-04-28 09:01:17,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:17,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:17,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:17,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2022-04-28 09:01:17,929 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2022-04-28 09:01:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:17,930 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2022-04-28 09:01:17,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:17,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 375 states and 562 transitions. [2022-04-28 09:01:18,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2022-04-28 09:01:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 09:01:18,321 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:18,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:18,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 09:01:18,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:18,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2048091062, now seen corresponding path program 1 times [2022-04-28 09:01:18,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:18,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637573861] [2022-04-28 09:01:18,322 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2048091062, now seen corresponding path program 2 times [2022-04-28 09:01:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:18,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121955221] [2022-04-28 09:01:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:18,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:18,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:18,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {7432#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {7425#true} is VALID [2022-04-28 09:01:18,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {7425#true} assume true; {7425#true} is VALID [2022-04-28 09:01:18,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7425#true} {7425#true} #591#return; {7425#true} is VALID [2022-04-28 09:01:18,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {7425#true} call ULTIMATE.init(); {7432#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:18,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {7432#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {7425#true} is VALID [2022-04-28 09:01:18,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {7425#true} assume true; {7425#true} is VALID [2022-04-28 09:01:18,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7425#true} {7425#true} #591#return; {7425#true} is VALID [2022-04-28 09:01:18,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {7425#true} call #t~ret159 := main(); {7425#true} is VALID [2022-04-28 09:01:18,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {7425#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {7425#true} is VALID [2022-04-28 09:01:18,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {7425#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {7425#true} is VALID [2022-04-28 09:01:18,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {7425#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {7425#true} is VALID [2022-04-28 09:01:18,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {7425#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {7425#true} is VALID [2022-04-28 09:01:18,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {7425#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {7425#true} is VALID [2022-04-28 09:01:18,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {7425#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7425#true} is VALID [2022-04-28 09:01:18,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {7425#true} assume !false; {7425#true} is VALID [2022-04-28 09:01:18,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {7425#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {7425#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {7425#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {7425#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {7425#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {7425#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {7425#true} assume 4368 == #t~mem48;havoc #t~mem48; {7425#true} is VALID [2022-04-28 09:01:18,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {7425#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {7425#true} is VALID [2022-04-28 09:01:18,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {7425#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7425#true} is VALID [2022-04-28 09:01:18,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {7425#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {7425#true} is VALID [2022-04-28 09:01:18,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {7425#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {7425#true} is VALID [2022-04-28 09:01:18,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {7425#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {7425#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7425#true} is VALID [2022-04-28 09:01:18,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {7425#true} ~skip~0 := 0; {7425#true} is VALID [2022-04-28 09:01:18,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {7425#true} assume !false; {7425#true} is VALID [2022-04-28 09:01:18,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {7425#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {7425#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {7425#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {7425#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {7425#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {7425#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {7425#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {7425#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {7425#true} assume 4384 == #t~mem50;havoc #t~mem50; {7425#true} is VALID [2022-04-28 09:01:18,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {7425#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {7425#true} is VALID [2022-04-28 09:01:18,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {7425#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {7425#true} is VALID [2022-04-28 09:01:18,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {7425#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {7425#true} is VALID [2022-04-28 09:01:18,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {7425#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,474 INFO L290 TraceCheckUtils]: 42: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,476 INFO L290 TraceCheckUtils]: 46: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,476 INFO L290 TraceCheckUtils]: 47: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,477 INFO L290 TraceCheckUtils]: 49: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,480 INFO L290 TraceCheckUtils]: 51: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,481 INFO L290 TraceCheckUtils]: 52: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,481 INFO L290 TraceCheckUtils]: 53: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 09:01:18,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {7430#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7431#(= |ssl3_connect_#t~mem52| 4400)} is VALID [2022-04-28 09:01:18,483 INFO L290 TraceCheckUtils]: 55: Hoare triple {7431#(= |ssl3_connect_#t~mem52| 4400)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7426#false} is VALID [2022-04-28 09:01:18,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {7426#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7426#false} is VALID [2022-04-28 09:01:18,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {7426#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7426#false} is VALID [2022-04-28 09:01:18,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {7426#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7426#false} is VALID [2022-04-28 09:01:18,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {7426#false} assume 4432 == #t~mem56;havoc #t~mem56; {7426#false} is VALID [2022-04-28 09:01:18,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {7426#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {7426#false} is VALID [2022-04-28 09:01:18,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {7426#false} assume 5 == ~blastFlag~0; {7426#false} is VALID [2022-04-28 09:01:18,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {7426#false} assume !false; {7426#false} is VALID [2022-04-28 09:01:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 09:01:18,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:18,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121955221] [2022-04-28 09:01:18,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121955221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:18,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:18,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:18,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:18,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637573861] [2022-04-28 09:01:18,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637573861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:18,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:18,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:18,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970561478] [2022-04-28 09:01:18,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:18,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 09:01:18,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:18,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:18,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:18,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:18,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:18,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:18,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:01:18,526 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:20,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:21,659 INFO L93 Difference]: Finished difference Result 821 states and 1232 transitions. [2022-04-28 09:01:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:21,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 09:01:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2022-04-28 09:01:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2022-04-28 09:01:21,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 402 transitions. [2022-04-28 09:01:21,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:21,928 INFO L225 Difference]: With dead ends: 821 [2022-04-28 09:01:21,928 INFO L226 Difference]: Without dead ends: 459 [2022-04-28 09:01:21,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:01:21,930 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 38 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:21,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 510 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 09:01:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-28 09:01:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2022-04-28 09:01:21,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:21,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 415 states, 410 states have (on average 1.526829268292683) internal successors, (626), 410 states have internal predecessors, (626), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:21,947 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 415 states, 410 states have (on average 1.526829268292683) internal successors, (626), 410 states have internal predecessors, (626), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:21,947 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 415 states, 410 states have (on average 1.526829268292683) internal successors, (626), 410 states have internal predecessors, (626), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:21,956 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2022-04-28 09:01:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 685 transitions. [2022-04-28 09:01:21,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:21,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:21,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 415 states, 410 states have (on average 1.526829268292683) internal successors, (626), 410 states have internal predecessors, (626), 3 states have call successors, (3), 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 459 states. [2022-04-28 09:01:21,958 INFO L87 Difference]: Start difference. First operand has 415 states, 410 states have (on average 1.526829268292683) internal successors, (626), 410 states have internal predecessors, (626), 3 states have call successors, (3), 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 459 states. [2022-04-28 09:01:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:21,967 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2022-04-28 09:01:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 685 transitions. [2022-04-28 09:01:21,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:21,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:21,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:21,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.526829268292683) internal successors, (626), 410 states have internal predecessors, (626), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2022-04-28 09:01:21,980 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2022-04-28 09:01:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:21,981 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2022-04-28 09:01:21,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:21,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 415 states and 630 transitions. [2022-04-28 09:01:22,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 630 edges. 630 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2022-04-28 09:01:22,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 09:01:22,416 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:22,416 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:22,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 09:01:22,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:22,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1078652993, now seen corresponding path program 1 times [2022-04-28 09:01:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:22,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1422418922] [2022-04-28 09:01:22,417 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1078652993, now seen corresponding path program 2 times [2022-04-28 09:01:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:22,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233183398] [2022-04-28 09:01:22,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:22,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:22,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {10834#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {10827#true} is VALID [2022-04-28 09:01:22,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {10827#true} assume true; {10827#true} is VALID [2022-04-28 09:01:22,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10827#true} {10827#true} #591#return; {10827#true} is VALID [2022-04-28 09:01:22,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {10827#true} call ULTIMATE.init(); {10834#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:22,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {10834#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {10827#true} is VALID [2022-04-28 09:01:22,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {10827#true} assume true; {10827#true} is VALID [2022-04-28 09:01:22,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10827#true} {10827#true} #591#return; {10827#true} is VALID [2022-04-28 09:01:22,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {10827#true} call #t~ret159 := main(); {10827#true} is VALID [2022-04-28 09:01:22,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {10827#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {10827#true} is VALID [2022-04-28 09:01:22,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {10827#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {10827#true} is VALID [2022-04-28 09:01:22,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {10827#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {10827#true} is VALID [2022-04-28 09:01:22,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {10827#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {10827#true} is VALID [2022-04-28 09:01:22,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {10827#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {10827#true} is VALID [2022-04-28 09:01:22,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {10827#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10827#true} is VALID [2022-04-28 09:01:22,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {10827#true} assume !false; {10827#true} is VALID [2022-04-28 09:01:22,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {10827#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {10827#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {10827#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {10827#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {10827#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {10827#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {10827#true} assume 4368 == #t~mem48;havoc #t~mem48; {10827#true} is VALID [2022-04-28 09:01:22,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {10827#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {10827#true} is VALID [2022-04-28 09:01:22,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {10827#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {10827#true} is VALID [2022-04-28 09:01:22,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {10827#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {10827#true} is VALID [2022-04-28 09:01:22,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {10827#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {10827#true} is VALID [2022-04-28 09:01:22,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {10827#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {10827#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {10827#true} is VALID [2022-04-28 09:01:22,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {10827#true} ~skip~0 := 0; {10827#true} is VALID [2022-04-28 09:01:22,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {10827#true} assume !false; {10827#true} is VALID [2022-04-28 09:01:22,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {10827#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {10827#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {10827#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {10827#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {10827#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {10827#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {10827#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {10827#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {10827#true} assume 4384 == #t~mem50;havoc #t~mem50; {10827#true} is VALID [2022-04-28 09:01:22,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {10827#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {10827#true} is VALID [2022-04-28 09:01:22,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {10827#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {10827#true} is VALID [2022-04-28 09:01:22,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {10827#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {10827#true} is VALID [2022-04-28 09:01:22,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {10827#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} ~skip~0 := 0; {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !false; {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,591 INFO L290 TraceCheckUtils]: 46: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,591 INFO L290 TraceCheckUtils]: 47: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,592 INFO L290 TraceCheckUtils]: 49: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 09:01:22,595 INFO L290 TraceCheckUtils]: 59: Hoare triple {10832#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {10833#(not (= |ssl3_connect_#t~mem57| 4433))} is VALID [2022-04-28 09:01:22,595 INFO L290 TraceCheckUtils]: 60: Hoare triple {10833#(not (= |ssl3_connect_#t~mem57| 4433))} assume 4433 == #t~mem57;havoc #t~mem57; {10828#false} is VALID [2022-04-28 09:01:22,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {10828#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {10828#false} is VALID [2022-04-28 09:01:22,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {10828#false} assume 5 == ~blastFlag~0; {10828#false} is VALID [2022-04-28 09:01:22,596 INFO L290 TraceCheckUtils]: 63: Hoare triple {10828#false} assume !false; {10828#false} is VALID [2022-04-28 09:01:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 09:01:22,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:22,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233183398] [2022-04-28 09:01:22,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233183398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:22,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:22,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:22,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:22,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1422418922] [2022-04-28 09:01:22,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1422418922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:22,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:22,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:22,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106499359] [2022-04-28 09:01:22,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:22,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 09:01:22,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:22,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:22,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:22,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:22,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:22,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:22,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:01:22,662 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:24,686 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:25,729 INFO L93 Difference]: Finished difference Result 1092 states and 1654 transitions. [2022-04-28 09:01:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:25,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 09:01:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 09:01:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 09:01:25,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-28 09:01:26,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:26,111 INFO L225 Difference]: With dead ends: 1092 [2022-04-28 09:01:26,111 INFO L226 Difference]: Without dead ends: 690 [2022-04-28 09:01:26,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:01:26,113 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 108 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:26,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 09:01:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-04-28 09:01:26,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 490. [2022-04-28 09:01:26,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:26,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 690 states. Second operand has 490 states, 485 states have (on average 1.5628865979381443) internal successors, (758), 485 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:26,130 INFO L74 IsIncluded]: Start isIncluded. First operand 690 states. Second operand has 490 states, 485 states have (on average 1.5628865979381443) internal successors, (758), 485 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:26,131 INFO L87 Difference]: Start difference. First operand 690 states. Second operand has 490 states, 485 states have (on average 1.5628865979381443) internal successors, (758), 485 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:26,147 INFO L93 Difference]: Finished difference Result 690 states and 1038 transitions. [2022-04-28 09:01:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1038 transitions. [2022-04-28 09:01:26,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:26,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:26,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 490 states, 485 states have (on average 1.5628865979381443) internal successors, (758), 485 states have internal predecessors, (758), 3 states have call successors, (3), 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 690 states. [2022-04-28 09:01:26,151 INFO L87 Difference]: Start difference. First operand has 490 states, 485 states have (on average 1.5628865979381443) internal successors, (758), 485 states have internal predecessors, (758), 3 states have call successors, (3), 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 690 states. [2022-04-28 09:01:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:26,168 INFO L93 Difference]: Finished difference Result 690 states and 1038 transitions. [2022-04-28 09:01:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1038 transitions. [2022-04-28 09:01:26,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:26,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:26,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:26,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.5628865979381443) internal successors, (758), 485 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 762 transitions. [2022-04-28 09:01:26,181 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 762 transitions. Word has length 64 [2022-04-28 09:01:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:26,181 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 762 transitions. [2022-04-28 09:01:26,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:26,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 490 states and 762 transitions. [2022-04-28 09:01:26,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 762 edges. 762 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 762 transitions. [2022-04-28 09:01:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 09:01:26,777 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:26,777 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:26,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 09:01:26,777 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:26,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash 917238579, now seen corresponding path program 1 times [2022-04-28 09:01:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:26,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1851729844] [2022-04-28 09:01:26,778 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:26,778 INFO L85 PathProgramCache]: Analyzing trace with hash 917238579, now seen corresponding path program 2 times [2022-04-28 09:01:26,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:26,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530964283] [2022-04-28 09:01:26,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:26,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:26,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:26,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {15390#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {15383#true} is VALID [2022-04-28 09:01:26,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {15383#true} assume true; {15383#true} is VALID [2022-04-28 09:01:26,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15383#true} {15383#true} #591#return; {15383#true} is VALID [2022-04-28 09:01:26,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {15383#true} call ULTIMATE.init(); {15390#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:26,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {15390#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {15383#true} is VALID [2022-04-28 09:01:26,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {15383#true} assume true; {15383#true} is VALID [2022-04-28 09:01:26,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15383#true} {15383#true} #591#return; {15383#true} is VALID [2022-04-28 09:01:26,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {15383#true} call #t~ret159 := main(); {15383#true} is VALID [2022-04-28 09:01:26,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {15383#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {15383#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {15383#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {15383#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {15383#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {15383#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {15383#true} assume !false; {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {15383#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {15383#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {15383#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {15383#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {15383#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {15383#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {15383#true} assume 4368 == #t~mem48;havoc #t~mem48; {15383#true} is VALID [2022-04-28 09:01:26,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {15383#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {15383#true} is VALID [2022-04-28 09:01:26,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {15383#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15383#true} is VALID [2022-04-28 09:01:26,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {15383#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {15383#true} is VALID [2022-04-28 09:01:26,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {15383#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {15383#true} is VALID [2022-04-28 09:01:26,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {15383#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {15383#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15383#true} is VALID [2022-04-28 09:01:26,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {15383#true} ~skip~0 := 0; {15383#true} is VALID [2022-04-28 09:01:26,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {15383#true} assume !false; {15383#true} is VALID [2022-04-28 09:01:26,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {15383#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {15383#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {15383#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {15383#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {15383#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {15383#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {15383#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {15383#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {15383#true} assume 4384 == #t~mem50;havoc #t~mem50; {15383#true} is VALID [2022-04-28 09:01:26,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {15383#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {15383#true} is VALID [2022-04-28 09:01:26,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {15383#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15383#true} is VALID [2022-04-28 09:01:26,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {15383#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {15383#true} is VALID [2022-04-28 09:01:26,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {15383#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} ~skip~0 := 0; {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !false; {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:26,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {15388#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15389#(= |ssl3_connect_#t~mem58| 4560)} is VALID [2022-04-28 09:01:26,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {15389#(= |ssl3_connect_#t~mem58| 4560)} assume 4448 == #t~mem58;havoc #t~mem58; {15384#false} is VALID [2022-04-28 09:01:26,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {15384#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {15384#false} is VALID [2022-04-28 09:01:26,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {15384#false} assume 4 == ~blastFlag~0; {15384#false} is VALID [2022-04-28 09:01:26,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {15384#false} assume !false; {15384#false} is VALID [2022-04-28 09:01:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 09:01:26,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:26,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530964283] [2022-04-28 09:01:26,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530964283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:26,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:26,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:26,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:26,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1851729844] [2022-04-28 09:01:26,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1851729844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:26,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:26,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:26,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076950652] [2022-04-28 09:01:26,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:26,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 09:01:26,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:26,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:26,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:26,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:26,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:26,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:26,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:01:26,986 INFO L87 Difference]: Start difference. First operand 490 states and 762 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:29,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:30,432 INFO L93 Difference]: Finished difference Result 1099 states and 1691 transitions. [2022-04-28 09:01:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:30,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 09:01:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 09:01:30,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-28 09:01:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 09:01:30,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 09:01:30,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:30,779 INFO L225 Difference]: With dead ends: 1099 [2022-04-28 09:01:30,779 INFO L226 Difference]: Without dead ends: 622 [2022-04-28 09:01:30,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:01:30,781 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 91 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:30,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 570 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 542 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 09:01:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-04-28 09:01:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 494. [2022-04-28 09:01:30,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:30,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 622 states. Second operand has 494 states, 489 states have (on average 1.5582822085889572) internal successors, (762), 489 states have internal predecessors, (762), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:30,797 INFO L74 IsIncluded]: Start isIncluded. First operand 622 states. Second operand has 494 states, 489 states have (on average 1.5582822085889572) internal successors, (762), 489 states have internal predecessors, (762), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:30,798 INFO L87 Difference]: Start difference. First operand 622 states. Second operand has 494 states, 489 states have (on average 1.5582822085889572) internal successors, (762), 489 states have internal predecessors, (762), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:30,810 INFO L93 Difference]: Finished difference Result 622 states and 944 transitions. [2022-04-28 09:01:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 944 transitions. [2022-04-28 09:01:30,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:30,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:30,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 489 states have (on average 1.5582822085889572) internal successors, (762), 489 states have internal predecessors, (762), 3 states have call successors, (3), 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 622 states. [2022-04-28 09:01:30,813 INFO L87 Difference]: Start difference. First operand has 494 states, 489 states have (on average 1.5582822085889572) internal successors, (762), 489 states have internal predecessors, (762), 3 states have call successors, (3), 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 622 states. [2022-04-28 09:01:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:30,825 INFO L93 Difference]: Finished difference Result 622 states and 944 transitions. [2022-04-28 09:01:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 944 transitions. [2022-04-28 09:01:30,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:30,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:30,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:30,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 489 states have (on average 1.5582822085889572) internal successors, (762), 489 states have internal predecessors, (762), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 766 transitions. [2022-04-28 09:01:30,839 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 766 transitions. Word has length 65 [2022-04-28 09:01:30,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:30,839 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 766 transitions. [2022-04-28 09:01:30,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:30,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 494 states and 766 transitions. [2022-04-28 09:01:31,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 766 edges. 766 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 766 transitions. [2022-04-28 09:01:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 09:01:31,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:31,402 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:31,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 09:01:31,403 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:31,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:31,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1634852198, now seen corresponding path program 1 times [2022-04-28 09:01:31,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:31,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [769637405] [2022-04-28 09:01:31,403 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:31,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1634852198, now seen corresponding path program 2 times [2022-04-28 09:01:31,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:31,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053352112] [2022-04-28 09:01:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:31,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:31,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:31,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {19832#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {19825#true} is VALID [2022-04-28 09:01:31,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {19825#true} assume true; {19825#true} is VALID [2022-04-28 09:01:31,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19825#true} {19825#true} #591#return; {19825#true} is VALID [2022-04-28 09:01:31,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {19825#true} call ULTIMATE.init(); {19832#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:31,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {19832#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {19825#true} is VALID [2022-04-28 09:01:31,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {19825#true} assume true; {19825#true} is VALID [2022-04-28 09:01:31,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19825#true} {19825#true} #591#return; {19825#true} is VALID [2022-04-28 09:01:31,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {19825#true} call #t~ret159 := main(); {19825#true} is VALID [2022-04-28 09:01:31,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {19825#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {19825#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {19825#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {19825#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {19825#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {19825#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {19825#true} assume !false; {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {19825#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {19825#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {19825#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {19825#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {19825#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {19825#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {19825#true} assume 4368 == #t~mem48;havoc #t~mem48; {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {19825#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {19825#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {19825#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {19825#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {19825#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {19825#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {19825#true} ~skip~0 := 0; {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {19825#true} assume !false; {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {19825#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {19825#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {19825#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {19825#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {19825#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {19825#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {19825#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {19825#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {19825#true} assume 4384 == #t~mem50;havoc #t~mem50; {19825#true} is VALID [2022-04-28 09:01:31,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {19825#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {19825#true} is VALID [2022-04-28 09:01:31,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {19825#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {19825#true} is VALID [2022-04-28 09:01:31,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {19825#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {19825#true} is VALID [2022-04-28 09:01:31,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {19825#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,561 INFO L290 TraceCheckUtils]: 54: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,561 INFO L290 TraceCheckUtils]: 55: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,561 INFO L290 TraceCheckUtils]: 56: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,562 INFO L290 TraceCheckUtils]: 59: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,563 INFO L290 TraceCheckUtils]: 60: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:31,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {19830#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {19831#(not (= 4449 |ssl3_connect_#t~mem59|))} is VALID [2022-04-28 09:01:31,563 INFO L290 TraceCheckUtils]: 62: Hoare triple {19831#(not (= 4449 |ssl3_connect_#t~mem59|))} assume 4449 == #t~mem59;havoc #t~mem59; {19826#false} is VALID [2022-04-28 09:01:31,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {19826#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {19826#false} is VALID [2022-04-28 09:01:31,563 INFO L290 TraceCheckUtils]: 64: Hoare triple {19826#false} assume 4 == ~blastFlag~0; {19826#false} is VALID [2022-04-28 09:01:31,564 INFO L290 TraceCheckUtils]: 65: Hoare triple {19826#false} assume !false; {19826#false} is VALID [2022-04-28 09:01:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 09:01:31,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:31,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053352112] [2022-04-28 09:01:31,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053352112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:31,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:31,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:31,565 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:31,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [769637405] [2022-04-28 09:01:31,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [769637405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:31,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:31,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194842290] [2022-04-28 09:01:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:31,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 09:01:31,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:31,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:31,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:31,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:31,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:31,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:31,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:01:31,616 INFO L87 Difference]: Start difference. First operand 494 states and 766 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:33,639 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:34,701 INFO L93 Difference]: Finished difference Result 1175 states and 1791 transitions. [2022-04-28 09:01:34,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:34,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 09:01:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:34,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 09:01:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 09:01:34,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-28 09:01:35,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:35,068 INFO L225 Difference]: With dead ends: 1175 [2022-04-28 09:01:35,068 INFO L226 Difference]: Without dead ends: 694 [2022-04-28 09:01:35,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:01:35,070 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 105 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:35,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 09:01:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-04-28 09:01:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 500. [2022-04-28 09:01:35,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:35,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 694 states. Second operand has 500 states, 495 states have (on average 1.5575757575757576) internal successors, (771), 495 states have internal predecessors, (771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:35,105 INFO L74 IsIncluded]: Start isIncluded. First operand 694 states. Second operand has 500 states, 495 states have (on average 1.5575757575757576) internal successors, (771), 495 states have internal predecessors, (771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:35,105 INFO L87 Difference]: Start difference. First operand 694 states. Second operand has 500 states, 495 states have (on average 1.5575757575757576) internal successors, (771), 495 states have internal predecessors, (771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:35,120 INFO L93 Difference]: Finished difference Result 694 states and 1039 transitions. [2022-04-28 09:01:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1039 transitions. [2022-04-28 09:01:35,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:35,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:35,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 500 states, 495 states have (on average 1.5575757575757576) internal successors, (771), 495 states have internal predecessors, (771), 3 states have call successors, (3), 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 694 states. [2022-04-28 09:01:35,123 INFO L87 Difference]: Start difference. First operand has 500 states, 495 states have (on average 1.5575757575757576) internal successors, (771), 495 states have internal predecessors, (771), 3 states have call successors, (3), 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 694 states. [2022-04-28 09:01:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:35,137 INFO L93 Difference]: Finished difference Result 694 states and 1039 transitions. [2022-04-28 09:01:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1039 transitions. [2022-04-28 09:01:35,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:35,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:35,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:35,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 495 states have (on average 1.5575757575757576) internal successors, (771), 495 states have internal predecessors, (771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 775 transitions. [2022-04-28 09:01:35,153 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 775 transitions. Word has length 66 [2022-04-28 09:01:35,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:35,154 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 775 transitions. [2022-04-28 09:01:35,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:35,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 500 states and 775 transitions. [2022-04-28 09:01:35,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 775 edges. 775 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 775 transitions. [2022-04-28 09:01:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 09:01:35,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:35,745 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 09:01:35,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 09:01:35,746 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash 391550933, now seen corresponding path program 1 times [2022-04-28 09:01:35,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:35,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566040905] [2022-04-28 09:01:35,747 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash 391550933, now seen corresponding path program 2 times [2022-04-28 09:01:35,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:35,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125645474] [2022-04-28 09:01:35,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:35,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:35,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:35,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {24582#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {24575#true} is VALID [2022-04-28 09:01:35,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {24575#true} assume true; {24575#true} is VALID [2022-04-28 09:01:35,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24575#true} {24575#true} #591#return; {24575#true} is VALID [2022-04-28 09:01:35,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {24575#true} call ULTIMATE.init(); {24582#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:35,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {24582#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {24575#true} assume true; {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24575#true} {24575#true} #591#return; {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {24575#true} call #t~ret159 := main(); {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {24575#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L272 TraceCheckUtils]: 6: Hoare triple {24575#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {24575#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {24575#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {24575#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {24575#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {24575#true} assume !false; {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {24575#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {24575#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {24575#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {24575#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {24575#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {24575#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {24575#true} assume 4368 == #t~mem48;havoc #t~mem48; {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {24575#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {24575#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {24575#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {24575#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {24575#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {24575#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {24575#true} ~skip~0 := 0; {24575#true} is VALID [2022-04-28 09:01:35,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {24575#true} assume !false; {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {24575#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {24575#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {24575#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {24575#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {24575#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {24575#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {24575#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {24575#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {24575#true} assume 4384 == #t~mem50;havoc #t~mem50; {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {24575#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {24575#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {24575#true} is VALID [2022-04-28 09:01:35,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {24575#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {24575#true} is VALID [2022-04-28 09:01:35,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {24575#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:35,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:35,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:35,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:35,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:35,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:01:35,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {24580#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {24581#(not (= 12292 |ssl3_connect_#t~mem43|))} is VALID [2022-04-28 09:01:35,864 INFO L290 TraceCheckUtils]: 46: Hoare triple {24581#(not (= 12292 |ssl3_connect_#t~mem43|))} assume 12292 == #t~mem43;havoc #t~mem43; {24576#false} is VALID [2022-04-28 09:01:35,864 INFO L290 TraceCheckUtils]: 47: Hoare triple {24576#false} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {24576#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {24576#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {24576#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {24576#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {24576#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {24576#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {24576#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {24576#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {24576#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {24576#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 58: Hoare triple {24576#false} ~skip~0 := 0; {24576#false} is VALID [2022-04-28 09:01:35,865 INFO L290 TraceCheckUtils]: 59: Hoare triple {24576#false} assume !false; {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 60: Hoare triple {24576#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {24576#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {24576#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {24576#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {24576#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {24576#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {24576#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 67: Hoare triple {24576#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 68: Hoare triple {24576#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 69: Hoare triple {24576#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 70: Hoare triple {24576#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 71: Hoare triple {24576#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,866 INFO L290 TraceCheckUtils]: 72: Hoare triple {24576#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,867 INFO L290 TraceCheckUtils]: 73: Hoare triple {24576#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {24576#false} is VALID [2022-04-28 09:01:35,867 INFO L290 TraceCheckUtils]: 74: Hoare triple {24576#false} assume 4432 == #t~mem56;havoc #t~mem56; {24576#false} is VALID [2022-04-28 09:01:35,867 INFO L290 TraceCheckUtils]: 75: Hoare triple {24576#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {24576#false} is VALID [2022-04-28 09:01:35,867 INFO L290 TraceCheckUtils]: 76: Hoare triple {24576#false} assume 5 == ~blastFlag~0; {24576#false} is VALID [2022-04-28 09:01:35,867 INFO L290 TraceCheckUtils]: 77: Hoare triple {24576#false} assume !false; {24576#false} is VALID [2022-04-28 09:01:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 09:01:35,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:35,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125645474] [2022-04-28 09:01:35,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125645474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:35,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:35,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:35,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:35,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566040905] [2022-04-28 09:01:35,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566040905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:35,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:35,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:35,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022698930] [2022-04-28 09:01:35,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:35,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 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 78 [2022-04-28 09:01:35,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:35,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:35,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:35,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:35,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:35,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:35,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:01:35,928 INFO L87 Difference]: Start difference. First operand 500 states and 775 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:37,950 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:39,343 INFO L93 Difference]: Finished difference Result 1197 states and 1828 transitions. [2022-04-28 09:01:39,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:39,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 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 78 [2022-04-28 09:01:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 09:01:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 09:01:39,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-28 09:01:39,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:39,710 INFO L225 Difference]: With dead ends: 1197 [2022-04-28 09:01:39,711 INFO L226 Difference]: Without dead ends: 710 [2022-04-28 09:01:39,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:01:39,712 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 112 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:39,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 513 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 491 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 09:01:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-04-28 09:01:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 503. [2022-04-28 09:01:39,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:39,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 710 states. Second operand has 503 states, 498 states have (on average 1.5421686746987953) internal successors, (768), 498 states have internal predecessors, (768), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:39,744 INFO L74 IsIncluded]: Start isIncluded. First operand 710 states. Second operand has 503 states, 498 states have (on average 1.5421686746987953) internal successors, (768), 498 states have internal predecessors, (768), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:39,745 INFO L87 Difference]: Start difference. First operand 710 states. Second operand has 503 states, 498 states have (on average 1.5421686746987953) internal successors, (768), 498 states have internal predecessors, (768), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:39,766 INFO L93 Difference]: Finished difference Result 710 states and 1063 transitions. [2022-04-28 09:01:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1063 transitions. [2022-04-28 09:01:39,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:39,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:39,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 503 states, 498 states have (on average 1.5421686746987953) internal successors, (768), 498 states have internal predecessors, (768), 3 states have call successors, (3), 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 710 states. [2022-04-28 09:01:39,770 INFO L87 Difference]: Start difference. First operand has 503 states, 498 states have (on average 1.5421686746987953) internal successors, (768), 498 states have internal predecessors, (768), 3 states have call successors, (3), 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 710 states. [2022-04-28 09:01:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:39,785 INFO L93 Difference]: Finished difference Result 710 states and 1063 transitions. [2022-04-28 09:01:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1063 transitions. [2022-04-28 09:01:39,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:39,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:39,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:39,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 498 states have (on average 1.5421686746987953) internal successors, (768), 498 states have internal predecessors, (768), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 772 transitions. [2022-04-28 09:01:39,799 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 772 transitions. Word has length 78 [2022-04-28 09:01:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:39,799 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 772 transitions. [2022-04-28 09:01:39,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:39,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 503 states and 772 transitions. [2022-04-28 09:01:40,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 772 edges. 772 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 772 transitions. [2022-04-28 09:01:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 09:01:40,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:40,463 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-04-28 09:01:40,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 09:01:40,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:40,464 INFO L85 PathProgramCache]: Analyzing trace with hash -332605162, now seen corresponding path program 1 times [2022-04-28 09:01:40,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:40,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2108978764] [2022-04-28 09:01:42,596 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash -332605162, now seen corresponding path program 2 times [2022-04-28 09:01:42,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:42,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280515580] [2022-04-28 09:01:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:42,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:42,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:42,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {29414#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {29407#true} is VALID [2022-04-28 09:01:42,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {29407#true} assume true; {29407#true} is VALID [2022-04-28 09:01:42,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29407#true} {29407#true} #591#return; {29407#true} is VALID [2022-04-28 09:01:42,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {29407#true} call ULTIMATE.init(); {29414#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:42,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {29414#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {29407#true} is VALID [2022-04-28 09:01:42,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {29407#true} assume true; {29407#true} is VALID [2022-04-28 09:01:42,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29407#true} {29407#true} #591#return; {29407#true} is VALID [2022-04-28 09:01:42,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {29407#true} call #t~ret159 := main(); {29407#true} is VALID [2022-04-28 09:01:42,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {29407#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {29407#true} is VALID [2022-04-28 09:01:42,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {29407#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {29407#true} is VALID [2022-04-28 09:01:42,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {29407#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {29407#true} is VALID [2022-04-28 09:01:42,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {29407#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {29407#true} is VALID [2022-04-28 09:01:42,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {29407#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {29407#true} is VALID [2022-04-28 09:01:42,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {29407#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29407#true} is VALID [2022-04-28 09:01:42,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {29407#true} assume !false; {29407#true} is VALID [2022-04-28 09:01:42,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {29407#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {29407#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {29407#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {29407#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {29407#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {29407#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {29407#true} assume 4368 == #t~mem48;havoc #t~mem48; {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {29407#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {29407#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {29407#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {29407#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {29407#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {29407#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {29407#true} ~skip~0 := 0; {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {29407#true} assume !false; {29407#true} is VALID [2022-04-28 09:01:42,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {29407#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {29407#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {29407#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {29407#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {29407#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {29407#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {29407#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {29407#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {29407#true} assume 4384 == #t~mem50;havoc #t~mem50; {29407#true} is VALID [2022-04-28 09:01:42,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {29407#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {29407#true} is VALID [2022-04-28 09:01:42,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {29407#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {29407#true} is VALID [2022-04-28 09:01:42,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {29407#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {29407#true} is VALID [2022-04-28 09:01:42,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {29407#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 09:01:42,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 09:01:42,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 09:01:42,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 09:01:42,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} ~skip~0 := 0; {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 09:01:42,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !false; {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 09:01:42,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 09:01:42,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 09:01:42,780 INFO L290 TraceCheckUtils]: 47: Hoare triple {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 09:01:42,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 09:01:42,780 INFO L290 TraceCheckUtils]: 49: Hoare triple {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 09:01:42,781 INFO L290 TraceCheckUtils]: 50: Hoare triple {29412#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {29413#(not (= |ssl3_connect_#t~mem48| 4368))} is VALID [2022-04-28 09:01:42,781 INFO L290 TraceCheckUtils]: 51: Hoare triple {29413#(not (= |ssl3_connect_#t~mem48| 4368))} assume 4368 == #t~mem48;havoc #t~mem48; {29408#false} is VALID [2022-04-28 09:01:42,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {29408#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {29408#false} is VALID [2022-04-28 09:01:42,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {29408#false} assume !(0 == ~blastFlag~0); {29408#false} is VALID [2022-04-28 09:01:42,781 INFO L290 TraceCheckUtils]: 54: Hoare triple {29408#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {29408#false} is VALID [2022-04-28 09:01:42,781 INFO L290 TraceCheckUtils]: 55: Hoare triple {29408#false} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {29408#false} is VALID [2022-04-28 09:01:42,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {29408#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {29408#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 58: Hoare triple {29408#false} ~skip~0 := 0; {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 59: Hoare triple {29408#false} assume !false; {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 60: Hoare triple {29408#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {29408#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {29408#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {29408#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 64: Hoare triple {29408#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {29408#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {29408#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {29408#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {29408#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 69: Hoare triple {29408#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,782 INFO L290 TraceCheckUtils]: 70: Hoare triple {29408#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,783 INFO L290 TraceCheckUtils]: 71: Hoare triple {29408#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {29408#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,783 INFO L290 TraceCheckUtils]: 73: Hoare triple {29408#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {29408#false} is VALID [2022-04-28 09:01:42,783 INFO L290 TraceCheckUtils]: 74: Hoare triple {29408#false} assume 4432 == #t~mem56;havoc #t~mem56; {29408#false} is VALID [2022-04-28 09:01:42,783 INFO L290 TraceCheckUtils]: 75: Hoare triple {29408#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {29408#false} is VALID [2022-04-28 09:01:42,783 INFO L290 TraceCheckUtils]: 76: Hoare triple {29408#false} assume 5 == ~blastFlag~0; {29408#false} is VALID [2022-04-28 09:01:42,783 INFO L290 TraceCheckUtils]: 77: Hoare triple {29408#false} assume !false; {29408#false} is VALID [2022-04-28 09:01:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 09:01:42,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:42,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280515580] [2022-04-28 09:01:42,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280515580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:42,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:42,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:42,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:42,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2108978764] [2022-04-28 09:01:42,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2108978764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:42,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:42,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:42,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557235949] [2022-04-28 09:01:42,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:42,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 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 78 [2022-04-28 09:01:42,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:42,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:42,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:42,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:42,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:42,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:42,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:01:42,842 INFO L87 Difference]: Start difference. First operand 503 states and 772 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:44,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:45,931 INFO L93 Difference]: Finished difference Result 1088 states and 1652 transitions. [2022-04-28 09:01:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:45,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 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 78 [2022-04-28 09:01:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 09:01:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 09:01:45,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-28 09:01:46,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:46,271 INFO L225 Difference]: With dead ends: 1088 [2022-04-28 09:01:46,271 INFO L226 Difference]: Without dead ends: 776 [2022-04-28 09:01:46,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:01:46,273 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 115 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:46,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 316 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 401 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 09:01:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-04-28 09:01:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 551. [2022-04-28 09:01:46,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:46,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 776 states. Second operand has 551 states, 546 states have (on average 1.5366300366300367) internal successors, (839), 546 states have internal predecessors, (839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:46,298 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand has 551 states, 546 states have (on average 1.5366300366300367) internal successors, (839), 546 states have internal predecessors, (839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:46,298 INFO L87 Difference]: Start difference. First operand 776 states. Second operand has 551 states, 546 states have (on average 1.5366300366300367) internal successors, (839), 546 states have internal predecessors, (839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:46,317 INFO L93 Difference]: Finished difference Result 776 states and 1165 transitions. [2022-04-28 09:01:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1165 transitions. [2022-04-28 09:01:46,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:46,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:46,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.5366300366300367) internal successors, (839), 546 states have internal predecessors, (839), 3 states have call successors, (3), 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 776 states. [2022-04-28 09:01:46,320 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.5366300366300367) internal successors, (839), 546 states have internal predecessors, (839), 3 states have call successors, (3), 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 776 states. [2022-04-28 09:01:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:46,339 INFO L93 Difference]: Finished difference Result 776 states and 1165 transitions. [2022-04-28 09:01:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1165 transitions. [2022-04-28 09:01:46,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:46,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:46,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:46,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.5366300366300367) internal successors, (839), 546 states have internal predecessors, (839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 843 transitions. [2022-04-28 09:01:46,353 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 843 transitions. Word has length 78 [2022-04-28 09:01:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:46,353 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 843 transitions. [2022-04-28 09:01:46,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:46,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 843 transitions. [2022-04-28 09:01:47,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 843 edges. 843 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:47,064 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 843 transitions. [2022-04-28 09:01:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 09:01:47,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:47,065 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-28 09:01:47,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 09:01:47,065 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1110908818, now seen corresponding path program 1 times [2022-04-28 09:01:47,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:47,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1451657808] [2022-04-28 09:01:47,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:47,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1110908818, now seen corresponding path program 2 times [2022-04-28 09:01:47,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:47,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186961739] [2022-04-28 09:01:47,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:47,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:47,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:47,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {34256#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {34249#true} is VALID [2022-04-28 09:01:47,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {34249#true} assume true; {34249#true} is VALID [2022-04-28 09:01:47,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34249#true} {34249#true} #591#return; {34249#true} is VALID [2022-04-28 09:01:47,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {34249#true} call ULTIMATE.init(); {34256#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:47,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {34256#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {34249#true} is VALID [2022-04-28 09:01:47,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {34249#true} assume true; {34249#true} is VALID [2022-04-28 09:01:47,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34249#true} {34249#true} #591#return; {34249#true} is VALID [2022-04-28 09:01:47,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {34249#true} call #t~ret159 := main(); {34249#true} is VALID [2022-04-28 09:01:47,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {34249#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L272 TraceCheckUtils]: 6: Hoare triple {34249#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {34249#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {34249#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {34249#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {34249#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {34249#true} assume !false; {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {34249#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {34249#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {34249#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {34249#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {34249#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {34249#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {34249#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {34249#true} assume 4369 == #t~mem49;havoc #t~mem49; {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {34249#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {34249#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {34249#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {34249#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {34249#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {34249#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {34249#true} ~skip~0 := 0; {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {34249#true} assume !false; {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {34249#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {34249#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {34249#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {34249#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {34249#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {34249#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {34249#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {34249#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {34249#true} assume 4384 == #t~mem50;havoc #t~mem50; {34249#true} is VALID [2022-04-28 09:01:47,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {34249#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {34249#true} is VALID [2022-04-28 09:01:47,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {34249#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {34249#true} is VALID [2022-04-28 09:01:47,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {34249#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {34249#true} is VALID [2022-04-28 09:01:47,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {34249#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:47,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:47,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:47,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:47,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} ~skip~0 := 0; {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:47,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !false; {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:47,212 INFO L290 TraceCheckUtils]: 46: Hoare triple {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:47,212 INFO L290 TraceCheckUtils]: 47: Hoare triple {34254#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {34255#(= |ssl3_connect_#t~mem44| 4560)} is VALID [2022-04-28 09:01:47,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {34255#(= |ssl3_connect_#t~mem44| 4560)} assume 16384 == #t~mem44;havoc #t~mem44; {34250#false} is VALID [2022-04-28 09:01:47,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {34250#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {34250#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {34250#false} is VALID [2022-04-28 09:01:47,213 INFO L290 TraceCheckUtils]: 51: Hoare triple {34250#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {34250#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {34250#false} is VALID [2022-04-28 09:01:47,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {34250#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {34250#false} is VALID [2022-04-28 09:01:47,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {34250#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {34250#false} is VALID [2022-04-28 09:01:47,213 INFO L290 TraceCheckUtils]: 55: Hoare triple {34250#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {34250#false} is VALID [2022-04-28 09:01:47,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {34250#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,213 INFO L290 TraceCheckUtils]: 57: Hoare triple {34250#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {34250#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {34250#false} is VALID [2022-04-28 09:01:47,214 INFO L290 TraceCheckUtils]: 59: Hoare triple {34250#false} ~skip~0 := 0; {34250#false} is VALID [2022-04-28 09:01:47,214 INFO L290 TraceCheckUtils]: 60: Hoare triple {34250#false} assume !false; {34250#false} is VALID [2022-04-28 09:01:47,214 INFO L290 TraceCheckUtils]: 61: Hoare triple {34250#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,214 INFO L290 TraceCheckUtils]: 62: Hoare triple {34250#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,214 INFO L290 TraceCheckUtils]: 63: Hoare triple {34250#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,214 INFO L290 TraceCheckUtils]: 64: Hoare triple {34250#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,214 INFO L290 TraceCheckUtils]: 65: Hoare triple {34250#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,214 INFO L290 TraceCheckUtils]: 66: Hoare triple {34250#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,214 INFO L290 TraceCheckUtils]: 67: Hoare triple {34250#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,214 INFO L290 TraceCheckUtils]: 68: Hoare triple {34250#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,215 INFO L290 TraceCheckUtils]: 69: Hoare triple {34250#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,215 INFO L290 TraceCheckUtils]: 70: Hoare triple {34250#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,215 INFO L290 TraceCheckUtils]: 71: Hoare triple {34250#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,215 INFO L290 TraceCheckUtils]: 72: Hoare triple {34250#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,215 INFO L290 TraceCheckUtils]: 73: Hoare triple {34250#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,215 INFO L290 TraceCheckUtils]: 74: Hoare triple {34250#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {34250#false} is VALID [2022-04-28 09:01:47,215 INFO L290 TraceCheckUtils]: 75: Hoare triple {34250#false} assume 4432 == #t~mem56;havoc #t~mem56; {34250#false} is VALID [2022-04-28 09:01:47,215 INFO L290 TraceCheckUtils]: 76: Hoare triple {34250#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {34250#false} is VALID [2022-04-28 09:01:47,215 INFO L290 TraceCheckUtils]: 77: Hoare triple {34250#false} assume 5 == ~blastFlag~0; {34250#false} is VALID [2022-04-28 09:01:47,215 INFO L290 TraceCheckUtils]: 78: Hoare triple {34250#false} assume !false; {34250#false} is VALID [2022-04-28 09:01:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:01:47,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:47,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186961739] [2022-04-28 09:01:47,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186961739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:47,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:47,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:47,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:47,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1451657808] [2022-04-28 09:01:47,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1451657808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:47,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:47,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:47,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494724075] [2022-04-28 09:01:47,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:47,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 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 79 [2022-04-28 09:01:47,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:47,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:47,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:47,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:47,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:47,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:01:47,272 INFO L87 Difference]: Start difference. First operand 551 states and 843 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:49,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:50,650 INFO L93 Difference]: Finished difference Result 1202 states and 1827 transitions. [2022-04-28 09:01:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:50,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 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 79 [2022-04-28 09:01:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 09:01:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 09:01:50,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-28 09:01:50,963 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-28 09:01:50,980 INFO L225 Difference]: With dead ends: 1202 [2022-04-28 09:01:50,980 INFO L226 Difference]: Without dead ends: 667 [2022-04-28 09:01:50,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:01:50,982 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 96 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:50,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 558 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 521 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 09:01:50,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-04-28 09:01:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 551. [2022-04-28 09:01:51,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:51,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 551 states, 546 states have (on average 1.532967032967033) internal successors, (837), 546 states have internal predecessors, (837), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:51,006 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 551 states, 546 states have (on average 1.532967032967033) internal successors, (837), 546 states have internal predecessors, (837), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:51,007 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 551 states, 546 states have (on average 1.532967032967033) internal successors, (837), 546 states have internal predecessors, (837), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:51,020 INFO L93 Difference]: Finished difference Result 667 states and 1003 transitions. [2022-04-28 09:01:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1003 transitions. [2022-04-28 09:01:51,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:51,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:51,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.532967032967033) internal successors, (837), 546 states have internal predecessors, (837), 3 states have call successors, (3), 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 667 states. [2022-04-28 09:01:51,022 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.532967032967033) internal successors, (837), 546 states have internal predecessors, (837), 3 states have call successors, (3), 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 667 states. [2022-04-28 09:01:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:51,036 INFO L93 Difference]: Finished difference Result 667 states and 1003 transitions. [2022-04-28 09:01:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1003 transitions. [2022-04-28 09:01:51,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:51,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:51,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:51,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.532967032967033) internal successors, (837), 546 states have internal predecessors, (837), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 841 transitions. [2022-04-28 09:01:51,051 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 841 transitions. Word has length 79 [2022-04-28 09:01:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:51,051 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 841 transitions. [2022-04-28 09:01:51,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:51,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 841 transitions. [2022-04-28 09:01:51,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 841 edges. 841 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 841 transitions. [2022-04-28 09:01:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 09:01:51,783 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:51,783 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-28 09:01:51,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 09:01:51,783 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -734458348, now seen corresponding path program 1 times [2022-04-28 09:01:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:51,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [742224854] [2022-04-28 09:01:51,784 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash -734458348, now seen corresponding path program 2 times [2022-04-28 09:01:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:51,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959399380] [2022-04-28 09:01:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:51,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:51,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {39108#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {39101#true} is VALID [2022-04-28 09:01:51,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {39101#true} assume true; {39101#true} is VALID [2022-04-28 09:01:51,918 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39101#true} {39101#true} #591#return; {39101#true} is VALID [2022-04-28 09:01:51,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {39101#true} call ULTIMATE.init(); {39108#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:51,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {39108#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {39101#true} is VALID [2022-04-28 09:01:51,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {39101#true} assume true; {39101#true} is VALID [2022-04-28 09:01:51,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39101#true} {39101#true} #591#return; {39101#true} is VALID [2022-04-28 09:01:51,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {39101#true} call #t~ret159 := main(); {39101#true} is VALID [2022-04-28 09:01:51,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {39101#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {39101#true} is VALID [2022-04-28 09:01:51,919 INFO L272 TraceCheckUtils]: 6: Hoare triple {39101#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {39101#true} is VALID [2022-04-28 09:01:51,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {39101#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {39101#true} is VALID [2022-04-28 09:01:51,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {39101#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {39101#true} is VALID [2022-04-28 09:01:51,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {39101#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {39101#true} is VALID [2022-04-28 09:01:51,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {39101#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {39101#true} is VALID [2022-04-28 09:01:51,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {39101#true} assume !false; {39101#true} is VALID [2022-04-28 09:01:51,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {39101#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {39101#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {39101#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {39101#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {39101#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {39101#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {39101#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {39101#true} assume 4369 == #t~mem49;havoc #t~mem49; {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {39101#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {39101#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {39101#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {39101#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {39101#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {39101#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {39101#true} ~skip~0 := 0; {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {39101#true} assume !false; {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {39101#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {39101#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {39101#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {39101#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {39101#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {39101#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {39101#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {39101#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {39101#true} assume 4384 == #t~mem50;havoc #t~mem50; {39101#true} is VALID [2022-04-28 09:01:51,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {39101#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {39101#true} is VALID [2022-04-28 09:01:51,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {39101#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {39101#true} is VALID [2022-04-28 09:01:51,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {39101#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {39101#true} is VALID [2022-04-28 09:01:51,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {39101#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 09:01:51,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 09:01:51,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 09:01:51,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 09:01:51,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} ~skip~0 := 0; {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 09:01:51,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} assume !false; {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 09:01:51,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 09:01:51,937 INFO L290 TraceCheckUtils]: 47: Hoare triple {39106#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {39107#(not (= |ssl3_connect_#t~mem44| 16384))} is VALID [2022-04-28 09:01:51,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {39107#(not (= |ssl3_connect_#t~mem44| 16384))} assume 16384 == #t~mem44;havoc #t~mem44; {39102#false} is VALID [2022-04-28 09:01:51,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {39102#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,938 INFO L290 TraceCheckUtils]: 50: Hoare triple {39102#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {39102#false} is VALID [2022-04-28 09:01:51,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {39102#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {39102#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {39102#false} is VALID [2022-04-28 09:01:51,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {39102#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {39102#false} is VALID [2022-04-28 09:01:51,938 INFO L290 TraceCheckUtils]: 54: Hoare triple {39102#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {39102#false} is VALID [2022-04-28 09:01:51,938 INFO L290 TraceCheckUtils]: 55: Hoare triple {39102#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {39102#false} is VALID [2022-04-28 09:01:51,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {39102#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {39102#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {39102#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {39102#false} ~skip~0 := 0; {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {39102#false} assume !false; {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 61: Hoare triple {39102#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 62: Hoare triple {39102#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 63: Hoare triple {39102#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 64: Hoare triple {39102#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 65: Hoare triple {39102#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 66: Hoare triple {39102#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 67: Hoare triple {39102#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 68: Hoare triple {39102#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 69: Hoare triple {39102#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 70: Hoare triple {39102#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,939 INFO L290 TraceCheckUtils]: 71: Hoare triple {39102#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,940 INFO L290 TraceCheckUtils]: 72: Hoare triple {39102#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {39102#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,940 INFO L290 TraceCheckUtils]: 74: Hoare triple {39102#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {39102#false} is VALID [2022-04-28 09:01:51,940 INFO L290 TraceCheckUtils]: 75: Hoare triple {39102#false} assume 4432 == #t~mem56;havoc #t~mem56; {39102#false} is VALID [2022-04-28 09:01:51,940 INFO L290 TraceCheckUtils]: 76: Hoare triple {39102#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {39102#false} is VALID [2022-04-28 09:01:51,940 INFO L290 TraceCheckUtils]: 77: Hoare triple {39102#false} assume 5 == ~blastFlag~0; {39102#false} is VALID [2022-04-28 09:01:51,940 INFO L290 TraceCheckUtils]: 78: Hoare triple {39102#false} assume !false; {39102#false} is VALID [2022-04-28 09:01:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:01:51,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:51,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959399380] [2022-04-28 09:01:51,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959399380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:51,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:51,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:51,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:51,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [742224854] [2022-04-28 09:01:51,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [742224854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:51,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:51,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435159314] [2022-04-28 09:01:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 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 79 [2022-04-28 09:01:51,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:51,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:51,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:51,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:51,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:51,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:01:51,999 INFO L87 Difference]: Start difference. First operand 551 states and 841 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:54,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:55,073 INFO L93 Difference]: Finished difference Result 1278 states and 1923 transitions. [2022-04-28 09:01:55,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 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 79 [2022-04-28 09:01:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 09:01:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 09:01:55,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-28 09:01:55,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:55,412 INFO L225 Difference]: With dead ends: 1278 [2022-04-28 09:01:55,412 INFO L226 Difference]: Without dead ends: 743 [2022-04-28 09:01:55,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:01:55,413 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 119 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:55,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 09:01:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-04-28 09:01:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 551. [2022-04-28 09:01:55,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:55,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 743 states. Second operand has 551 states, 546 states have (on average 1.5183150183150182) internal successors, (829), 546 states have internal predecessors, (829), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,439 INFO L74 IsIncluded]: Start isIncluded. First operand 743 states. Second operand has 551 states, 546 states have (on average 1.5183150183150182) internal successors, (829), 546 states have internal predecessors, (829), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,439 INFO L87 Difference]: Start difference. First operand 743 states. Second operand has 551 states, 546 states have (on average 1.5183150183150182) internal successors, (829), 546 states have internal predecessors, (829), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:55,456 INFO L93 Difference]: Finished difference Result 743 states and 1095 transitions. [2022-04-28 09:01:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1095 transitions. [2022-04-28 09:01:55,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:55,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:55,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.5183150183150182) internal successors, (829), 546 states have internal predecessors, (829), 3 states have call successors, (3), 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 743 states. [2022-04-28 09:01:55,458 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.5183150183150182) internal successors, (829), 546 states have internal predecessors, (829), 3 states have call successors, (3), 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 743 states. [2022-04-28 09:01:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:55,474 INFO L93 Difference]: Finished difference Result 743 states and 1095 transitions. [2022-04-28 09:01:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1095 transitions. [2022-04-28 09:01:55,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:55,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:55,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:55,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.5183150183150182) internal successors, (829), 546 states have internal predecessors, (829), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 833 transitions. [2022-04-28 09:01:55,488 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 833 transitions. Word has length 79 [2022-04-28 09:01:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:55,488 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 833 transitions. [2022-04-28 09:01:55,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:55,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 833 transitions. [2022-04-28 09:01:56,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 833 edges. 833 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 833 transitions. [2022-04-28 09:01:56,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 09:01:56,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:56,214 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-28 09:01:56,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 09:01:56,215 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:56,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2089376307, now seen corresponding path program 1 times [2022-04-28 09:01:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:56,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1455137350] [2022-04-28 09:01:56,216 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2089376307, now seen corresponding path program 2 times [2022-04-28 09:01:56,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:56,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027323835] [2022-04-28 09:01:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:56,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:56,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {44264#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {44257#true} is VALID [2022-04-28 09:01:56,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {44257#true} assume true; {44257#true} is VALID [2022-04-28 09:01:56,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44257#true} {44257#true} #591#return; {44257#true} is VALID [2022-04-28 09:01:56,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {44257#true} call ULTIMATE.init(); {44264#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:56,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {44264#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {44257#true} is VALID [2022-04-28 09:01:56,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {44257#true} assume true; {44257#true} is VALID [2022-04-28 09:01:56,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44257#true} {44257#true} #591#return; {44257#true} is VALID [2022-04-28 09:01:56,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {44257#true} call #t~ret159 := main(); {44257#true} is VALID [2022-04-28 09:01:56,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {44257#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {44257#true} is VALID [2022-04-28 09:01:56,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {44257#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {44257#true} is VALID [2022-04-28 09:01:56,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {44257#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {44257#true} is VALID [2022-04-28 09:01:56,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {44257#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {44257#true} is VALID [2022-04-28 09:01:56,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {44257#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {44257#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {44257#true} assume !false; {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {44257#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {44257#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {44257#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {44257#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {44257#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {44257#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {44257#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {44257#true} assume 4369 == #t~mem49;havoc #t~mem49; {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {44257#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {44257#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44257#true} is VALID [2022-04-28 09:01:56,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {44257#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {44257#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {44257#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {44257#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {44257#true} ~skip~0 := 0; {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {44257#true} assume !false; {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {44257#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {44257#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {44257#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {44257#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {44257#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {44257#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {44257#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {44257#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {44257#true} assume 4384 == #t~mem50;havoc #t~mem50; {44257#true} is VALID [2022-04-28 09:01:56,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {44257#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {44257#true} is VALID [2022-04-28 09:01:56,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {44257#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44257#true} is VALID [2022-04-28 09:01:56,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {44257#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {44257#true} is VALID [2022-04-28 09:01:56,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {44257#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:56,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:56,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:56,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:56,344 INFO L290 TraceCheckUtils]: 44: Hoare triple {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} ~skip~0 := 0; {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:56,344 INFO L290 TraceCheckUtils]: 45: Hoare triple {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !false; {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:56,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:56,345 INFO L290 TraceCheckUtils]: 47: Hoare triple {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:01:56,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {44262#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {44263#(= |ssl3_connect_#t~mem45| 4560)} is VALID [2022-04-28 09:01:56,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {44263#(= |ssl3_connect_#t~mem45| 4560)} assume 4096 == #t~mem45;havoc #t~mem45; {44258#false} is VALID [2022-04-28 09:01:56,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {44258#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {44258#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {44258#false} is VALID [2022-04-28 09:01:56,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {44258#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {44258#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 54: Hoare triple {44258#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 55: Hoare triple {44258#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 56: Hoare triple {44258#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 57: Hoare triple {44258#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 58: Hoare triple {44258#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 59: Hoare triple {44258#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 60: Hoare triple {44258#false} ~skip~0 := 0; {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 61: Hoare triple {44258#false} assume !false; {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {44258#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {44258#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 64: Hoare triple {44258#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {44258#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {44258#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 67: Hoare triple {44258#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 68: Hoare triple {44258#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 69: Hoare triple {44258#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {44258#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 71: Hoare triple {44258#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 72: Hoare triple {44258#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 73: Hoare triple {44258#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 74: Hoare triple {44258#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 75: Hoare triple {44258#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 76: Hoare triple {44258#false} assume 4432 == #t~mem56;havoc #t~mem56; {44258#false} is VALID [2022-04-28 09:01:56,347 INFO L290 TraceCheckUtils]: 77: Hoare triple {44258#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {44258#false} is VALID [2022-04-28 09:01:56,348 INFO L290 TraceCheckUtils]: 78: Hoare triple {44258#false} assume 5 == ~blastFlag~0; {44258#false} is VALID [2022-04-28 09:01:56,348 INFO L290 TraceCheckUtils]: 79: Hoare triple {44258#false} assume !false; {44258#false} is VALID [2022-04-28 09:01:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:01:56,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:56,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027323835] [2022-04-28 09:01:56,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027323835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:56,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:56,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:56,348 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:56,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1455137350] [2022-04-28 09:01:56,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1455137350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:56,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:56,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347810105] [2022-04-28 09:01:56,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:56,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 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-28 09:01:56,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:56,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:56,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:56,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:56,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:56,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:56,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:01:56,398 INFO L87 Difference]: Start difference. First operand 551 states and 833 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:58,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:01:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:59,758 INFO L93 Difference]: Finished difference Result 1202 states and 1807 transitions. [2022-04-28 09:01:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:59,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 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-28 09:01:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-28 09:01:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-28 09:01:59,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 462 transitions. [2022-04-28 09:02:00,050 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-28 09:02:00,066 INFO L225 Difference]: With dead ends: 1202 [2022-04-28 09:02:00,066 INFO L226 Difference]: Without dead ends: 667 [2022-04-28 09:02:00,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:02:00,068 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 94 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:00,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 556 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 520 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 09:02:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-04-28 09:02:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 551. [2022-04-28 09:02:00,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:00,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 551 states, 546 states have (on average 1.5146520146520146) internal successors, (827), 546 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:00,109 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 551 states, 546 states have (on average 1.5146520146520146) internal successors, (827), 546 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:00,109 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 551 states, 546 states have (on average 1.5146520146520146) internal successors, (827), 546 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:00,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:00,122 INFO L93 Difference]: Finished difference Result 667 states and 993 transitions. [2022-04-28 09:02:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 993 transitions. [2022-04-28 09:02:00,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:00,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:00,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.5146520146520146) internal successors, (827), 546 states have internal predecessors, (827), 3 states have call successors, (3), 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 667 states. [2022-04-28 09:02:00,124 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.5146520146520146) internal successors, (827), 546 states have internal predecessors, (827), 3 states have call successors, (3), 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 667 states. [2022-04-28 09:02:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:00,138 INFO L93 Difference]: Finished difference Result 667 states and 993 transitions. [2022-04-28 09:02:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 993 transitions. [2022-04-28 09:02:00,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:00,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:00,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:00,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.5146520146520146) internal successors, (827), 546 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 831 transitions. [2022-04-28 09:02:00,152 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 831 transitions. Word has length 80 [2022-04-28 09:02:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:00,152 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 831 transitions. [2022-04-28 09:02:00,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:00,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 831 transitions. [2022-04-28 09:02:00,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 831 edges. 831 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 831 transitions. [2022-04-28 09:02:00,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 09:02:00,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:00,861 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:00,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 09:02:00,861 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:00,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash -33367760, now seen corresponding path program 1 times [2022-04-28 09:02:00,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:00,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1985817129] [2022-04-28 09:02:02,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash -33367760, now seen corresponding path program 2 times [2022-04-28 09:02:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:02,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094259478] [2022-04-28 09:02:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:02,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:03,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {49116#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {49109#true} is VALID [2022-04-28 09:02:03,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {49109#true} assume true; {49109#true} is VALID [2022-04-28 09:02:03,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49109#true} {49109#true} #591#return; {49109#true} is VALID [2022-04-28 09:02:03,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {49109#true} call ULTIMATE.init(); {49116#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:03,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {49116#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {49109#true} is VALID [2022-04-28 09:02:03,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {49109#true} assume true; {49109#true} is VALID [2022-04-28 09:02:03,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49109#true} {49109#true} #591#return; {49109#true} is VALID [2022-04-28 09:02:03,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {49109#true} call #t~ret159 := main(); {49109#true} is VALID [2022-04-28 09:02:03,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {49109#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {49109#true} is VALID [2022-04-28 09:02:03,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {49109#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {49109#true} is VALID [2022-04-28 09:02:03,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {49109#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {49109#true} is VALID [2022-04-28 09:02:03,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {49109#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {49109#true} is VALID [2022-04-28 09:02:03,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {49109#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {49109#true} is VALID [2022-04-28 09:02:03,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {49109#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {49109#true} is VALID [2022-04-28 09:02:03,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {49109#true} assume !false; {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {49109#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {49109#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {49109#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {49109#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {49109#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {49109#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {49109#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {49109#true} assume 4369 == #t~mem49;havoc #t~mem49; {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {49109#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {49109#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {49109#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {49109#true} is VALID [2022-04-28 09:02:03,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {49109#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {49109#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {49109#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {49109#true} ~skip~0 := 0; {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {49109#true} assume !false; {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {49109#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {49109#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {49109#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {49109#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {49109#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {49109#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {49109#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {49109#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {49109#true} assume 4384 == #t~mem50;havoc #t~mem50; {49109#true} is VALID [2022-04-28 09:02:03,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {49109#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {49109#true} is VALID [2022-04-28 09:02:03,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {49109#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {49109#true} is VALID [2022-04-28 09:02:03,102 INFO L290 TraceCheckUtils]: 39: Hoare triple {49109#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {49109#true} is VALID [2022-04-28 09:02:03,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {49109#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} ~skip~0 := 0; {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !false; {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,106 INFO L290 TraceCheckUtils]: 50: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,106 INFO L290 TraceCheckUtils]: 51: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:02:03,106 INFO L290 TraceCheckUtils]: 52: Hoare triple {49114#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {49115#(= |ssl3_connect_#t~mem49| 4560)} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {49115#(= |ssl3_connect_#t~mem49| 4560)} assume 4369 == #t~mem49;havoc #t~mem49; {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 54: Hoare triple {49110#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 55: Hoare triple {49110#false} assume !(0 == ~blastFlag~0); {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {49110#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {49110#false} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {49110#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 59: Hoare triple {49110#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 60: Hoare triple {49110#false} ~skip~0 := 0; {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 61: Hoare triple {49110#false} assume !false; {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {49110#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 63: Hoare triple {49110#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 64: Hoare triple {49110#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,107 INFO L290 TraceCheckUtils]: 65: Hoare triple {49110#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 66: Hoare triple {49110#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 67: Hoare triple {49110#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 68: Hoare triple {49110#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 69: Hoare triple {49110#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 70: Hoare triple {49110#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {49110#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 72: Hoare triple {49110#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 73: Hoare triple {49110#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 74: Hoare triple {49110#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 75: Hoare triple {49110#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 76: Hoare triple {49110#false} assume 4432 == #t~mem56;havoc #t~mem56; {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 77: Hoare triple {49110#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {49110#false} is VALID [2022-04-28 09:02:03,108 INFO L290 TraceCheckUtils]: 78: Hoare triple {49110#false} assume 5 == ~blastFlag~0; {49110#false} is VALID [2022-04-28 09:02:03,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {49110#false} assume !false; {49110#false} is VALID [2022-04-28 09:02:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:02:03,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:03,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094259478] [2022-04-28 09:02:03,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094259478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:03,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:03,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:02:03,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:03,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1985817129] [2022-04-28 09:02:03,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1985817129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:03,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:03,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:02:03,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973620767] [2022-04-28 09:02:03,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:03,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 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-28 09:02:03,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:03,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:03,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:03,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:02:03,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:03,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:02:03,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:02:03,168 INFO L87 Difference]: Start difference. First operand 551 states and 831 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:06,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:02:08,819 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:02:10,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:02:12,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:02:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:14,125 INFO L93 Difference]: Finished difference Result 1005 states and 1507 transitions. [2022-04-28 09:02:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:02:14,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 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-28 09:02:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-28 09:02:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-28 09:02:14,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 457 transitions. [2022-04-28 09:02:14,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:14,438 INFO L225 Difference]: With dead ends: 1005 [2022-04-28 09:02:14,438 INFO L226 Difference]: Without dead ends: 661 [2022-04-28 09:02:14,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:02:14,439 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 87 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:14,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 550 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 511 Invalid, 3 Unknown, 0 Unchecked, 8.1s Time] [2022-04-28 09:02:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-04-28 09:02:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 551. [2022-04-28 09:02:14,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:14,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 661 states. Second operand has 551 states, 546 states have (on average 1.510989010989011) internal successors, (825), 546 states have internal predecessors, (825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:14,465 INFO L74 IsIncluded]: Start isIncluded. First operand 661 states. Second operand has 551 states, 546 states have (on average 1.510989010989011) internal successors, (825), 546 states have internal predecessors, (825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:14,465 INFO L87 Difference]: Start difference. First operand 661 states. Second operand has 551 states, 546 states have (on average 1.510989010989011) internal successors, (825), 546 states have internal predecessors, (825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:14,478 INFO L93 Difference]: Finished difference Result 661 states and 984 transitions. [2022-04-28 09:02:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 984 transitions. [2022-04-28 09:02:14,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:14,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:14,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.510989010989011) internal successors, (825), 546 states have internal predecessors, (825), 3 states have call successors, (3), 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 661 states. [2022-04-28 09:02:14,480 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.510989010989011) internal successors, (825), 546 states have internal predecessors, (825), 3 states have call successors, (3), 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 661 states. [2022-04-28 09:02:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:14,492 INFO L93 Difference]: Finished difference Result 661 states and 984 transitions. [2022-04-28 09:02:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 984 transitions. [2022-04-28 09:02:14,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:14,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:14,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:14,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.510989010989011) internal successors, (825), 546 states have internal predecessors, (825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 829 transitions. [2022-04-28 09:02:14,506 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 829 transitions. Word has length 80 [2022-04-28 09:02:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:14,506 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 829 transitions. [2022-04-28 09:02:14,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:14,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 829 transitions. [2022-04-28 09:02:15,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 829 edges. 829 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 829 transitions. [2022-04-28 09:02:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 09:02:15,237 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:15,237 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-28 09:02:15,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 09:02:15,238 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:15,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash 833783691, now seen corresponding path program 1 times [2022-04-28 09:02:15,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:15,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1504964297] [2022-04-28 09:02:15,238 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:15,239 INFO L85 PathProgramCache]: Analyzing trace with hash 833783691, now seen corresponding path program 2 times [2022-04-28 09:02:15,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:15,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420639039] [2022-04-28 09:02:15,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:15,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:15,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:15,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {53562#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {53555#true} is VALID [2022-04-28 09:02:15,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {53555#true} assume true; {53555#true} is VALID [2022-04-28 09:02:15,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53555#true} {53555#true} #591#return; {53555#true} is VALID [2022-04-28 09:02:15,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {53555#true} call ULTIMATE.init(); {53562#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:15,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {53562#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {53555#true} is VALID [2022-04-28 09:02:15,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {53555#true} assume true; {53555#true} is VALID [2022-04-28 09:02:15,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53555#true} {53555#true} #591#return; {53555#true} is VALID [2022-04-28 09:02:15,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {53555#true} call #t~ret159 := main(); {53555#true} is VALID [2022-04-28 09:02:15,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {53555#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {53555#true} is VALID [2022-04-28 09:02:15,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {53555#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {53555#true} is VALID [2022-04-28 09:02:15,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {53555#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {53555#true} is VALID [2022-04-28 09:02:15,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {53555#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {53555#true} is VALID [2022-04-28 09:02:15,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {53555#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {53555#true} is VALID [2022-04-28 09:02:15,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {53555#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {53555#true} is VALID [2022-04-28 09:02:15,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {53555#true} assume !false; {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {53555#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {53555#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {53555#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {53555#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {53555#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {53555#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {53555#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {53555#true} assume 4369 == #t~mem49;havoc #t~mem49; {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {53555#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {53555#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {53555#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {53555#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {53555#true} is VALID [2022-04-28 09:02:15,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {53555#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {53555#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {53555#true} ~skip~0 := 0; {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {53555#true} assume !false; {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {53555#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {53555#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {53555#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {53555#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {53555#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {53555#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {53555#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {53555#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {53555#true} assume 4384 == #t~mem50;havoc #t~mem50; {53555#true} is VALID [2022-04-28 09:02:15,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {53555#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {53555#true} is VALID [2022-04-28 09:02:15,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {53555#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {53555#true} is VALID [2022-04-28 09:02:15,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {53555#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {53555#true} is VALID [2022-04-28 09:02:15,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {53555#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 09:02:15,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 09:02:15,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 09:02:15,359 INFO L290 TraceCheckUtils]: 43: Hoare triple {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 09:02:15,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} ~skip~0 := 0; {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 09:02:15,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !false; {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 09:02:15,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 09:02:15,360 INFO L290 TraceCheckUtils]: 47: Hoare triple {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 09:02:15,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {53560#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53561#(not (= |ssl3_connect_#t~mem45| 4096))} is VALID [2022-04-28 09:02:15,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {53561#(not (= |ssl3_connect_#t~mem45| 4096))} assume 4096 == #t~mem45;havoc #t~mem45; {53556#false} is VALID [2022-04-28 09:02:15,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {53556#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,361 INFO L290 TraceCheckUtils]: 51: Hoare triple {53556#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {53556#false} is VALID [2022-04-28 09:02:15,361 INFO L290 TraceCheckUtils]: 52: Hoare triple {53556#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {53556#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {53556#false} is VALID [2022-04-28 09:02:15,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {53556#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 55: Hoare triple {53556#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {53556#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {53556#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {53556#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 59: Hoare triple {53556#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 60: Hoare triple {53556#false} ~skip~0 := 0; {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {53556#false} assume !false; {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 62: Hoare triple {53556#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 63: Hoare triple {53556#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 64: Hoare triple {53556#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 65: Hoare triple {53556#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 66: Hoare triple {53556#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 67: Hoare triple {53556#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,362 INFO L290 TraceCheckUtils]: 68: Hoare triple {53556#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,363 INFO L290 TraceCheckUtils]: 69: Hoare triple {53556#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,363 INFO L290 TraceCheckUtils]: 70: Hoare triple {53556#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,363 INFO L290 TraceCheckUtils]: 71: Hoare triple {53556#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,363 INFO L290 TraceCheckUtils]: 72: Hoare triple {53556#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,363 INFO L290 TraceCheckUtils]: 73: Hoare triple {53556#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,363 INFO L290 TraceCheckUtils]: 74: Hoare triple {53556#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,363 INFO L290 TraceCheckUtils]: 75: Hoare triple {53556#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {53556#false} is VALID [2022-04-28 09:02:15,363 INFO L290 TraceCheckUtils]: 76: Hoare triple {53556#false} assume 4432 == #t~mem56;havoc #t~mem56; {53556#false} is VALID [2022-04-28 09:02:15,363 INFO L290 TraceCheckUtils]: 77: Hoare triple {53556#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {53556#false} is VALID [2022-04-28 09:02:15,363 INFO L290 TraceCheckUtils]: 78: Hoare triple {53556#false} assume 5 == ~blastFlag~0; {53556#false} is VALID [2022-04-28 09:02:15,363 INFO L290 TraceCheckUtils]: 79: Hoare triple {53556#false} assume !false; {53556#false} is VALID [2022-04-28 09:02:15,364 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:02:15,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:15,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420639039] [2022-04-28 09:02:15,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420639039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:15,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:15,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:02:15,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:15,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1504964297] [2022-04-28 09:02:15,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1504964297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:15,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:15,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:02:15,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424236259] [2022-04-28 09:02:15,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:15,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 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-28 09:02:15,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:15,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:15,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:15,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:02:15,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:15,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:02:15,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:02:15,419 INFO L87 Difference]: Start difference. First operand 551 states and 829 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:17,441 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:02:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:18,450 INFO L93 Difference]: Finished difference Result 1278 states and 1899 transitions. [2022-04-28 09:02:18,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:02:18,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 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-28 09:02:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 09:02:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 09:02:18,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-28 09:02:18,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:18,855 INFO L225 Difference]: With dead ends: 1278 [2022-04-28 09:02:18,855 INFO L226 Difference]: Without dead ends: 743 [2022-04-28 09:02:18,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:02:18,856 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 117 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:18,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 306 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 396 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 09:02:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-04-28 09:02:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 551. [2022-04-28 09:02:18,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:18,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 743 states. Second operand has 551 states, 546 states have (on average 1.4963369963369964) internal successors, (817), 546 states have internal predecessors, (817), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:18,885 INFO L74 IsIncluded]: Start isIncluded. First operand 743 states. Second operand has 551 states, 546 states have (on average 1.4963369963369964) internal successors, (817), 546 states have internal predecessors, (817), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:18,885 INFO L87 Difference]: Start difference. First operand 743 states. Second operand has 551 states, 546 states have (on average 1.4963369963369964) internal successors, (817), 546 states have internal predecessors, (817), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:18,900 INFO L93 Difference]: Finished difference Result 743 states and 1083 transitions. [2022-04-28 09:02:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1083 transitions. [2022-04-28 09:02:18,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:18,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:18,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.4963369963369964) internal successors, (817), 546 states have internal predecessors, (817), 3 states have call successors, (3), 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 743 states. [2022-04-28 09:02:18,902 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.4963369963369964) internal successors, (817), 546 states have internal predecessors, (817), 3 states have call successors, (3), 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 743 states. [2022-04-28 09:02:18,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:18,917 INFO L93 Difference]: Finished difference Result 743 states and 1083 transitions. [2022-04-28 09:02:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1083 transitions. [2022-04-28 09:02:18,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:18,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:18,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:18,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4963369963369964) internal successors, (817), 546 states have internal predecessors, (817), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 821 transitions. [2022-04-28 09:02:18,931 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 821 transitions. Word has length 80 [2022-04-28 09:02:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:18,931 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 821 transitions. [2022-04-28 09:02:18,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:18,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 821 transitions. [2022-04-28 09:02:19,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 821 edges. 821 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 821 transitions. [2022-04-28 09:02:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 09:02:19,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:19,643 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:19,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 09:02:19,643 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1405175058, now seen corresponding path program 1 times [2022-04-28 09:02:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:19,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1247497307] [2022-04-28 09:02:21,561 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1405175058, now seen corresponding path program 2 times [2022-04-28 09:02:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:21,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425590646] [2022-04-28 09:02:21,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:21,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:21,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {58718#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {58711#true} is VALID [2022-04-28 09:02:21,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {58711#true} assume true; {58711#true} is VALID [2022-04-28 09:02:21,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58711#true} {58711#true} #591#return; {58711#true} is VALID [2022-04-28 09:02:21,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {58711#true} call ULTIMATE.init(); {58718#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:21,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {58718#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {58711#true} is VALID [2022-04-28 09:02:21,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {58711#true} assume true; {58711#true} is VALID [2022-04-28 09:02:21,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58711#true} {58711#true} #591#return; {58711#true} is VALID [2022-04-28 09:02:21,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {58711#true} call #t~ret159 := main(); {58711#true} is VALID [2022-04-28 09:02:21,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {58711#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {58711#true} is VALID [2022-04-28 09:02:21,682 INFO L272 TraceCheckUtils]: 6: Hoare triple {58711#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {58711#true} is VALID [2022-04-28 09:02:21,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {58711#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {58711#true} is VALID [2022-04-28 09:02:21,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {58711#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {58711#true} is VALID [2022-04-28 09:02:21,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {58711#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {58711#true} is VALID [2022-04-28 09:02:21,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {58711#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {58711#true} is VALID [2022-04-28 09:02:21,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {58711#true} assume !false; {58711#true} is VALID [2022-04-28 09:02:21,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {58711#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {58711#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {58711#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {58711#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {58711#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {58711#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {58711#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {58711#true} assume 4369 == #t~mem49;havoc #t~mem49; {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {58711#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {58711#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {58711#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {58711#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {58711#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {58711#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {58711#true} is VALID [2022-04-28 09:02:21,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {58711#true} ~skip~0 := 0; {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {58711#true} assume !false; {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {58711#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {58711#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {58711#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {58711#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {58711#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {58711#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {58711#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {58711#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {58711#true} assume 4384 == #t~mem50;havoc #t~mem50; {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {58711#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {58711#true} is VALID [2022-04-28 09:02:21,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {58711#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {58711#true} is VALID [2022-04-28 09:02:21,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {58711#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {58711#true} is VALID [2022-04-28 09:02:21,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {58711#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,687 INFO L290 TraceCheckUtils]: 43: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,688 INFO L290 TraceCheckUtils]: 47: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,689 INFO L290 TraceCheckUtils]: 51: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 09:02:21,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {58716#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58717#(not (= 4369 |ssl3_connect_#t~mem49|))} is VALID [2022-04-28 09:02:21,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {58717#(not (= 4369 |ssl3_connect_#t~mem49|))} assume 4369 == #t~mem49;havoc #t~mem49; {58712#false} is VALID [2022-04-28 09:02:21,690 INFO L290 TraceCheckUtils]: 54: Hoare triple {58712#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {58712#false} is VALID [2022-04-28 09:02:21,690 INFO L290 TraceCheckUtils]: 55: Hoare triple {58712#false} assume !(0 == ~blastFlag~0); {58712#false} is VALID [2022-04-28 09:02:21,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {58712#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {58712#false} is VALID [2022-04-28 09:02:21,690 INFO L290 TraceCheckUtils]: 57: Hoare triple {58712#false} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {58712#false} is VALID [2022-04-28 09:02:21,690 INFO L290 TraceCheckUtils]: 58: Hoare triple {58712#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,690 INFO L290 TraceCheckUtils]: 59: Hoare triple {58712#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {58712#false} is VALID [2022-04-28 09:02:21,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {58712#false} ~skip~0 := 0; {58712#false} is VALID [2022-04-28 09:02:21,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {58712#false} assume !false; {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {58712#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 63: Hoare triple {58712#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {58712#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 65: Hoare triple {58712#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 66: Hoare triple {58712#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 67: Hoare triple {58712#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 68: Hoare triple {58712#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 69: Hoare triple {58712#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 70: Hoare triple {58712#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 71: Hoare triple {58712#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 72: Hoare triple {58712#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 73: Hoare triple {58712#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,691 INFO L290 TraceCheckUtils]: 74: Hoare triple {58712#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,692 INFO L290 TraceCheckUtils]: 75: Hoare triple {58712#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58712#false} is VALID [2022-04-28 09:02:21,701 INFO L290 TraceCheckUtils]: 76: Hoare triple {58712#false} assume 4432 == #t~mem56;havoc #t~mem56; {58712#false} is VALID [2022-04-28 09:02:21,701 INFO L290 TraceCheckUtils]: 77: Hoare triple {58712#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {58712#false} is VALID [2022-04-28 09:02:21,701 INFO L290 TraceCheckUtils]: 78: Hoare triple {58712#false} assume 5 == ~blastFlag~0; {58712#false} is VALID [2022-04-28 09:02:21,701 INFO L290 TraceCheckUtils]: 79: Hoare triple {58712#false} assume !false; {58712#false} is VALID [2022-04-28 09:02:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:02:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:21,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425590646] [2022-04-28 09:02:21,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425590646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:21,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:21,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:02:21,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:21,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1247497307] [2022-04-28 09:02:21,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1247497307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:21,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:21,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:02:21,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669343596] [2022-04-28 09:02:21,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:21,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 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-28 09:02:21,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:21,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:21,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:21,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:02:21,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:21,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:02:21,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:02:21,757 INFO L87 Difference]: Start difference. First operand 551 states and 821 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:23,778 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:02:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:24,852 INFO L93 Difference]: Finished difference Result 1112 states and 1649 transitions. [2022-04-28 09:02:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:02:24,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 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-28 09:02:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 09:02:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 09:02:24,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-28 09:02:25,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:25,263 INFO L225 Difference]: With dead ends: 1112 [2022-04-28 09:02:25,263 INFO L226 Difference]: Without dead ends: 768 [2022-04-28 09:02:25,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:02:25,264 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 109 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:25,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 320 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 397 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 09:02:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-04-28 09:02:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 554. [2022-04-28 09:02:25,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:25,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 768 states. Second operand has 554 states, 549 states have (on average 1.4899817850637522) internal successors, (818), 549 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:25,293 INFO L74 IsIncluded]: Start isIncluded. First operand 768 states. Second operand has 554 states, 549 states have (on average 1.4899817850637522) internal successors, (818), 549 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:25,294 INFO L87 Difference]: Start difference. First operand 768 states. Second operand has 554 states, 549 states have (on average 1.4899817850637522) internal successors, (818), 549 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:25,309 INFO L93 Difference]: Finished difference Result 768 states and 1129 transitions. [2022-04-28 09:02:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1129 transitions. [2022-04-28 09:02:25,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:25,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:25,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 554 states, 549 states have (on average 1.4899817850637522) internal successors, (818), 549 states have internal predecessors, (818), 3 states have call successors, (3), 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 768 states. [2022-04-28 09:02:25,310 INFO L87 Difference]: Start difference. First operand has 554 states, 549 states have (on average 1.4899817850637522) internal successors, (818), 549 states have internal predecessors, (818), 3 states have call successors, (3), 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 768 states. [2022-04-28 09:02:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:25,325 INFO L93 Difference]: Finished difference Result 768 states and 1129 transitions. [2022-04-28 09:02:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1129 transitions. [2022-04-28 09:02:25,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:25,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:25,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:25,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4899817850637522) internal successors, (818), 549 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 822 transitions. [2022-04-28 09:02:25,338 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 822 transitions. Word has length 80 [2022-04-28 09:02:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:25,338 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 822 transitions. [2022-04-28 09:02:25,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:25,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 554 states and 822 transitions. [2022-04-28 09:02:26,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 822 edges. 822 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 822 transitions. [2022-04-28 09:02:26,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 09:02:26,080 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:26,080 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2022-04-28 09:02:26,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 09:02:26,080 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2074446003, now seen corresponding path program 1 times [2022-04-28 09:02:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:26,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [73048134] [2022-04-28 09:02:40,277 WARN L232 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 09:02:49,187 WARN L232 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 09:02:50,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2074446003, now seen corresponding path program 2 times [2022-04-28 09:02:50,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:50,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344245508] [2022-04-28 09:02:50,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:50,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:50,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:50,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {63597#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {63591#true} is VALID [2022-04-28 09:02:50,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {63591#true} assume true; {63591#true} is VALID [2022-04-28 09:02:50,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63591#true} {63591#true} #591#return; {63591#true} is VALID [2022-04-28 09:02:50,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {63591#true} call ULTIMATE.init(); {63597#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:50,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {63597#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {63591#true} is VALID [2022-04-28 09:02:50,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {63591#true} assume true; {63591#true} is VALID [2022-04-28 09:02:50,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63591#true} {63591#true} #591#return; {63591#true} is VALID [2022-04-28 09:02:50,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {63591#true} call #t~ret159 := main(); {63591#true} is VALID [2022-04-28 09:02:50,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {63591#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {63591#true} is VALID [2022-04-28 09:02:50,545 INFO L272 TraceCheckUtils]: 6: Hoare triple {63591#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {63591#true} is VALID [2022-04-28 09:02:50,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {63591#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {63591#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {63591#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {63591#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {63591#true} assume !false; {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {63591#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {63591#true} assume 12292 == #t~mem43;havoc #t~mem43; {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {63591#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {63591#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {63591#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {63591#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {63591#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {63591#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {63591#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {63591#true} is VALID [2022-04-28 09:02:50,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {63591#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {63591#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {63591#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {63591#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {63591#true} ~skip~0 := 0; {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {63591#true} assume !false; {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {63591#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {63591#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {63591#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {63591#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {63591#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {63591#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {63591#true} assume 4368 == #t~mem48;havoc #t~mem48; {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {63591#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {63591#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {63591#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {63591#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {63591#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {63591#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {63591#true} ~skip~0 := 0; {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {63591#true} assume !false; {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {63591#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {63591#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {63591#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {63591#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {63591#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {63591#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {63591#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {63591#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {63591#true} is VALID [2022-04-28 09:02:50,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {63591#true} assume 4384 == #t~mem50;havoc #t~mem50; {63591#true} is VALID [2022-04-28 09:02:50,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {63591#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {63591#true} is VALID [2022-04-28 09:02:50,549 INFO L290 TraceCheckUtils]: 52: Hoare triple {63591#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,551 INFO L290 TraceCheckUtils]: 58: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,551 INFO L290 TraceCheckUtils]: 59: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,551 INFO L290 TraceCheckUtils]: 60: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,552 INFO L290 TraceCheckUtils]: 64: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume 20480 == #t~mem46;havoc #t~mem46; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,553 INFO L290 TraceCheckUtils]: 65: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 56 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,553 INFO L290 TraceCheckUtils]: 66: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,553 INFO L290 TraceCheckUtils]: 67: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,553 INFO L290 TraceCheckUtils]: 68: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,554 INFO L290 TraceCheckUtils]: 69: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,554 INFO L290 TraceCheckUtils]: 70: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,554 INFO L290 TraceCheckUtils]: 71: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,554 INFO L290 TraceCheckUtils]: 72: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,555 INFO L290 TraceCheckUtils]: 73: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,555 INFO L290 TraceCheckUtils]: 74: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,555 INFO L290 TraceCheckUtils]: 75: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,556 INFO L290 TraceCheckUtils]: 76: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,556 INFO L290 TraceCheckUtils]: 77: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,556 INFO L290 TraceCheckUtils]: 78: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,556 INFO L290 TraceCheckUtils]: 79: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,557 INFO L290 TraceCheckUtils]: 80: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,557 INFO L290 TraceCheckUtils]: 81: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,557 INFO L290 TraceCheckUtils]: 82: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,557 INFO L290 TraceCheckUtils]: 83: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,558 INFO L290 TraceCheckUtils]: 84: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,558 INFO L290 TraceCheckUtils]: 85: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,558 INFO L290 TraceCheckUtils]: 86: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,558 INFO L290 TraceCheckUtils]: 87: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,559 INFO L290 TraceCheckUtils]: 88: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,559 INFO L290 TraceCheckUtils]: 89: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,559 INFO L290 TraceCheckUtils]: 90: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,560 INFO L290 TraceCheckUtils]: 91: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem56;havoc #t~mem56; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,560 INFO L290 TraceCheckUtils]: 92: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {63596#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:50,560 INFO L290 TraceCheckUtils]: 93: Hoare triple {63596#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {63592#false} is VALID [2022-04-28 09:02:50,560 INFO L290 TraceCheckUtils]: 94: Hoare triple {63592#false} assume !false; {63592#false} is VALID [2022-04-28 09:02:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 09:02:50,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:50,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344245508] [2022-04-28 09:02:50,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344245508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:50,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:50,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:02:50,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:50,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [73048134] [2022-04-28 09:02:50,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [73048134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:50,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:50,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:02:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847791102] [2022-04-28 09:02:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 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 95 [2022-04-28 09:02:50,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:50,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:50,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:50,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:02:50,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:50,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:02:50,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:02:50,624 INFO L87 Difference]: Start difference. First operand 554 states and 822 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:52,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:02:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:53,626 INFO L93 Difference]: Finished difference Result 1093 states and 1631 transitions. [2022-04-28 09:02:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:02:53,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 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 95 [2022-04-28 09:02:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-28 09:02:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-28 09:02:53,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-28 09:02:53,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:54,000 INFO L225 Difference]: With dead ends: 1093 [2022-04-28 09:02:54,000 INFO L226 Difference]: Without dead ends: 749 [2022-04-28 09:02:54,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:02:54,002 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 119 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:54,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 09:02:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-04-28 09:02:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2022-04-28 09:02:54,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:54,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 749 states. Second operand has 749 states, 744 states have (on average 1.4879032258064515) internal successors, (1107), 744 states have internal predecessors, (1107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:54,042 INFO L74 IsIncluded]: Start isIncluded. First operand 749 states. Second operand has 749 states, 744 states have (on average 1.4879032258064515) internal successors, (1107), 744 states have internal predecessors, (1107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:54,043 INFO L87 Difference]: Start difference. First operand 749 states. Second operand has 749 states, 744 states have (on average 1.4879032258064515) internal successors, (1107), 744 states have internal predecessors, (1107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:54,061 INFO L93 Difference]: Finished difference Result 749 states and 1111 transitions. [2022-04-28 09:02:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1111 transitions. [2022-04-28 09:02:54,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:54,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:54,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 749 states, 744 states have (on average 1.4879032258064515) internal successors, (1107), 744 states have internal predecessors, (1107), 3 states have call successors, (3), 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 749 states. [2022-04-28 09:02:54,063 INFO L87 Difference]: Start difference. First operand has 749 states, 744 states have (on average 1.4879032258064515) internal successors, (1107), 744 states have internal predecessors, (1107), 3 states have call successors, (3), 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 749 states. [2022-04-28 09:02:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:54,080 INFO L93 Difference]: Finished difference Result 749 states and 1111 transitions. [2022-04-28 09:02:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1111 transitions. [2022-04-28 09:02:54,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:54,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:54,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:54,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 744 states have (on average 1.4879032258064515) internal successors, (1107), 744 states have internal predecessors, (1107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1111 transitions. [2022-04-28 09:02:54,107 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1111 transitions. Word has length 95 [2022-04-28 09:02:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:54,107 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 1111 transitions. [2022-04-28 09:02:54,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:54,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 749 states and 1111 transitions. [2022-04-28 09:02:55,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1111 transitions. [2022-04-28 09:02:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 09:02:55,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:55,214 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2022-04-28 09:02:55,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 09:02:55,215 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1609163299, now seen corresponding path program 1 times [2022-04-28 09:02:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:55,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [256835382] [2022-04-28 09:02:55,215 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1609163299, now seen corresponding path program 2 times [2022-04-28 09:02:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:55,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364119896] [2022-04-28 09:02:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:55,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {68788#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {68782#true} is VALID [2022-04-28 09:02:55,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {68782#true} assume true; {68782#true} is VALID [2022-04-28 09:02:55,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68782#true} {68782#true} #591#return; {68782#true} is VALID [2022-04-28 09:02:55,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {68782#true} call ULTIMATE.init(); {68788#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:55,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {68788#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {68782#true} is VALID [2022-04-28 09:02:55,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {68782#true} assume true; {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68782#true} {68782#true} #591#return; {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {68782#true} call #t~ret159 := main(); {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {68782#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L272 TraceCheckUtils]: 6: Hoare triple {68782#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {68782#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {68782#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {68782#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {68782#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {68782#true} assume !false; {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {68782#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {68782#true} assume 12292 == #t~mem43;havoc #t~mem43; {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {68782#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {68782#true} is VALID [2022-04-28 09:02:55,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {68782#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {68782#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {68782#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {68782#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {68782#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {68782#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {68782#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {68782#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {68782#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {68782#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {68782#true} ~skip~0 := 0; {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {68782#true} assume !false; {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {68782#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {68782#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {68782#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {68782#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {68782#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {68782#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {68782#true} assume 4368 == #t~mem48;havoc #t~mem48; {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {68782#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {68782#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {68782#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {68782#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {68782#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {68782#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {68782#true} ~skip~0 := 0; {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {68782#true} assume !false; {68782#true} is VALID [2022-04-28 09:02:55,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {68782#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {68782#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {68782#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {68782#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {68782#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {68782#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {68782#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {68782#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {68782#true} assume 4384 == #t~mem50;havoc #t~mem50; {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 51: Hoare triple {68782#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {68782#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {68782#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 54: Hoare triple {68782#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 55: Hoare triple {68782#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,346 INFO L290 TraceCheckUtils]: 56: Hoare triple {68782#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 57: Hoare triple {68782#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 58: Hoare triple {68782#true} ~skip~0 := 0; {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 59: Hoare triple {68782#true} assume !false; {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 60: Hoare triple {68782#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 61: Hoare triple {68782#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 62: Hoare triple {68782#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 63: Hoare triple {68782#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 64: Hoare triple {68782#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 65: Hoare triple {68782#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {68782#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 67: Hoare triple {68782#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 68: Hoare triple {68782#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,347 INFO L290 TraceCheckUtils]: 69: Hoare triple {68782#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {68782#true} is VALID [2022-04-28 09:02:55,348 INFO L290 TraceCheckUtils]: 70: Hoare triple {68782#true} assume 4400 == #t~mem52;havoc #t~mem52; {68782#true} is VALID [2022-04-28 09:02:55,348 INFO L290 TraceCheckUtils]: 71: Hoare triple {68782#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {68782#true} is VALID [2022-04-28 09:02:55,348 INFO L290 TraceCheckUtils]: 72: Hoare triple {68782#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {68782#true} is VALID [2022-04-28 09:02:55,348 INFO L290 TraceCheckUtils]: 73: Hoare triple {68782#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,348 INFO L290 TraceCheckUtils]: 74: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,349 INFO L290 TraceCheckUtils]: 75: Hoare triple {68787#(= 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); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,349 INFO L290 TraceCheckUtils]: 76: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,349 INFO L290 TraceCheckUtils]: 77: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,349 INFO L290 TraceCheckUtils]: 78: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,350 INFO L290 TraceCheckUtils]: 79: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,350 INFO L290 TraceCheckUtils]: 80: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,350 INFO L290 TraceCheckUtils]: 81: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,350 INFO L290 TraceCheckUtils]: 82: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,351 INFO L290 TraceCheckUtils]: 83: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,351 INFO L290 TraceCheckUtils]: 84: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,351 INFO L290 TraceCheckUtils]: 85: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,351 INFO L290 TraceCheckUtils]: 86: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,351 INFO L290 TraceCheckUtils]: 87: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,352 INFO L290 TraceCheckUtils]: 88: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,352 INFO L290 TraceCheckUtils]: 89: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,352 INFO L290 TraceCheckUtils]: 90: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,352 INFO L290 TraceCheckUtils]: 91: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,353 INFO L290 TraceCheckUtils]: 92: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,353 INFO L290 TraceCheckUtils]: 93: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,353 INFO L290 TraceCheckUtils]: 94: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem56;havoc #t~mem56; {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,353 INFO L290 TraceCheckUtils]: 95: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {68787#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 09:02:55,354 INFO L290 TraceCheckUtils]: 96: Hoare triple {68787#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {68783#false} is VALID [2022-04-28 09:02:55,354 INFO L290 TraceCheckUtils]: 97: Hoare triple {68783#false} assume !false; {68783#false} is VALID [2022-04-28 09:02:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 09:02:55,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:55,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364119896] [2022-04-28 09:02:55,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364119896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:55,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:55,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:02:55,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:55,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [256835382] [2022-04-28 09:02:55,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [256835382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:55,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:55,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:02:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534365674] [2022-04-28 09:02:55,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:55,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 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-28 09:02:55,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:55,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:55,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:55,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:02:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:55,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:02:55,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:02:55,407 INFO L87 Difference]: Start difference. First operand 749 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:57,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:02:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:58,432 INFO L93 Difference]: Finished difference Result 1482 states and 2208 transitions. [2022-04-28 09:02:58,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:02:58,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 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-28 09:02:58,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-28 09:02:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-28 09:02:58,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 494 transitions. [2022-04-28 09:02:58,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:58,812 INFO L225 Difference]: With dead ends: 1482 [2022-04-28 09:02:58,812 INFO L226 Difference]: Without dead ends: 943 [2022-04-28 09:02:58,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:02:58,814 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:58,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 09:02:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2022-04-28 09:02:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2022-04-28 09:02:58,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:58,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 943 states. Second operand has 943 states, 938 states have (on average 1.4872068230277184) internal successors, (1395), 938 states have internal predecessors, (1395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:58,864 INFO L74 IsIncluded]: Start isIncluded. First operand 943 states. Second operand has 943 states, 938 states have (on average 1.4872068230277184) internal successors, (1395), 938 states have internal predecessors, (1395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:58,865 INFO L87 Difference]: Start difference. First operand 943 states. Second operand has 943 states, 938 states have (on average 1.4872068230277184) internal successors, (1395), 938 states have internal predecessors, (1395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:58,889 INFO L93 Difference]: Finished difference Result 943 states and 1399 transitions. [2022-04-28 09:02:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1399 transitions. [2022-04-28 09:02:58,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:58,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:58,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 943 states, 938 states have (on average 1.4872068230277184) internal successors, (1395), 938 states have internal predecessors, (1395), 3 states have call successors, (3), 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 943 states. [2022-04-28 09:02:58,892 INFO L87 Difference]: Start difference. First operand has 943 states, 938 states have (on average 1.4872068230277184) internal successors, (1395), 938 states have internal predecessors, (1395), 3 states have call successors, (3), 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 943 states. [2022-04-28 09:02:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:58,917 INFO L93 Difference]: Finished difference Result 943 states and 1399 transitions. [2022-04-28 09:02:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1399 transitions. [2022-04-28 09:02:58,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:58,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:58,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:58,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 938 states have (on average 1.4872068230277184) internal successors, (1395), 938 states have internal predecessors, (1395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1399 transitions. [2022-04-28 09:02:58,955 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1399 transitions. Word has length 98 [2022-04-28 09:02:58,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:58,955 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1399 transitions. [2022-04-28 09:02:58,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:58,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 943 states and 1399 transitions. [2022-04-28 09:03:00,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1399 edges. 1399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:03:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1399 transitions. [2022-04-28 09:03:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 09:03:00,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:03:00,137 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:03:00,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 09:03:00,137 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:03:00,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:03:00,137 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 1 times [2022-04-28 09:03:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:03:00,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [185763002] [2022-04-28 09:03:00,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:03:00,139 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 2 times [2022-04-28 09:03:00,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:03:00,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095211269] [2022-04-28 09:03:00,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:03:00,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:03:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:03:00,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:03:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:03:00,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {75533#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {75527#true} is VALID [2022-04-28 09:03:00,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {75527#true} assume true; {75527#true} is VALID [2022-04-28 09:03:00,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75527#true} {75527#true} #591#return; {75527#true} is VALID [2022-04-28 09:03:00,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {75527#true} call ULTIMATE.init(); {75533#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:03:00,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {75533#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {75527#true} assume true; {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75527#true} {75527#true} #591#return; {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {75527#true} call #t~ret159 := main(); {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {75527#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L272 TraceCheckUtils]: 6: Hoare triple {75527#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {75527#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {75527#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {75527#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {75527#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {75527#true} assume !false; {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {75527#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {75527#true} assume 12292 == #t~mem43;havoc #t~mem43; {75527#true} is VALID [2022-04-28 09:03:00,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {75527#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {75527#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {75527#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {75527#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {75527#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {75527#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {75527#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {75527#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {75527#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {75527#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {75527#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {75527#true} ~skip~0 := 0; {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {75527#true} assume !false; {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {75527#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {75527#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {75527#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {75527#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {75527#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {75527#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {75527#true} assume 4368 == #t~mem48;havoc #t~mem48; {75527#true} is VALID [2022-04-28 09:03:00,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {75527#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {75527#true} is VALID [2022-04-28 09:03:00,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {75527#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {75527#true} is VALID [2022-04-28 09:03:00,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {75527#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {75527#true} is VALID [2022-04-28 09:03:00,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {75527#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {75527#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 39: Hoare triple {75527#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {75527#true} ~skip~0 := 0; {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {75527#true} assume !false; {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {75527#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {75527#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {75527#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {75527#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {75527#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {75527#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {75527#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {75527#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 50: Hoare triple {75527#true} assume 4384 == #t~mem50;havoc #t~mem50; {75527#true} is VALID [2022-04-28 09:03:00,286 INFO L290 TraceCheckUtils]: 51: Hoare triple {75527#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 52: Hoare triple {75527#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 53: Hoare triple {75527#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 54: Hoare triple {75527#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {75527#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {75527#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {75527#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {75527#true} ~skip~0 := 0; {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 59: Hoare triple {75527#true} assume !false; {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {75527#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {75527#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {75527#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 63: Hoare triple {75527#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {75527#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 65: Hoare triple {75527#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 66: Hoare triple {75527#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 67: Hoare triple {75527#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 68: Hoare triple {75527#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 69: Hoare triple {75527#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 70: Hoare triple {75527#true} assume 4400 == #t~mem52;havoc #t~mem52; {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 71: Hoare triple {75527#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 72: Hoare triple {75527#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 73: Hoare triple {75527#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 74: Hoare triple {75527#true} assume !(~ret~0 <= 0); {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 75: Hoare triple {75527#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 76: Hoare triple {75527#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 77: Hoare triple {75527#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {75527#true} is VALID [2022-04-28 09:03:00,288 INFO L290 TraceCheckUtils]: 78: Hoare triple {75527#true} ~skip~0 := 0; {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 79: Hoare triple {75527#true} assume !false; {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 80: Hoare triple {75527#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 81: Hoare triple {75527#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 82: Hoare triple {75527#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 83: Hoare triple {75527#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 84: Hoare triple {75527#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 85: Hoare triple {75527#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 86: Hoare triple {75527#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 87: Hoare triple {75527#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 88: Hoare triple {75527#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 89: Hoare triple {75527#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 90: Hoare triple {75527#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,289 INFO L290 TraceCheckUtils]: 91: Hoare triple {75527#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {75527#true} is VALID [2022-04-28 09:03:00,290 INFO L290 TraceCheckUtils]: 92: Hoare triple {75527#true} assume 4416 == #t~mem54;havoc #t~mem54; {75527#true} is VALID [2022-04-28 09:03:00,290 INFO L290 TraceCheckUtils]: 93: Hoare triple {75527#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {75527#true} is VALID [2022-04-28 09:03:00,290 INFO L290 TraceCheckUtils]: 94: Hoare triple {75527#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,290 INFO L290 TraceCheckUtils]: 95: Hoare triple {75532#(= 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);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,291 INFO L290 TraceCheckUtils]: 96: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,291 INFO L290 TraceCheckUtils]: 97: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,291 INFO L290 TraceCheckUtils]: 98: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,291 INFO L290 TraceCheckUtils]: 99: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,292 INFO L290 TraceCheckUtils]: 100: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !false; {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,292 INFO L290 TraceCheckUtils]: 101: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,292 INFO L290 TraceCheckUtils]: 102: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,292 INFO L290 TraceCheckUtils]: 103: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,293 INFO L290 TraceCheckUtils]: 104: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,293 INFO L290 TraceCheckUtils]: 105: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,293 INFO L290 TraceCheckUtils]: 106: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,293 INFO L290 TraceCheckUtils]: 107: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,294 INFO L290 TraceCheckUtils]: 108: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,294 INFO L290 TraceCheckUtils]: 109: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,294 INFO L290 TraceCheckUtils]: 110: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,294 INFO L290 TraceCheckUtils]: 111: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,295 INFO L290 TraceCheckUtils]: 112: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,295 INFO L290 TraceCheckUtils]: 113: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,295 INFO L290 TraceCheckUtils]: 114: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,295 INFO L290 TraceCheckUtils]: 115: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem56;havoc #t~mem56; {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,296 INFO L290 TraceCheckUtils]: 116: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {75532#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 09:03:00,296 INFO L290 TraceCheckUtils]: 117: Hoare triple {75532#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {75528#false} is VALID [2022-04-28 09:03:00,296 INFO L290 TraceCheckUtils]: 118: Hoare triple {75528#false} assume !false; {75528#false} is VALID [2022-04-28 09:03:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-28 09:03:00,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:03:00,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095211269] [2022-04-28 09:03:00,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095211269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:03:00,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:03:00,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:03:00,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:03:00,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [185763002] [2022-04-28 09:03:00,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [185763002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:03:00,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:03:00,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:03:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960680918] [2022-04-28 09:03:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:03:00,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 09:03:00,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:03:00,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:00,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:03:00,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:03:00,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:03:00,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:03:00,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:03:00,351 INFO L87 Difference]: Start difference. First operand 943 states and 1399 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:02,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:03:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:03:03,365 INFO L93 Difference]: Finished difference Result 1673 states and 2486 transitions. [2022-04-28 09:03:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:03:03,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 09:03:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:03:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2022-04-28 09:03:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2022-04-28 09:03:03,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 490 transitions. [2022-04-28 09:03:03,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:03:03,704 INFO L225 Difference]: With dead ends: 1673 [2022-04-28 09:03:03,704 INFO L226 Difference]: Without dead ends: 940 [2022-04-28 09:03:03,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:03:03,706 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:03:03,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 478 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 09:03:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-04-28 09:03:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2022-04-28 09:03:03,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:03:03,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 940 states. Second operand has 940 states, 935 states have (on average 1.481283422459893) internal successors, (1385), 935 states have internal predecessors, (1385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:03,774 INFO L74 IsIncluded]: Start isIncluded. First operand 940 states. Second operand has 940 states, 935 states have (on average 1.481283422459893) internal successors, (1385), 935 states have internal predecessors, (1385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:03,775 INFO L87 Difference]: Start difference. First operand 940 states. Second operand has 940 states, 935 states have (on average 1.481283422459893) internal successors, (1385), 935 states have internal predecessors, (1385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:03:03,799 INFO L93 Difference]: Finished difference Result 940 states and 1389 transitions. [2022-04-28 09:03:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1389 transitions. [2022-04-28 09:03:03,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:03:03,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:03:03,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 940 states, 935 states have (on average 1.481283422459893) internal successors, (1385), 935 states have internal predecessors, (1385), 3 states have call successors, (3), 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 940 states. [2022-04-28 09:03:03,802 INFO L87 Difference]: Start difference. First operand has 940 states, 935 states have (on average 1.481283422459893) internal successors, (1385), 935 states have internal predecessors, (1385), 3 states have call successors, (3), 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 940 states. [2022-04-28 09:03:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:03:03,826 INFO L93 Difference]: Finished difference Result 940 states and 1389 transitions. [2022-04-28 09:03:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1389 transitions. [2022-04-28 09:03:03,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:03:03,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:03:03,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:03:03,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:03:03,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 935 states have (on average 1.481283422459893) internal successors, (1385), 935 states have internal predecessors, (1385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1389 transitions. [2022-04-28 09:03:03,863 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1389 transitions. Word has length 119 [2022-04-28 09:03:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:03:03,863 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1389 transitions. [2022-04-28 09:03:03,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:03,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 940 states and 1389 transitions. [2022-04-28 09:03:05,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1389 edges. 1389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:03:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1389 transitions. [2022-04-28 09:03:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 09:03:05,071 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:03:05,071 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:03:05,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 09:03:05,071 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:03:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:03:05,071 INFO L85 PathProgramCache]: Analyzing trace with hash 729336437, now seen corresponding path program 1 times [2022-04-28 09:03:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:03:05,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [363449686] [2022-04-28 09:03:05,072 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:03:05,072 INFO L85 PathProgramCache]: Analyzing trace with hash 729336437, now seen corresponding path program 2 times [2022-04-28 09:03:05,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:03:05,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990672925] [2022-04-28 09:03:05,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:03:05,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:03:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:03:05,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:03:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:03:05,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {82649#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {82642#true} is VALID [2022-04-28 09:03:05,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {82642#true} assume true; {82642#true} is VALID [2022-04-28 09:03:05,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82642#true} {82642#true} #591#return; {82642#true} is VALID [2022-04-28 09:03:05,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {82642#true} call ULTIMATE.init(); {82649#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:03:05,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {82649#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {82642#true} is VALID [2022-04-28 09:03:05,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {82642#true} assume true; {82642#true} is VALID [2022-04-28 09:03:05,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82642#true} {82642#true} #591#return; {82642#true} is VALID [2022-04-28 09:03:05,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {82642#true} call #t~ret159 := main(); {82642#true} is VALID [2022-04-28 09:03:05,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {82642#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {82642#true} is VALID [2022-04-28 09:03:05,246 INFO L272 TraceCheckUtils]: 6: Hoare triple {82642#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {82642#true} is VALID [2022-04-28 09:03:05,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {82642#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {82642#true} is VALID [2022-04-28 09:03:05,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {82642#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {82642#true} is VALID [2022-04-28 09:03:05,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {82642#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {82642#true} is VALID [2022-04-28 09:03:05,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {82642#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {82642#true} is VALID [2022-04-28 09:03:05,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {82642#true} assume !false; {82642#true} is VALID [2022-04-28 09:03:05,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {82642#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {82642#true} assume 12292 == #t~mem43;havoc #t~mem43; {82642#true} is VALID [2022-04-28 09:03:05,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {82642#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {82642#true} is VALID [2022-04-28 09:03:05,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {82642#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {82642#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {82642#true} is VALID [2022-04-28 09:03:05,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {82642#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {82642#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {82642#true} is VALID [2022-04-28 09:03:05,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {82642#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {82642#true} is VALID [2022-04-28 09:03:05,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {82642#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {82642#true} is VALID [2022-04-28 09:03:05,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {82642#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {82642#true} is VALID [2022-04-28 09:03:05,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {82642#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {82642#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {82642#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82642#true} is VALID [2022-04-28 09:03:05,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {82642#true} ~skip~0 := 0; {82642#true} is VALID [2022-04-28 09:03:05,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {82642#true} assume !false; {82642#true} is VALID [2022-04-28 09:03:05,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {82642#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {82642#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {82642#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {82642#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {82642#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {82642#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {82642#true} assume 4368 == #t~mem48;havoc #t~mem48; {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {82642#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {82642#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {82642#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {82642#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {82642#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {82642#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {82642#true} ~skip~0 := 0; {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {82642#true} assume !false; {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {82642#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {82642#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {82642#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {82642#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {82642#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {82642#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {82642#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {82642#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {82642#true} assume 4384 == #t~mem50;havoc #t~mem50; {82642#true} is VALID [2022-04-28 09:03:05,265 INFO L290 TraceCheckUtils]: 51: Hoare triple {82642#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {82642#true} is VALID [2022-04-28 09:03:05,265 INFO L290 TraceCheckUtils]: 52: Hoare triple {82642#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {82642#true} is VALID [2022-04-28 09:03:05,265 INFO L290 TraceCheckUtils]: 53: Hoare triple {82642#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {82642#true} is VALID [2022-04-28 09:03:05,266 INFO L290 TraceCheckUtils]: 54: Hoare triple {82642#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,266 INFO L290 TraceCheckUtils]: 55: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} ~skip~0 := 0; {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,268 INFO L290 TraceCheckUtils]: 59: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !false; {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,268 INFO L290 TraceCheckUtils]: 60: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,269 INFO L290 TraceCheckUtils]: 63: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,269 INFO L290 TraceCheckUtils]: 64: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,269 INFO L290 TraceCheckUtils]: 65: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,269 INFO L290 TraceCheckUtils]: 66: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,270 INFO L290 TraceCheckUtils]: 67: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,270 INFO L290 TraceCheckUtils]: 68: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 09:03:05,270 INFO L290 TraceCheckUtils]: 69: Hoare triple {82647#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82648#(= |ssl3_connect_#t~mem52| 4560)} is VALID [2022-04-28 09:03:05,271 INFO L290 TraceCheckUtils]: 70: Hoare triple {82648#(= |ssl3_connect_#t~mem52| 4560)} assume 4400 == #t~mem52;havoc #t~mem52; {82643#false} is VALID [2022-04-28 09:03:05,271 INFO L290 TraceCheckUtils]: 71: Hoare triple {82643#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {82643#false} is VALID [2022-04-28 09:03:05,271 INFO L290 TraceCheckUtils]: 72: Hoare triple {82643#false} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {82643#false} is VALID [2022-04-28 09:03:05,271 INFO L290 TraceCheckUtils]: 73: Hoare triple {82643#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {82643#false} is VALID [2022-04-28 09:03:05,271 INFO L290 TraceCheckUtils]: 74: Hoare triple {82643#false} assume !(~ret~0 <= 0); {82643#false} is VALID [2022-04-28 09:03:05,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {82643#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,271 INFO L290 TraceCheckUtils]: 76: Hoare triple {82643#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,271 INFO L290 TraceCheckUtils]: 77: Hoare triple {82643#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82643#false} is VALID [2022-04-28 09:03:05,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {82643#false} ~skip~0 := 0; {82643#false} is VALID [2022-04-28 09:03:05,271 INFO L290 TraceCheckUtils]: 79: Hoare triple {82643#false} assume !false; {82643#false} is VALID [2022-04-28 09:03:05,271 INFO L290 TraceCheckUtils]: 80: Hoare triple {82643#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 81: Hoare triple {82643#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 82: Hoare triple {82643#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 83: Hoare triple {82643#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 84: Hoare triple {82643#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 85: Hoare triple {82643#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 86: Hoare triple {82643#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 87: Hoare triple {82643#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 88: Hoare triple {82643#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 89: Hoare triple {82643#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 90: Hoare triple {82643#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 91: Hoare triple {82643#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 92: Hoare triple {82643#false} assume 4416 == #t~mem54;havoc #t~mem54; {82643#false} is VALID [2022-04-28 09:03:05,272 INFO L290 TraceCheckUtils]: 93: Hoare triple {82643#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 94: Hoare triple {82643#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 95: Hoare triple {82643#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);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 96: Hoare triple {82643#false} assume !(0 == ~tmp___6~0); {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 97: Hoare triple {82643#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 98: Hoare triple {82643#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 99: Hoare triple {82643#false} ~skip~0 := 0; {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 100: Hoare triple {82643#false} assume !false; {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 101: Hoare triple {82643#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 102: Hoare triple {82643#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 103: Hoare triple {82643#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 104: Hoare triple {82643#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,273 INFO L290 TraceCheckUtils]: 105: Hoare triple {82643#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 106: Hoare triple {82643#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 107: Hoare triple {82643#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 108: Hoare triple {82643#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 109: Hoare triple {82643#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 110: Hoare triple {82643#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 111: Hoare triple {82643#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 112: Hoare triple {82643#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 113: Hoare triple {82643#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 114: Hoare triple {82643#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 115: Hoare triple {82643#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 116: Hoare triple {82643#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {82643#false} is VALID [2022-04-28 09:03:05,274 INFO L290 TraceCheckUtils]: 117: Hoare triple {82643#false} assume 4448 == #t~mem58;havoc #t~mem58; {82643#false} is VALID [2022-04-28 09:03:05,275 INFO L290 TraceCheckUtils]: 118: Hoare triple {82643#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {82643#false} is VALID [2022-04-28 09:03:05,275 INFO L290 TraceCheckUtils]: 119: Hoare triple {82643#false} assume 4 == ~blastFlag~0; {82643#false} is VALID [2022-04-28 09:03:05,275 INFO L290 TraceCheckUtils]: 120: Hoare triple {82643#false} assume !false; {82643#false} is VALID [2022-04-28 09:03:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 09:03:05,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:03:05,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990672925] [2022-04-28 09:03:05,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990672925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:03:05,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:03:05,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:03:05,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:03:05,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [363449686] [2022-04-28 09:03:05,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [363449686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:03:05,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:03:05,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:03:05,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666361287] [2022-04-28 09:03:05,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:03:05,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-28 09:03:05,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:03:05,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:05,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:03:05,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:03:05,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:03:05,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:03:05,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:03:05,370 INFO L87 Difference]: Start difference. First operand 940 states and 1389 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:07,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:03:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:03:08,915 INFO L93 Difference]: Finished difference Result 2082 states and 3059 transitions. [2022-04-28 09:03:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:03:08,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-28 09:03:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:03:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 09:03:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 09:03:08,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-28 09:03:09,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:03:09,277 INFO L225 Difference]: With dead ends: 2082 [2022-04-28 09:03:09,277 INFO L226 Difference]: Without dead ends: 1158 [2022-04-28 09:03:09,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:03:09,279 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 82 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:03:09,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 547 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 509 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 09:03:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2022-04-28 09:03:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 940. [2022-04-28 09:03:09,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:03:09,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1158 states. Second operand has 940 states, 935 states have (on average 1.477005347593583) internal successors, (1381), 935 states have internal predecessors, (1381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:09,324 INFO L74 IsIncluded]: Start isIncluded. First operand 1158 states. Second operand has 940 states, 935 states have (on average 1.477005347593583) internal successors, (1381), 935 states have internal predecessors, (1381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:09,325 INFO L87 Difference]: Start difference. First operand 1158 states. Second operand has 940 states, 935 states have (on average 1.477005347593583) internal successors, (1381), 935 states have internal predecessors, (1381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:03:09,359 INFO L93 Difference]: Finished difference Result 1158 states and 1687 transitions. [2022-04-28 09:03:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1687 transitions. [2022-04-28 09:03:09,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:03:09,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:03:09,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 940 states, 935 states have (on average 1.477005347593583) internal successors, (1381), 935 states have internal predecessors, (1381), 3 states have call successors, (3), 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 1158 states. [2022-04-28 09:03:09,361 INFO L87 Difference]: Start difference. First operand has 940 states, 935 states have (on average 1.477005347593583) internal successors, (1381), 935 states have internal predecessors, (1381), 3 states have call successors, (3), 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 1158 states. [2022-04-28 09:03:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:03:09,395 INFO L93 Difference]: Finished difference Result 1158 states and 1687 transitions. [2022-04-28 09:03:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1687 transitions. [2022-04-28 09:03:09,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:03:09,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:03:09,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:03:09,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:03:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 935 states have (on average 1.477005347593583) internal successors, (1381), 935 states have internal predecessors, (1381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1385 transitions. [2022-04-28 09:03:09,443 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1385 transitions. Word has length 121 [2022-04-28 09:03:09,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:03:09,443 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1385 transitions. [2022-04-28 09:03:09,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:09,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 940 states and 1385 transitions. [2022-04-28 09:03:10,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1385 edges. 1385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:03:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1385 transitions. [2022-04-28 09:03:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 09:03:10,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:03:10,697 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:03:10,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 09:03:10,697 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:03:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:03:10,698 INFO L85 PathProgramCache]: Analyzing trace with hash -486817289, now seen corresponding path program 1 times [2022-04-28 09:03:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:03:10,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1899312306] [2022-04-28 09:03:10,698 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:03:10,698 INFO L85 PathProgramCache]: Analyzing trace with hash -486817289, now seen corresponding path program 2 times [2022-04-28 09:03:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:03:10,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170178982] [2022-04-28 09:03:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:03:10,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:03:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:03:10,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:03:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:03:10,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {91021#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {91014#true} is VALID [2022-04-28 09:03:10,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {91014#true} assume true; {91014#true} is VALID [2022-04-28 09:03:10,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91014#true} {91014#true} #591#return; {91014#true} is VALID [2022-04-28 09:03:10,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {91014#true} call ULTIMATE.init(); {91021#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:03:10,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {91021#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(5, 2);call write~init~int(115, 2, 0, 1);call write~init~int(51, 2, 1, 1);call write~init~int(46, 2, 2, 1);call write~init~int(105, 2, 3, 1);call write~init~int(0, 2, 4, 1);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {91014#true} is VALID [2022-04-28 09:03:10,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {91014#true} assume true; {91014#true} is VALID [2022-04-28 09:03:10,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91014#true} {91014#true} #591#return; {91014#true} is VALID [2022-04-28 09:03:10,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {91014#true} call #t~ret159 := main(); {91014#true} is VALID [2022-04-28 09:03:10,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {91014#true} havoc ~s~0.base, ~s~0.offset;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~mem9.base, #t~mem9.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet10 && #t~nondet10 <= 9223372036854775807;call write~int(#t~nondet10, #t~mem9.base, #t~mem9.offset, 8);havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;call write~int(#t~nondet12, #t~mem11.base, 912 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc14.base, #t~malloc14.offset, #t~mem13.base, 888 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~malloc14.base, #t~malloc14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, 888 + #t~mem15.offset, 8);call write~int(#t~nondet17, #t~mem16.base, 20 + #t~mem16.offset, 8);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, 904 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call write~$Pointer$(0, (if #t~nondet20 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet20 % 18446744073709551616 % 18446744073709551616 else #t~nondet20 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet20;call write~$Pointer$(0, (if #t~nondet21 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet21 % 18446744073709551616 % 18446744073709551616 else #t~nondet21 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet21;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc22.base, #t~malloc22.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc22.base, #t~malloc22.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet24 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet24 % 18446744073709551616 % 18446744073709551616 else #t~nondet24 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem23.base, 164 + #t~mem23.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~nondet24;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;call write~int(#t~nondet25, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet25;call write~$Pointer$(0, (if #t~nondet26 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet26 % 18446744073709551616 % 18446744073709551616 else #t~nondet26 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet26;call write~$Pointer$(0, (if #t~nondet27 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet27 % 18446744073709551616 % 18446744073709551616 else #t~nondet27 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet27; {91014#true} is VALID [2022-04-28 09:03:10,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {91014#true} call #t~ret28 := ssl3_connect(~s~0.base, ~s~0.offset); {91014#true} is VALID [2022-04-28 09:03:10,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {91014#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet29;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~tmp___0~1.base, ~tmp___0~1.offset;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;call write~int(#t~nondet32, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp~2 := #t~nondet33;havoc #t~nondet33;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4);~tmp___0~1.base, ~tmp___0~1.offset := #t~malloc34.base, #t~malloc34.offset;havoc #t~malloc34.base, #t~malloc34.offset;call write~int(0, ~tmp___0~1.base, ~tmp___0~1.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {91014#true} is VALID [2022-04-28 09:03:10,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {91014#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {91014#true} is VALID [2022-04-28 09:03:10,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {91014#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {91014#true} is VALID [2022-04-28 09:03:10,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {91014#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {91014#true} is VALID [2022-04-28 09:03:10,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {91014#true} assume !false; {91014#true} is VALID [2022-04-28 09:03:10,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {91014#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {91014#true} assume 12292 == #t~mem43;havoc #t~mem43; {91014#true} is VALID [2022-04-28 09:03:10,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {91014#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {91014#true} is VALID [2022-04-28 09:03:10,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {91014#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {91014#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {91014#true} is VALID [2022-04-28 09:03:10,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {91014#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {91014#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {91014#true} is VALID [2022-04-28 09:03:10,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {91014#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {91014#true} is VALID [2022-04-28 09:03:10,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {91014#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {91014#true} is VALID [2022-04-28 09:03:10,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {91014#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {91014#true} is VALID [2022-04-28 09:03:10,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {91014#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {91014#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {91014#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91014#true} is VALID [2022-04-28 09:03:10,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {91014#true} ~skip~0 := 0; {91014#true} is VALID [2022-04-28 09:03:10,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {91014#true} assume !false; {91014#true} is VALID [2022-04-28 09:03:10,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {91014#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {91014#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {91014#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {91014#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {91014#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {91014#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {91014#true} assume 4368 == #t~mem48;havoc #t~mem48; {91014#true} is VALID [2022-04-28 09:03:10,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {91014#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {91014#true} is VALID [2022-04-28 09:03:10,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {91014#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {91014#true} is VALID [2022-04-28 09:03:10,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {91014#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {91014#true} is VALID [2022-04-28 09:03:10,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {91014#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {91014#true} is VALID [2022-04-28 09:03:10,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {91014#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {91014#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91014#true} is VALID [2022-04-28 09:03:10,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {91014#true} ~skip~0 := 0; {91014#true} is VALID [2022-04-28 09:03:10,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {91014#true} assume !false; {91014#true} is VALID [2022-04-28 09:03:10,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {91014#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {91014#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {91014#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {91014#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {91014#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {91014#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {91014#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {91014#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,848 INFO L290 TraceCheckUtils]: 50: Hoare triple {91014#true} assume 4384 == #t~mem50;havoc #t~mem50; {91014#true} is VALID [2022-04-28 09:03:10,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {91014#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {91014#true} is VALID [2022-04-28 09:03:10,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {91014#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {91014#true} is VALID [2022-04-28 09:03:10,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {91014#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {91014#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,848 INFO L290 TraceCheckUtils]: 55: Hoare triple {91014#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,849 INFO L290 TraceCheckUtils]: 56: Hoare triple {91014#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,849 INFO L290 TraceCheckUtils]: 57: Hoare triple {91014#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91014#true} is VALID [2022-04-28 09:03:10,849 INFO L290 TraceCheckUtils]: 58: Hoare triple {91014#true} ~skip~0 := 0; {91014#true} is VALID [2022-04-28 09:03:10,849 INFO L290 TraceCheckUtils]: 59: Hoare triple {91014#true} assume !false; {91014#true} is VALID [2022-04-28 09:03:10,849 INFO L290 TraceCheckUtils]: 60: Hoare triple {91014#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,849 INFO L290 TraceCheckUtils]: 61: Hoare triple {91014#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,849 INFO L290 TraceCheckUtils]: 62: Hoare triple {91014#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,849 INFO L290 TraceCheckUtils]: 63: Hoare triple {91014#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,849 INFO L290 TraceCheckUtils]: 64: Hoare triple {91014#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,849 INFO L290 TraceCheckUtils]: 65: Hoare triple {91014#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,850 INFO L290 TraceCheckUtils]: 66: Hoare triple {91014#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,850 INFO L290 TraceCheckUtils]: 67: Hoare triple {91014#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,850 INFO L290 TraceCheckUtils]: 68: Hoare triple {91014#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,850 INFO L290 TraceCheckUtils]: 69: Hoare triple {91014#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,850 INFO L290 TraceCheckUtils]: 70: Hoare triple {91014#true} assume 4400 == #t~mem52;havoc #t~mem52; {91014#true} is VALID [2022-04-28 09:03:10,850 INFO L290 TraceCheckUtils]: 71: Hoare triple {91014#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {91014#true} is VALID [2022-04-28 09:03:10,850 INFO L290 TraceCheckUtils]: 72: Hoare triple {91014#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {91014#true} is VALID [2022-04-28 09:03:10,850 INFO L290 TraceCheckUtils]: 73: Hoare triple {91014#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {91014#true} is VALID [2022-04-28 09:03:10,850 INFO L290 TraceCheckUtils]: 74: Hoare triple {91014#true} assume !(~ret~0 <= 0); {91014#true} is VALID [2022-04-28 09:03:10,850 INFO L290 TraceCheckUtils]: 75: Hoare triple {91014#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,850 INFO L290 TraceCheckUtils]: 76: Hoare triple {91014#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,851 INFO L290 TraceCheckUtils]: 77: Hoare triple {91014#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91014#true} is VALID [2022-04-28 09:03:10,851 INFO L290 TraceCheckUtils]: 78: Hoare triple {91014#true} ~skip~0 := 0; {91014#true} is VALID [2022-04-28 09:03:10,851 INFO L290 TraceCheckUtils]: 79: Hoare triple {91014#true} assume !false; {91014#true} is VALID [2022-04-28 09:03:10,851 INFO L290 TraceCheckUtils]: 80: Hoare triple {91014#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,851 INFO L290 TraceCheckUtils]: 81: Hoare triple {91014#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,851 INFO L290 TraceCheckUtils]: 82: Hoare triple {91014#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,851 INFO L290 TraceCheckUtils]: 83: Hoare triple {91014#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,851 INFO L290 TraceCheckUtils]: 84: Hoare triple {91014#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,851 INFO L290 TraceCheckUtils]: 85: Hoare triple {91014#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,851 INFO L290 TraceCheckUtils]: 86: Hoare triple {91014#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,852 INFO L290 TraceCheckUtils]: 87: Hoare triple {91014#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,852 INFO L290 TraceCheckUtils]: 88: Hoare triple {91014#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,852 INFO L290 TraceCheckUtils]: 89: Hoare triple {91014#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,852 INFO L290 TraceCheckUtils]: 90: Hoare triple {91014#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,852 INFO L290 TraceCheckUtils]: 91: Hoare triple {91014#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {91014#true} is VALID [2022-04-28 09:03:10,852 INFO L290 TraceCheckUtils]: 92: Hoare triple {91014#true} assume 4416 == #t~mem54;havoc #t~mem54; {91014#true} is VALID [2022-04-28 09:03:10,852 INFO L290 TraceCheckUtils]: 93: Hoare triple {91014#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {91014#true} is VALID [2022-04-28 09:03:10,852 INFO L290 TraceCheckUtils]: 94: Hoare triple {91014#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {91014#true} is VALID [2022-04-28 09:03:10,853 INFO L290 TraceCheckUtils]: 95: Hoare triple {91014#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);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,854 INFO L290 TraceCheckUtils]: 96: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(0 == ~tmp___6~0); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,854 INFO L290 TraceCheckUtils]: 97: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,854 INFO L290 TraceCheckUtils]: 98: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,855 INFO L290 TraceCheckUtils]: 99: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} ~skip~0 := 0; {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,855 INFO L290 TraceCheckUtils]: 100: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !false; {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,855 INFO L290 TraceCheckUtils]: 101: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,855 INFO L290 TraceCheckUtils]: 102: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,856 INFO L290 TraceCheckUtils]: 103: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,856 INFO L290 TraceCheckUtils]: 104: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,856 INFO L290 TraceCheckUtils]: 105: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,857 INFO L290 TraceCheckUtils]: 106: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,857 INFO L290 TraceCheckUtils]: 107: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,857 INFO L290 TraceCheckUtils]: 108: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,857 INFO L290 TraceCheckUtils]: 109: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,858 INFO L290 TraceCheckUtils]: 110: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,858 INFO L290 TraceCheckUtils]: 111: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,858 INFO L290 TraceCheckUtils]: 112: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,859 INFO L290 TraceCheckUtils]: 113: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,859 INFO L290 TraceCheckUtils]: 114: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,859 INFO L290 TraceCheckUtils]: 115: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-28 09:03:10,860 INFO L290 TraceCheckUtils]: 116: Hoare triple {91019#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {91020#(not (= |ssl3_connect_#t~mem58| 4448))} is VALID [2022-04-28 09:03:10,860 INFO L290 TraceCheckUtils]: 117: Hoare triple {91020#(not (= |ssl3_connect_#t~mem58| 4448))} assume 4448 == #t~mem58;havoc #t~mem58; {91015#false} is VALID [2022-04-28 09:03:10,860 INFO L290 TraceCheckUtils]: 118: Hoare triple {91015#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {91015#false} is VALID [2022-04-28 09:03:10,860 INFO L290 TraceCheckUtils]: 119: Hoare triple {91015#false} assume 4 == ~blastFlag~0; {91015#false} is VALID [2022-04-28 09:03:10,860 INFO L290 TraceCheckUtils]: 120: Hoare triple {91015#false} assume !false; {91015#false} is VALID [2022-04-28 09:03:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-28 09:03:10,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:03:10,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170178982] [2022-04-28 09:03:10,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170178982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:03:10,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:03:10,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:03:10,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:03:10,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1899312306] [2022-04-28 09:03:10,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1899312306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:03:10,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:03:10,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:03:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050497439] [2022-04-28 09:03:10,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:03:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 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 121 [2022-04-28 09:03:10,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:03:10,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:10,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:03:10,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:03:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:03:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:03:10,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:03:10,920 INFO L87 Difference]: Start difference. First operand 940 states and 1385 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:12,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 09:03:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:03:14,138 INFO L93 Difference]: Finished difference Result 2295 states and 3359 transitions. [2022-04-28 09:03:14,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:03:14,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 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 121 [2022-04-28 09:03:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:03:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 09:03:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 09:03:14,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-28 09:03:14,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:03:14,515 INFO L225 Difference]: With dead ends: 2295 [2022-04-28 09:03:14,516 INFO L226 Difference]: Without dead ends: 1371 [2022-04-28 09:03:14,517 INFO L412 NwaCegarLoop]: 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-28 09:03:14,517 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 96 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:03:14,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 287 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 378 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 09:03:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-04-28 09:03:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1062. [2022-04-28 09:03:14,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:03:14,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1371 states. Second operand has 1062 states, 1057 states have (on average 1.488174077578051) internal successors, (1573), 1057 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:14,575 INFO L74 IsIncluded]: Start isIncluded. First operand 1371 states. Second operand has 1062 states, 1057 states have (on average 1.488174077578051) internal successors, (1573), 1057 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:14,575 INFO L87 Difference]: Start difference. First operand 1371 states. Second operand has 1062 states, 1057 states have (on average 1.488174077578051) internal successors, (1573), 1057 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:03:14,622 INFO L93 Difference]: Finished difference Result 1371 states and 1990 transitions. [2022-04-28 09:03:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1990 transitions. [2022-04-28 09:03:14,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:03:14,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:03:14,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 1062 states, 1057 states have (on average 1.488174077578051) internal successors, (1573), 1057 states have internal predecessors, (1573), 3 states have call successors, (3), 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 1371 states. [2022-04-28 09:03:14,626 INFO L87 Difference]: Start difference. First operand has 1062 states, 1057 states have (on average 1.488174077578051) internal successors, (1573), 1057 states have internal predecessors, (1573), 3 states have call successors, (3), 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 1371 states. [2022-04-28 09:03:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:03:14,680 INFO L93 Difference]: Finished difference Result 1371 states and 1990 transitions. [2022-04-28 09:03:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1990 transitions. [2022-04-28 09:03:14,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:03:14,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:03:14,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:03:14,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:03:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1057 states have (on average 1.488174077578051) internal successors, (1573), 1057 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1577 transitions. [2022-04-28 09:03:14,724 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1577 transitions. Word has length 121 [2022-04-28 09:03:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:03:14,724 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 1577 transitions. [2022-04-28 09:03:14,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:03:14,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1062 states and 1577 transitions. [2022-04-28 09:03:16,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1577 edges. 1577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:03:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1577 transitions. [2022-04-28 09:03:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-28 09:03:16,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:03:16,164 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:03:16,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 09:03:16,164 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:03:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:03:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 1 times [2022-04-28 09:03:16,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:03:16,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1141053513] [2022-04-28 09:03:16,165 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:03:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 2 times [2022-04-28 09:03:16,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:03:16,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886071153] [2022-04-28 09:03:16,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:03:16,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:03:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:03:17,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 09:03:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:03:17,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 09:03:17,661 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 09:03:17,661 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 09:03:17,663 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:03:17,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 09:03:17,666 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 09:03:17,668 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:03:17,687 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1123 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1123 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1084 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1084 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1668 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1668 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1049 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1049 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1126-2 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1126 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1126 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1084-1 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 09:03:17,688 WARN L170 areAnnotationChecker]: L1668-1 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1052 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1052 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1049-2 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1052-1 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1134 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1134 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1143-1 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1143-1 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1143-1 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1054 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1054 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1648 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1054-1 has no Hoare annotation [2022-04-28 09:03:17,689 WARN L170 areAnnotationChecker]: L1652 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1652 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1652-2 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1147 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1149 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1149 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1257-2 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-28 09:03:17,690 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1269-2 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1303 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1303 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1282 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1282 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1303-2 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1303-2 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1324 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1324 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1324-2 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1324-2 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-28 09:03:17,691 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1343 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1343 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1617-1 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1343-2 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1347-2 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1347-2 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 09:03:17,692 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1621 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1621 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1619-2 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1619-2 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1377 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1377 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 09:03:17,693 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1413-2 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1442 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1442 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 09:03:17,694 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1442-2 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1473-2 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1479 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1479 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-28 09:03:17,695 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1486 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1486 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1503-1 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1520 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1520 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1525 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1525 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1525-2 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1538 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1538 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1551 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1551 has no Hoare annotation [2022-04-28 09:03:17,696 WARN L170 areAnnotationChecker]: L1551-2 has no Hoare annotation [2022-04-28 09:03:17,697 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-28 09:03:17,697 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-28 09:03:17,697 WARN L170 areAnnotationChecker]: L1556-2 has no Hoare annotation [2022-04-28 09:03:17,697 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-28 09:03:17,697 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-28 09:03:17,697 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-28 09:03:17,697 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-28 09:03:17,697 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-28 09:03:17,697 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:03:17,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:03:17 BoogieIcfgContainer [2022-04-28 09:03:17,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:03:17,699 INFO L158 Benchmark]: Toolchain (without parser) took 136532.65ms. Allocated memory was 179.3MB in the beginning and 338.7MB in the end (delta: 159.4MB). Free memory was 124.7MB in the beginning and 221.8MB in the end (delta: -97.1MB). Peak memory consumption was 153.1MB. Max. memory is 8.0GB. [2022-04-28 09:03:17,699 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:03:17,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.33ms. Allocated memory is still 179.3MB. Free memory was 124.6MB in the beginning and 131.5MB in the end (delta: -7.0MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. [2022-04-28 09:03:17,699 INFO L158 Benchmark]: Boogie Preprocessor took 97.68ms. Allocated memory is still 179.3MB. Free memory was 131.5MB in the beginning and 122.2MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 09:03:17,699 INFO L158 Benchmark]: RCFGBuilder took 3145.58ms. Allocated memory was 179.3MB in the beginning and 229.6MB in the end (delta: 50.3MB). Free memory was 122.1MB in the beginning and 131.2MB in the end (delta: -9.1MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. [2022-04-28 09:03:17,699 INFO L158 Benchmark]: TraceAbstraction took 132769.95ms. Allocated memory was 229.6MB in the beginning and 338.7MB in the end (delta: 109.1MB). Free memory was 130.6MB in the beginning and 221.8MB in the end (delta: -91.1MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. [2022-04-28 09:03:17,700 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 511.33ms. Allocated memory is still 179.3MB. Free memory was 124.6MB in the beginning and 131.5MB in the end (delta: -7.0MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 97.68ms. Allocated memory is still 179.3MB. Free memory was 131.5MB in the beginning and 122.2MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 3145.58ms. Allocated memory was 179.3MB in the beginning and 229.6MB in the end (delta: 50.3MB). Free memory was 122.1MB in the beginning and 131.2MB in the end (delta: -9.1MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. * TraceAbstraction took 132769.95ms. Allocated memory was 229.6MB in the beginning and 338.7MB in the end (delta: 109.1MB). Free memory was 130.6MB in the beginning and 221.8MB in the end (delta: -91.1MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1658]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1343. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; [L1065] SSL *s ; [L1069] s = malloc (sizeof (SSL)) [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] EXPR s->s3 [L1071] s->s3->flags = __VERIFIER_nondet_long() [L1072] EXPR s->s3 [L1072] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1073] EXPR s->s3 [L1073] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1074] EXPR s->s3 [L1074] EXPR (s->s3)->tmp.new_cipher [L1074] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1075] EXPR s->s3 [L1075] s->s3->tmp.next_state = __VERIFIER_nondet_int() [L1076] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1077] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1078] s->ctx = malloc(sizeof(SSL_CTX)) [L1079] EXPR s->ctx [L1079] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1080] s->state = 12292 [L1081] s->version = __VERIFIER_nondet_int() [L1082] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1083] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1084] CALL ssl3_connect(s) [L1090] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1091] unsigned long tmp ; [L1092] unsigned long l ; [L1093] long num1 ; [L1094] void (*cb)() ; [L1095] int ret ; [L1096] int new_state ; [L1097] int state ; [L1098] int skip ; [L1099] int *tmp___0 ; [L1100] int tmp___1 = __VERIFIER_nondet_int(); [L1101] int tmp___2 = __VERIFIER_nondet_int(); [L1102] int tmp___3 ; [L1103] int tmp___4 ; [L1104] int tmp___5 ; [L1105] int tmp___6 ; [L1106] int tmp___7 ; [L1107] int tmp___8 ; [L1108] long tmp___9 ; [L1110] int blastFlag ; [L1113] blastFlag = 0 [L1114] s->state = 12292 [L1115] s->hit = __VERIFIER_nondet_int() [L1117] tmp = __VERIFIER_nondet_int() [L1118] cb = (void (*)())((void *)0) [L1119] ret = -1 [L1120] skip = 0 [L1121] tmp___0 = (int*)malloc(sizeof(int)) [L1122] *tmp___0 = 0 [L1123] EXPR s->info_callback [L1123] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1124] EXPR s->info_callback [L1124] cb = s->info_callback [L1132] EXPR s->in_handshake [L1132] s->in_handshake += 1 [L1133] COND FALSE !(tmp___1 & 12288) [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND TRUE s->state == 12292 [L1249] s->new_session = 1 [L1250] s->state = 4096 [L1251] EXPR s->ctx [L1251] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1251] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1256] s->server = 0 [L1257] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) [L1262] EXPR s->version [L1262] COND FALSE !((s->version & 65280) != 768) [L1268] s->type = 4096 [L1269] EXPR s->init_buf [L1269] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1281] tmp___4 = __VERIFIER_nondet_int() [L1282] COND FALSE !(! tmp___4) [L1288] tmp___5 = __VERIFIER_nondet_int() [L1289] COND FALSE !(! tmp___5) [L1295] s->state = 4368 [L1296] EXPR s->ctx [L1296] EXPR (s->ctx)->stats.sess_connect [L1296] (s->ctx)->stats.sess_connect += 1 [L1297] s->init_num = 0 [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND TRUE s->state == 4368 [L1301] s->shutdown = 0 [L1302] ret = __VERIFIER_nondet_int() [L1303] COND TRUE blastFlag == 0 [L1304] blastFlag = 1 [L1308] COND FALSE !(ret <= 0) [L1313] s->state = 4384 [L1314] s->init_num = 0 [L1315] EXPR s->bbio [L1315] EXPR s->wbio [L1315] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state [L1167] COND TRUE s->state == 4384 [L1323] ret = __VERIFIER_nondet_int() [L1324] COND TRUE blastFlag == 1 [L1325] blastFlag = 2 [L1329] COND FALSE !(ret <= 0) [L1334] s->hit [L1334] COND FALSE !(s->hit) [L1337] s->state = 4400 [L1339] s->init_num = 0 [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state [L1173] COND TRUE s->state == 4400 [L1343] EXPR s->s3 [L1343] EXPR (s->s3)->tmp.new_cipher [L1343] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1343] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1346] ret = __VERIFIER_nondet_int() [L1347] COND TRUE blastFlag == 2 [L1348] blastFlag = 3 [L1352] COND FALSE !(ret <= 0) [L1358] s->state = 4416 [L1359] s->init_num = 0 [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state [L1179] COND TRUE s->state == 4416 [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 3 [L1365] blastFlag = 4 [L1369] COND FALSE !(ret <= 0) [L1374] s->state = 4432 [L1375] s->init_num = 0 [L1376] tmp___6 = __VERIFIER_nondet_int() [L1377] COND FALSE !(! tmp___6) [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state [L1185] COND TRUE s->state == 4432 [L1386] ret = __VERIFIER_nondet_int() [L1387] COND FALSE !(blastFlag == 5) [L1392] COND FALSE !(ret <= 0) [L1397] s->state = 4448 [L1398] s->init_num = 0 [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 [L1143] COND TRUE 1 [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4432) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 4433) [L1191] EXPR s->state [L1191] COND TRUE s->state == 4448 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 [L1658] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 132.7s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 79.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 2147 SdHoareTripleChecker+Valid, 53.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2147 mSDsluCounter, 8805 SdHoareTripleChecker+Invalid, 53.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4759 mSDsCounter, 433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8351 IncrementalHoareTripleChecker+Invalid, 8806 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 433 mSolverCounterUnsat, 4046 mSDtfsCounter, 8351 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1062occurred in iteration=20, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 2603 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-28 09:03:17,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...