/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:31:20,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:31:20,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:31:20,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:31:20,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:31:20,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:31:20,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:31:20,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:31:20,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:31:20,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:31:20,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:31:20,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:31:20,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:31:20,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:31:20,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:31:20,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:31:20,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:31:20,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:31:20,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:31:20,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:31:20,485 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:31:20,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:31:20,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:31:20,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:31:20,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:31:20,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:31:20,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:31:20,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:31:20,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:31:20,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:31:20,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:31:20,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:31:20,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:31:20,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:31:20,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:31:20,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:31:20,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:31:20,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:31:20,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:31:20,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:31:20,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:31:20,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:31:20,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:31:20,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:31:20,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:31:20,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:31:20,509 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:31:20,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:31:20,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:31:20,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:31:20,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:31:20,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:31:20,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:31:20,510 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:31:20,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:31:20,510 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:31:20,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:31:20,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:31:20,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:31:20,511 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:31:20,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:31:20,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:31:20,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:31:20,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:31:20,511 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:31:20,511 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:31:20,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:31:20,512 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:31:20,512 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:31:20,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:31:20,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:31:20,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:31:20,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:31:20,726 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:31:20,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-1.c [2022-04-15 11:31:20,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277905687/6ef23c91543a4b119c83659edf2dc547/FLAG5358e6a5c [2022-04-15 11:31:21,221 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:31:21,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-1.c [2022-04-15 11:31:21,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277905687/6ef23c91543a4b119c83659edf2dc547/FLAG5358e6a5c [2022-04-15 11:31:21,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277905687/6ef23c91543a4b119c83659edf2dc547 [2022-04-15 11:31:21,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:31:21,753 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:31:21,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:31:21,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:31:21,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:31:21,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:31:21" (1/1) ... [2022-04-15 11:31:21,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7442863b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:21, skipping insertion in model container [2022-04-15 11:31:21,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:31:21" (1/1) ... [2022-04-15 11:31:21,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:31:21,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:31:22,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-1.c[65397,65410] [2022-04-15 11:31:22,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:31:22,100 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:31:22,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-1.c[65397,65410] [2022-04-15 11:31:22,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:31:22,199 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:31:22,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:22 WrapperNode [2022-04-15 11:31:22,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:31:22,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:31:22,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:31:22,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:31:22,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:22" (1/1) ... [2022-04-15 11:31:22,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:22" (1/1) ... [2022-04-15 11:31:22,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:22" (1/1) ... [2022-04-15 11:31:22,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:22" (1/1) ... [2022-04-15 11:31:22,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:22" (1/1) ... [2022-04-15 11:31:22,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:22" (1/1) ... [2022-04-15 11:31:22,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:22" (1/1) ... [2022-04-15 11:31:22,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:31:22,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:31:22,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:31:22,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:31:22,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:22" (1/1) ... [2022-04-15 11:31:22,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:31:22,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:31:22,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:31:22,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:31:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:31:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:31:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:31:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 11:31:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 11:31:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:31:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 11:31:22,353 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:31:22,353 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:31:22,353 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:31:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:31:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:31:22,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:31:22,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:31:22,513 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:31:22,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:31:23,785 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:31:24,153 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 11:31:24,154 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 11:31:24,169 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:31:24,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:31:24,175 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:31:24,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:31:24 BoogieIcfgContainer [2022-04-15 11:31:24,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:31:24,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:31:24,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:31:24,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:31:24,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:31:21" (1/3) ... [2022-04-15 11:31:24,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8df7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:31:24, skipping insertion in model container [2022-04-15 11:31:24,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:22" (2/3) ... [2022-04-15 11:31:24,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8df7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:31:24, skipping insertion in model container [2022-04-15 11:31:24,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:31:24" (3/3) ... [2022-04-15 11:31:24,188 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2022-04-15 11:31:24,191 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:31:24,191 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:31:24,219 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:31:24,223 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:31:24,223 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:31:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:31:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:31:24,244 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:24,244 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:24,245 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:24,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-15 11:31:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:24,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855727613] [2022-04-15 11:31:24,260 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:31:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-15 11:31:24,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:24,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666855134] [2022-04-15 11:31:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:24,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:24,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 11:31:24,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:31:24,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:31:24,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:31:24,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 11:31:24,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:31:24,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:31:24,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-15 11:31:24,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-15 11:31:24,811 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-15 11:31:24,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:24,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:24,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:24,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:24,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:24,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-15 11:31:24,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:31:24,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-15 11:31:24,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-15 11:31:24,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 4 == ~blastFlag~0; {142#false} is VALID [2022-04-15 11:31:24,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-15 11:31:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:31:24,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:24,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666855134] [2022-04-15 11:31:24,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666855134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:24,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:24,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:24,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:24,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855727613] [2022-04-15 11:31:24,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855727613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:24,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:24,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:24,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561656279] [2022-04-15 11:31:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:24,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:31:24,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:24,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:24,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:24,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:31:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:24,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:31:24,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:31:24,911 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:26,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:28,034 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-15 11:31:28,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:31:28,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:31:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:31:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:31:28,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 11:31:28,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:28,365 INFO L225 Difference]: With dead ends: 267 [2022-04-15 11:31:28,365 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 11:31:28,367 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:31:28,369 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:28,369 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:31:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 11:31:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 11:31:28,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:28,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:28,396 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:28,396 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:28,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:28,401 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:31:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:31:28,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:28,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:28,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 11:31:28,402 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 11:31:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:28,406 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:31:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:31:28,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:28,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:28,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:28,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-15 11:31:28,417 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-15 11:31:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:28,418 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-15 11:31:28,418 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:28,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-15 11:31:28,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-15 11:31:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 11:31:28,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:28,553 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:28,553 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:31:28,553 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:28,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-15 11:31:28,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:28,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1015819239] [2022-04-15 11:31:28,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:31:28,555 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-15 11:31:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:28,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821700517] [2022-04-15 11:31:28,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:28,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:28,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:28,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 11:31:28,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:31:28,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:31:28,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:31:28,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 11:31:28,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:31:28,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:31:28,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-15 11:31:28,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1173#true} is VALID [2022-04-15 11:31:28,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {1173#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1173#true} is VALID [2022-04-15 11:31:28,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:28,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {1174#false} is VALID [2022-04-15 11:31:28,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-15 11:31:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:31:28,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:28,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821700517] [2022-04-15 11:31:28,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821700517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:28,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:28,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:31:28,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:28,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1015819239] [2022-04-15 11:31:28,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1015819239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:28,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:28,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:31:28,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33012617] [2022-04-15 11:31:28,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:28,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 11:31:28,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:28,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:28,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:28,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:31:28,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:28,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:31:28,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:31:28,863 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:30,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:31,437 INFO L93 Difference]: Finished difference Result 326 states and 488 transitions. [2022-04-15 11:31:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:31:31,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 11:31:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-15 11:31:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-15 11:31:31,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 485 transitions. [2022-04-15 11:31:31,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:31,804 INFO L225 Difference]: With dead ends: 326 [2022-04-15 11:31:31,804 INFO L226 Difference]: Without dead ends: 221 [2022-04-15 11:31:31,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:31:31,806 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:31,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 320 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:31:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-15 11:31:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-04-15 11:31:31,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:31,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:31,819 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:31,820 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:31,825 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-15 11:31:31,826 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-15 11:31:31,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:31,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:31,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-15 11:31:31,828 INFO L87 Difference]: Start difference. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-15 11:31:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:31,834 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-15 11:31:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-15 11:31:31,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:31,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:31,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:31,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 325 transitions. [2022-04-15 11:31:31,842 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 325 transitions. Word has length 44 [2022-04-15 11:31:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:31,842 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 325 transitions. [2022-04-15 11:31:31,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:31,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 325 transitions. [2022-04-15 11:31:32,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-15 11:31:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 11:31:32,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:32,062 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:32,062 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:31:32,063 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:32,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 1 times [2022-04-15 11:31:32,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:32,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [991078238] [2022-04-15 11:31:32,064 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:31:32,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 2 times [2022-04-15 11:31:32,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:32,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406203119] [2022-04-15 11:31:32,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:32,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:32,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:32,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {2725#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2718#true} is VALID [2022-04-15 11:31:32,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {2718#true} assume true; {2718#true} is VALID [2022-04-15 11:31:32,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2718#true} {2718#true} #593#return; {2718#true} is VALID [2022-04-15 11:31:32,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {2718#true} call ULTIMATE.init(); {2725#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:31:32,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {2725#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2718#true} is VALID [2022-04-15 11:31:32,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {2718#true} assume true; {2718#true} is VALID [2022-04-15 11:31:32,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2718#true} {2718#true} #593#return; {2718#true} is VALID [2022-04-15 11:31:32,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {2718#true} call #t~ret158 := main(); {2718#true} is VALID [2022-04-15 11:31:32,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {2718#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2718#true} is VALID [2022-04-15 11:31:32,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {2718#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2718#true} is VALID [2022-04-15 11:31:32,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {2718#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {2718#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {2718#true} is VALID [2022-04-15 11:31:32,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {2718#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {2718#true} is VALID [2022-04-15 11:31:32,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {2718#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2718#true} is VALID [2022-04-15 11:31:32,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {2718#true} assume !false; {2718#true} is VALID [2022-04-15 11:31:32,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {2718#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {2718#true} assume 12292 == #t~mem49;havoc #t~mem49; {2718#true} is VALID [2022-04-15 11:31:32,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {2718#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {2718#true} is VALID [2022-04-15 11:31:32,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {2718#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {2718#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2718#true} is VALID [2022-04-15 11:31:32,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {2718#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {2718#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {2718#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {2718#true} is VALID [2022-04-15 11:31:32,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {2718#true} assume !(0 == ~tmp___4~0); {2718#true} is VALID [2022-04-15 11:31:32,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {2718#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {2718#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {2718#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2718#true} is VALID [2022-04-15 11:31:32,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {2718#true} ~skip~0 := 0; {2718#true} is VALID [2022-04-15 11:31:32,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {2718#true} assume !false; {2718#true} is VALID [2022-04-15 11:31:32,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {2718#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {2718#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {2718#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {2718#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {2718#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {2718#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2718#true} is VALID [2022-04-15 11:31:32,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {2718#true} assume 4368 == #t~mem54;havoc #t~mem54; {2718#true} is VALID [2022-04-15 11:31:32,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {2718#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {2718#true} is VALID [2022-04-15 11:31:32,261 INFO L290 TraceCheckUtils]: 34: Hoare triple {2718#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2718#true} is VALID [2022-04-15 11:31:32,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {2718#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,274 INFO L290 TraceCheckUtils]: 45: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,275 INFO L290 TraceCheckUtils]: 47: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:31:32,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {2723#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2724#(= |ssl3_connect_#t~mem56| 4384)} is VALID [2022-04-15 11:31:32,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {2724#(= |ssl3_connect_#t~mem56| 4384)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-15 11:31:32,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {2719#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-15 11:31:32,276 INFO L290 TraceCheckUtils]: 51: Hoare triple {2719#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-15 11:31:32,276 INFO L290 TraceCheckUtils]: 52: Hoare triple {2719#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-15 11:31:32,276 INFO L290 TraceCheckUtils]: 53: Hoare triple {2719#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-15 11:31:32,276 INFO L290 TraceCheckUtils]: 54: Hoare triple {2719#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2719#false} is VALID [2022-04-15 11:31:32,276 INFO L290 TraceCheckUtils]: 55: Hoare triple {2719#false} assume 4432 == #t~mem62;havoc #t~mem62; {2719#false} is VALID [2022-04-15 11:31:32,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {2719#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {2719#false} is VALID [2022-04-15 11:31:32,277 INFO L290 TraceCheckUtils]: 57: Hoare triple {2719#false} assume 4 == ~blastFlag~0; {2719#false} is VALID [2022-04-15 11:31:32,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {2719#false} assume !false; {2719#false} is VALID [2022-04-15 11:31:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:31:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:32,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406203119] [2022-04-15 11:31:32,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406203119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:32,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:32,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:32,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:32,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [991078238] [2022-04-15 11:31:32,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [991078238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:32,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:32,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401785802] [2022-04-15 11:31:32,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:32,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 11:31:32,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:32,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:32,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:32,326 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:31:32,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:31:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:31:32,326 INFO L87 Difference]: Start difference. First operand 221 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:34,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:35,313 INFO L93 Difference]: Finished difference Result 362 states and 538 transitions. [2022-04-15 11:31:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:31:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 11:31:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-15 11:31:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-15 11:31:35,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-15 11:31:35,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:35,566 INFO L225 Difference]: With dead ends: 362 [2022-04-15 11:31:35,567 INFO L226 Difference]: Without dead ends: 257 [2022-04-15 11:31:35,567 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:31:35,568 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:35,568 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 484 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 359 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:31:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-15 11:31:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 239. [2022-04-15 11:31:35,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:35,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:35,579 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:35,579 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:35,590 INFO L93 Difference]: Finished difference Result 257 states and 379 transitions. [2022-04-15 11:31:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2022-04-15 11:31:35,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:35,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:35,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 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 257 states. [2022-04-15 11:31:35,591 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 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 257 states. [2022-04-15 11:31:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:35,602 INFO L93 Difference]: Finished difference Result 257 states and 379 transitions. [2022-04-15 11:31:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2022-04-15 11:31:35,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:35,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:35,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:35,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 355 transitions. [2022-04-15 11:31:35,611 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 355 transitions. Word has length 59 [2022-04-15 11:31:35,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:35,612 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 355 transitions. [2022-04-15 11:31:35,612 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:35,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 355 transitions. [2022-04-15 11:31:35,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 355 transitions. [2022-04-15 11:31:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:31:35,823 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:35,823 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:35,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:31:35,823 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:35,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:35,823 INFO L85 PathProgramCache]: Analyzing trace with hash -861449916, now seen corresponding path program 3 times [2022-04-15 11:31:35,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:35,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [749281293] [2022-04-15 11:31:47,864 WARN L232 SmtUtils]: Spent 11.24s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:31:54,635 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:31:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash -861449916, now seen corresponding path program 4 times [2022-04-15 11:31:54,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:54,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447778545] [2022-04-15 11:31:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:54,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:54,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {4453#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {4446#true} is VALID [2022-04-15 11:31:54,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 11:31:54,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4446#true} {4446#true} #593#return; {4446#true} is VALID [2022-04-15 11:31:54,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {4446#true} call ULTIMATE.init(); {4453#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:31:54,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {4453#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {4446#true} is VALID [2022-04-15 11:31:54,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 11:31:54,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4446#true} {4446#true} #593#return; {4446#true} is VALID [2022-04-15 11:31:54,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {4446#true} call #t~ret158 := main(); {4446#true} is VALID [2022-04-15 11:31:54,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {4446#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4446#true} is VALID [2022-04-15 11:31:54,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {4446#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4446#true} is VALID [2022-04-15 11:31:54,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {4446#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {4446#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {4446#true} is VALID [2022-04-15 11:31:54,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {4446#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {4446#true} is VALID [2022-04-15 11:31:54,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {4446#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4446#true} is VALID [2022-04-15 11:31:54,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {4446#true} assume !false; {4446#true} is VALID [2022-04-15 11:31:54,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {4446#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {4446#true} assume 12292 == #t~mem49;havoc #t~mem49; {4446#true} is VALID [2022-04-15 11:31:54,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {4446#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4446#true} is VALID [2022-04-15 11:31:54,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {4446#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {4446#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4446#true} is VALID [2022-04-15 11:31:54,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {4446#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {4446#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {4446#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4446#true} is VALID [2022-04-15 11:31:54,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#true} assume !(0 == ~tmp___4~0); {4446#true} is VALID [2022-04-15 11:31:54,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {4446#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {4446#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {4446#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4446#true} is VALID [2022-04-15 11:31:54,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {4446#true} ~skip~0 := 0; {4446#true} is VALID [2022-04-15 11:31:54,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {4446#true} assume !false; {4446#true} is VALID [2022-04-15 11:31:54,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {4446#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {4446#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {4446#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {4446#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {4446#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {4446#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4446#true} is VALID [2022-04-15 11:31:54,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {4446#true} assume 4368 == #t~mem54;havoc #t~mem54; {4446#true} is VALID [2022-04-15 11:31:54,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {4446#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {4446#true} is VALID [2022-04-15 11:31:54,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {4446#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4446#true} is VALID [2022-04-15 11:31:54,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {4446#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:31:54,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:31:54,820 INFO L290 TraceCheckUtils]: 37: Hoare triple {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:31:54,820 INFO L290 TraceCheckUtils]: 38: Hoare triple {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:31:54,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:31:54,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:31:54,821 INFO L290 TraceCheckUtils]: 41: Hoare triple {4451#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4452#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-15 11:31:54,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {4452#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {4447#false} is VALID [2022-04-15 11:31:54,822 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4447#false} is VALID [2022-04-15 11:31:54,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {4447#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {4447#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4447#false} is VALID [2022-04-15 11:31:54,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {4447#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {4447#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,822 INFO L290 TraceCheckUtils]: 48: Hoare triple {4447#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4447#false} is VALID [2022-04-15 11:31:54,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {4447#false} assume !(0 == ~tmp___4~0); {4447#false} is VALID [2022-04-15 11:31:54,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {4447#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {4447#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {4447#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4447#false} is VALID [2022-04-15 11:31:54,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {4447#false} ~skip~0 := 0; {4447#false} is VALID [2022-04-15 11:31:54,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-15 11:31:54,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {4447#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,825 INFO L290 TraceCheckUtils]: 56: Hoare triple {4447#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,825 INFO L290 TraceCheckUtils]: 57: Hoare triple {4447#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,825 INFO L290 TraceCheckUtils]: 58: Hoare triple {4447#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,825 INFO L290 TraceCheckUtils]: 59: Hoare triple {4447#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,826 INFO L290 TraceCheckUtils]: 60: Hoare triple {4447#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,826 INFO L290 TraceCheckUtils]: 61: Hoare triple {4447#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,826 INFO L290 TraceCheckUtils]: 62: Hoare triple {4447#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,826 INFO L290 TraceCheckUtils]: 63: Hoare triple {4447#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,826 INFO L290 TraceCheckUtils]: 64: Hoare triple {4447#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {4447#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,826 INFO L290 TraceCheckUtils]: 66: Hoare triple {4447#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,826 INFO L290 TraceCheckUtils]: 67: Hoare triple {4447#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,826 INFO L290 TraceCheckUtils]: 68: Hoare triple {4447#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4447#false} is VALID [2022-04-15 11:31:54,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {4447#false} assume 4432 == #t~mem62;havoc #t~mem62; {4447#false} is VALID [2022-04-15 11:31:54,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {4447#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4447#false} is VALID [2022-04-15 11:31:54,827 INFO L290 TraceCheckUtils]: 71: Hoare triple {4447#false} assume 4 == ~blastFlag~0; {4447#false} is VALID [2022-04-15 11:31:54,827 INFO L290 TraceCheckUtils]: 72: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-15 11:31:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:31:54,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:54,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447778545] [2022-04-15 11:31:54,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447778545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:54,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:54,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:54,827 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:54,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [749281293] [2022-04-15 11:31:54,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [749281293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:54,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:54,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:54,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802756455] [2022-04-15 11:31:54,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:54,828 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 73 [2022-04-15 11:31:54,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:54,829 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-15 11:31:54,883 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-15 11:31:54,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:31:54,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:54,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:31:54,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:31:54,885 INFO L87 Difference]: Start difference. First operand 239 states and 355 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-15 11:31:56,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:57,811 INFO L93 Difference]: Finished difference Result 642 states and 963 transitions. [2022-04-15 11:31:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:31:57,811 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 73 [2022-04-15 11:31:57,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:57,812 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-15 11:31:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:31:57,815 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-15 11:31:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:31:57,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:31:58,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:58,124 INFO L225 Difference]: With dead ends: 642 [2022-04-15 11:31:58,124 INFO L226 Difference]: Without dead ends: 419 [2022-04-15 11:31:58,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:31:58,126 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:58,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:31:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-04-15 11:31:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 261. [2022-04-15 11:31:58,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:58,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:58,142 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:58,142 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:58,151 INFO L93 Difference]: Finished difference Result 419 states and 625 transitions. [2022-04-15 11:31:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 625 transitions. [2022-04-15 11:31:58,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:58,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:58,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 states have internal predecessors, (382), 3 states have call successors, (3), 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 419 states. [2022-04-15 11:31:58,153 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 states have internal predecessors, (382), 3 states have call successors, (3), 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 419 states. [2022-04-15 11:31:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:58,161 INFO L93 Difference]: Finished difference Result 419 states and 625 transitions. [2022-04-15 11:31:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 625 transitions. [2022-04-15 11:31:58,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:58,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:58,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:58,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.4921875) internal successors, (382), 256 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 386 transitions. [2022-04-15 11:31:58,168 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 386 transitions. Word has length 73 [2022-04-15 11:31:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:58,168 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 386 transitions. [2022-04-15 11:31:58,168 INFO L479 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-15 11:31:58,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 386 transitions. [2022-04-15 11:31:58,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 386 transitions. [2022-04-15 11:31:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:31:58,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:58,460 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:58,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:31:58,460 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1970430362, now seen corresponding path program 1 times [2022-04-15 11:31:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:58,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1834657408] [2022-04-15 11:32:10,914 WARN L232 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:32:17,023 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:32:17,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1970430362, now seen corresponding path program 2 times [2022-04-15 11:32:17,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:17,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46862119] [2022-04-15 11:32:17,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:17,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:17,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:17,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {7109#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {7102#true} is VALID [2022-04-15 11:32:17,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 11:32:17,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7102#true} {7102#true} #593#return; {7102#true} is VALID [2022-04-15 11:32:17,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {7102#true} call ULTIMATE.init(); {7109#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:32:17,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {7109#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {7102#true} is VALID [2022-04-15 11:32:17,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {7102#true} assume true; {7102#true} is VALID [2022-04-15 11:32:17,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7102#true} {7102#true} #593#return; {7102#true} is VALID [2022-04-15 11:32:17,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {7102#true} call #t~ret158 := main(); {7102#true} is VALID [2022-04-15 11:32:17,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {7102#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7102#true} is VALID [2022-04-15 11:32:17,219 INFO L272 TraceCheckUtils]: 6: Hoare triple {7102#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7102#true} is VALID [2022-04-15 11:32:17,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {7102#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {7102#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {7102#true} is VALID [2022-04-15 11:32:17,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {7102#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {7102#true} is VALID [2022-04-15 11:32:17,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {7102#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7102#true} is VALID [2022-04-15 11:32:17,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {7102#true} assume !false; {7102#true} is VALID [2022-04-15 11:32:17,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {7102#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {7102#true} assume 12292 == #t~mem49;havoc #t~mem49; {7102#true} is VALID [2022-04-15 11:32:17,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {7102#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {7102#true} is VALID [2022-04-15 11:32:17,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {7102#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {7102#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7102#true} is VALID [2022-04-15 11:32:17,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {7102#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {7102#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {7102#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7102#true} is VALID [2022-04-15 11:32:17,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {7102#true} assume !(0 == ~tmp___4~0); {7102#true} is VALID [2022-04-15 11:32:17,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {7102#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {7102#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {7102#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7102#true} is VALID [2022-04-15 11:32:17,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {7102#true} ~skip~0 := 0; {7102#true} is VALID [2022-04-15 11:32:17,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {7102#true} assume !false; {7102#true} is VALID [2022-04-15 11:32:17,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {7102#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {7102#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {7102#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {7102#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {7102#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {7102#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7102#true} is VALID [2022-04-15 11:32:17,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {7102#true} assume 4368 == #t~mem54;havoc #t~mem54; {7102#true} is VALID [2022-04-15 11:32:17,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {7102#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {7102#true} is VALID [2022-04-15 11:32:17,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {7102#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7102#true} is VALID [2022-04-15 11:32:17,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {7102#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:17,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:17,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:17,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:17,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:17,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:17,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:17,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {7107#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7108#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-15 11:32:17,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {7108#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {7103#false} is VALID [2022-04-15 11:32:17,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {7103#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {7103#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7103#false} is VALID [2022-04-15 11:32:17,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {7103#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {7103#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {7103#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7103#false} is VALID [2022-04-15 11:32:17,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {7103#false} assume !(0 == ~tmp___4~0); {7103#false} is VALID [2022-04-15 11:32:17,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {7103#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {7103#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {7103#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7103#false} is VALID [2022-04-15 11:32:17,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {7103#false} ~skip~0 := 0; {7103#false} is VALID [2022-04-15 11:32:17,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {7103#false} assume !false; {7103#false} is VALID [2022-04-15 11:32:17,240 INFO L290 TraceCheckUtils]: 55: Hoare triple {7103#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {7103#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {7103#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {7103#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {7103#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {7103#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {7103#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,240 INFO L290 TraceCheckUtils]: 62: Hoare triple {7103#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {7103#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {7103#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {7103#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {7103#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,241 INFO L290 TraceCheckUtils]: 67: Hoare triple {7103#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,241 INFO L290 TraceCheckUtils]: 68: Hoare triple {7103#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7103#false} is VALID [2022-04-15 11:32:17,241 INFO L290 TraceCheckUtils]: 69: Hoare triple {7103#false} assume 4432 == #t~mem62;havoc #t~mem62; {7103#false} is VALID [2022-04-15 11:32:17,241 INFO L290 TraceCheckUtils]: 70: Hoare triple {7103#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7103#false} is VALID [2022-04-15 11:32:17,241 INFO L290 TraceCheckUtils]: 71: Hoare triple {7103#false} assume 4 == ~blastFlag~0; {7103#false} is VALID [2022-04-15 11:32:17,241 INFO L290 TraceCheckUtils]: 72: Hoare triple {7103#false} assume !false; {7103#false} is VALID [2022-04-15 11:32:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:32:17,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46862119] [2022-04-15 11:32:17,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46862119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:17,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:17,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:17,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:17,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1834657408] [2022-04-15 11:32:17,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1834657408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:17,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:17,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540556980] [2022-04-15 11:32:17,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:17,245 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 73 [2022-04-15 11:32:17,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:17,245 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-15 11:32:17,300 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-15 11:32:17,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:32:17,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:17,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:32:17,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:32:17,302 INFO L87 Difference]: Start difference. First operand 261 states and 386 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-15 11:32:19,328 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:20,305 INFO L93 Difference]: Finished difference Result 665 states and 992 transitions. [2022-04-15 11:32:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:32:20,305 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 73 [2022-04-15 11:32:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:20,306 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-15 11:32:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:32:20,309 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-15 11:32:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:32:20,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 11:32:20,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:20,658 INFO L225 Difference]: With dead ends: 665 [2022-04-15 11:32:20,658 INFO L226 Difference]: Without dead ends: 420 [2022-04-15 11:32:20,658 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:32:20,659 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:32:20,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:32:20,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-15 11:32:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 263. [2022-04-15 11:32:20,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:20,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 420 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:20,682 INFO L74 IsIncluded]: Start isIncluded. First operand 420 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:20,682 INFO L87 Difference]: Start difference. First operand 420 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:20,690 INFO L93 Difference]: Finished difference Result 420 states and 623 transitions. [2022-04-15 11:32:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 623 transitions. [2022-04-15 11:32:20,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:20,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:20,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 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 420 states. [2022-04-15 11:32:20,692 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 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 420 states. [2022-04-15 11:32:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:20,700 INFO L93 Difference]: Finished difference Result 420 states and 623 transitions. [2022-04-15 11:32:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 623 transitions. [2022-04-15 11:32:20,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:20,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:20,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:20,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2022-04-15 11:32:20,706 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 73 [2022-04-15 11:32:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:20,706 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2022-04-15 11:32:20,706 INFO L479 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-15 11:32:20,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 387 transitions. [2022-04-15 11:32:20,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2022-04-15 11:32:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 11:32:20,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:20,989 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-04-15 11:32:20,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:32:20,989 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash -899406007, now seen corresponding path program 1 times [2022-04-15 11:32:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:20,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931251644] [2022-04-15 11:32:34,547 WARN L232 SmtUtils]: Spent 12.77s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:32:46,824 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:32:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash -899406007, now seen corresponding path program 2 times [2022-04-15 11:32:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:46,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052915475] [2022-04-15 11:32:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:46,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:46,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:46,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {9817#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {9810#true} is VALID [2022-04-15 11:32:46,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {9810#true} assume true; {9810#true} is VALID [2022-04-15 11:32:46,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9810#true} {9810#true} #593#return; {9810#true} is VALID [2022-04-15 11:32:46,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {9810#true} call ULTIMATE.init(); {9817#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:32:46,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {9817#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {9810#true} is VALID [2022-04-15 11:32:46,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {9810#true} assume true; {9810#true} is VALID [2022-04-15 11:32:46,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9810#true} {9810#true} #593#return; {9810#true} is VALID [2022-04-15 11:32:46,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {9810#true} call #t~ret158 := main(); {9810#true} is VALID [2022-04-15 11:32:46,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {9810#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {9810#true} is VALID [2022-04-15 11:32:46,971 INFO L272 TraceCheckUtils]: 6: Hoare triple {9810#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9810#true} is VALID [2022-04-15 11:32:46,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {9810#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {9810#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {9810#true} is VALID [2022-04-15 11:32:46,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {9810#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {9810#true} is VALID [2022-04-15 11:32:46,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {9810#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9810#true} is VALID [2022-04-15 11:32:46,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {9810#true} assume !false; {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {9810#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {9810#true} assume 12292 == #t~mem49;havoc #t~mem49; {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {9810#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {9810#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {9810#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {9810#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {9810#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {9810#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {9810#true} assume !(0 == ~tmp___4~0); {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {9810#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {9810#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {9810#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9810#true} is VALID [2022-04-15 11:32:46,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {9810#true} ~skip~0 := 0; {9810#true} is VALID [2022-04-15 11:32:46,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {9810#true} assume !false; {9810#true} is VALID [2022-04-15 11:32:46,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {9810#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {9810#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {9810#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {9810#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {9810#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {9810#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9810#true} is VALID [2022-04-15 11:32:46,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {9810#true} assume 4368 == #t~mem54;havoc #t~mem54; {9810#true} is VALID [2022-04-15 11:32:46,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {9810#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {9810#true} is VALID [2022-04-15 11:32:46,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {9810#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9810#true} is VALID [2022-04-15 11:32:46,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {9810#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:46,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:46,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:46,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:46,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:46,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:46,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:46,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:46,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {9815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9816#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-15 11:32:46,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {9816#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {9811#false} is VALID [2022-04-15 11:32:46,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {9811#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 46: Hoare triple {9811#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 47: Hoare triple {9811#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {9811#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {9811#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {9811#false} assume !(0 == ~tmp___4~0); {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {9811#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {9811#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {9811#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {9811#false} ~skip~0 := 0; {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {9811#false} assume !false; {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {9811#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {9811#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {9811#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 59: Hoare triple {9811#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {9811#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {9811#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {9811#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {9811#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 64: Hoare triple {9811#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 65: Hoare triple {9811#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {9811#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 67: Hoare triple {9811#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {9811#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {9811#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9811#false} is VALID [2022-04-15 11:32:46,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {9811#false} assume 4432 == #t~mem62;havoc #t~mem62; {9811#false} is VALID [2022-04-15 11:32:46,980 INFO L290 TraceCheckUtils]: 71: Hoare triple {9811#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9811#false} is VALID [2022-04-15 11:32:46,980 INFO L290 TraceCheckUtils]: 72: Hoare triple {9811#false} assume 4 == ~blastFlag~0; {9811#false} is VALID [2022-04-15 11:32:46,980 INFO L290 TraceCheckUtils]: 73: Hoare triple {9811#false} assume !false; {9811#false} is VALID [2022-04-15 11:32:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:32:46,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:46,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052915475] [2022-04-15 11:32:46,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052915475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:46,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:46,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:46,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:46,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931251644] [2022-04-15 11:32:46,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931251644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:46,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:46,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:46,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374454331] [2022-04-15 11:32:46,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:46,981 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 74 [2022-04-15 11:32:46,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:46,982 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-15 11:32:47,035 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-15 11:32:47,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:32:47,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:47,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:32:47,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:32:47,036 INFO L87 Difference]: Start difference. First operand 263 states and 387 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-15 11:32:49,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:49,935 INFO L93 Difference]: Finished difference Result 415 states and 613 transitions. [2022-04-15 11:32:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:32:49,936 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 74 [2022-04-15 11:32:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:49,936 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-15 11:32:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-15 11:32:49,938 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-15 11:32:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-15 11:32:49,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-15 11:32:50,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:50,184 INFO L225 Difference]: With dead ends: 415 [2022-04-15 11:32:50,184 INFO L226 Difference]: Without dead ends: 280 [2022-04-15 11:32:50,184 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:32:50,185 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:32:50,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:32:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-15 11:32:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-04-15 11:32:50,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:50,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:50,194 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:50,194 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:50,198 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2022-04-15 11:32:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-04-15 11:32:50,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:50,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:50,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 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 280 states. [2022-04-15 11:32:50,199 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 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 280 states. [2022-04-15 11:32:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:50,203 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2022-04-15 11:32:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-04-15 11:32:50,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:50,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:50,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:50,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 386 transitions. [2022-04-15 11:32:50,208 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 386 transitions. Word has length 74 [2022-04-15 11:32:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:50,208 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 386 transitions. [2022-04-15 11:32:50,209 INFO L479 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-15 11:32:50,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 386 transitions. [2022-04-15 11:32:50,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 386 transitions. [2022-04-15 11:32:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 11:32:50,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:50,483 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:32:50,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:32:50,484 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:50,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2000808735, now seen corresponding path program 1 times [2022-04-15 11:32:50,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:50,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2051909316] [2022-04-15 11:33:03,443 WARN L232 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:33:09,324 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:09,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2000808735, now seen corresponding path program 2 times [2022-04-15 11:33:09,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:09,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677554270] [2022-04-15 11:33:09,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:09,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:09,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:09,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {11745#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {11738#true} is VALID [2022-04-15 11:33:09,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {11738#true} assume true; {11738#true} is VALID [2022-04-15 11:33:09,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11738#true} {11738#true} #593#return; {11738#true} is VALID [2022-04-15 11:33:09,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {11738#true} call ULTIMATE.init(); {11745#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:09,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {11745#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {11738#true} assume true; {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11738#true} {11738#true} #593#return; {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {11738#true} call #t~ret158 := main(); {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {11738#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L272 TraceCheckUtils]: 6: Hoare triple {11738#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {11738#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {11738#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {11738#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {11738#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {11738#true} assume !false; {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {11738#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {11738#true} assume 12292 == #t~mem49;havoc #t~mem49; {11738#true} is VALID [2022-04-15 11:33:09,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {11738#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {11738#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {11738#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {11738#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {11738#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {11738#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {11738#true} assume !(0 == ~tmp___4~0); {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {11738#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {11738#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {11738#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {11738#true} ~skip~0 := 0; {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {11738#true} assume !false; {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {11738#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {11738#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {11738#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {11738#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {11738#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {11738#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11738#true} is VALID [2022-04-15 11:33:09,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {11738#true} assume 4368 == #t~mem54;havoc #t~mem54; {11738#true} is VALID [2022-04-15 11:33:09,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {11738#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11738#true} is VALID [2022-04-15 11:33:09,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {11738#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11738#true} is VALID [2022-04-15 11:33:09,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {11738#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:09,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:09,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:09,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:09,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:09,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:09,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:09,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:09,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:09,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {11743#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11744#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-15 11:33:09,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {11744#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {11739#false} is VALID [2022-04-15 11:33:09,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {11739#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,525 INFO L290 TraceCheckUtils]: 47: Hoare triple {11739#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11739#false} is VALID [2022-04-15 11:33:09,525 INFO L290 TraceCheckUtils]: 48: Hoare triple {11739#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {11739#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,525 INFO L290 TraceCheckUtils]: 50: Hoare triple {11739#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11739#false} is VALID [2022-04-15 11:33:09,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {11739#false} assume !(0 == ~tmp___4~0); {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {11739#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {11739#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 54: Hoare triple {11739#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {11739#false} ~skip~0 := 0; {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {11739#false} assume !false; {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {11739#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {11739#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 59: Hoare triple {11739#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {11739#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {11739#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {11739#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 63: Hoare triple {11739#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {11739#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,527 INFO L290 TraceCheckUtils]: 65: Hoare triple {11739#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,527 INFO L290 TraceCheckUtils]: 66: Hoare triple {11739#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,527 INFO L290 TraceCheckUtils]: 67: Hoare triple {11739#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,527 INFO L290 TraceCheckUtils]: 68: Hoare triple {11739#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,527 INFO L290 TraceCheckUtils]: 69: Hoare triple {11739#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,527 INFO L290 TraceCheckUtils]: 70: Hoare triple {11739#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11739#false} is VALID [2022-04-15 11:33:09,527 INFO L290 TraceCheckUtils]: 71: Hoare triple {11739#false} assume 4432 == #t~mem62;havoc #t~mem62; {11739#false} is VALID [2022-04-15 11:33:09,527 INFO L290 TraceCheckUtils]: 72: Hoare triple {11739#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11739#false} is VALID [2022-04-15 11:33:09,527 INFO L290 TraceCheckUtils]: 73: Hoare triple {11739#false} assume 4 == ~blastFlag~0; {11739#false} is VALID [2022-04-15 11:33:09,527 INFO L290 TraceCheckUtils]: 74: Hoare triple {11739#false} assume !false; {11739#false} is VALID [2022-04-15 11:33:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:33:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677554270] [2022-04-15 11:33:09,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677554270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:09,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:09,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:09,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2051909316] [2022-04-15 11:33:09,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2051909316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:09,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:09,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311857206] [2022-04-15 11:33:09,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:09,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 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 75 [2022-04-15 11:33:09,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:09,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:09,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:09,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:33:09,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:09,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:33:09,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:33:09,581 INFO L87 Difference]: Start difference. First operand 263 states and 386 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:11,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:12,397 INFO L93 Difference]: Finished difference Result 415 states and 611 transitions. [2022-04-15 11:33:12,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:33:12,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 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 75 [2022-04-15 11:33:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-15 11:33:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-15 11:33:12,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-15 11:33:12,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:12,673 INFO L225 Difference]: With dead ends: 415 [2022-04-15 11:33:12,674 INFO L226 Difference]: Without dead ends: 280 [2022-04-15 11:33:12,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:33:12,674 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 33 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:12,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 478 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:33:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-15 11:33:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-04-15 11:33:12,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:12,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:12,683 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:12,683 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:12,687 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-15 11:33:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-15 11:33:12,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:12,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:12,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 states have internal predecessors, (381), 3 states have call successors, (3), 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 280 states. [2022-04-15 11:33:12,688 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 states have internal predecessors, (381), 3 states have call successors, (3), 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 280 states. [2022-04-15 11:33:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:12,692 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-15 11:33:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-15 11:33:12,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:12,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:12,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:12,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4767441860465116) internal successors, (381), 258 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 385 transitions. [2022-04-15 11:33:12,697 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 385 transitions. Word has length 75 [2022-04-15 11:33:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:12,697 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 385 transitions. [2022-04-15 11:33:12,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:12,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 385 transitions. [2022-04-15 11:33:12,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 385 transitions. [2022-04-15 11:33:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 11:33:12,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:12,981 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:33:12,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:33:12,982 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:12,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1727974300, now seen corresponding path program 1 times [2022-04-15 11:33:12,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:12,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1834685954] [2022-04-15 11:33:26,655 WARN L232 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:33:33,056 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1727974300, now seen corresponding path program 2 times [2022-04-15 11:33:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:33,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028380619] [2022-04-15 11:33:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:33,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:33,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:33,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {13673#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {13666#true} is VALID [2022-04-15 11:33:33,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {13666#true} assume true; {13666#true} is VALID [2022-04-15 11:33:33,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13666#true} {13666#true} #593#return; {13666#true} is VALID [2022-04-15 11:33:33,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {13666#true} call ULTIMATE.init(); {13673#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:33,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {13673#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {13666#true} is VALID [2022-04-15 11:33:33,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {13666#true} assume true; {13666#true} is VALID [2022-04-15 11:33:33,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13666#true} {13666#true} #593#return; {13666#true} is VALID [2022-04-15 11:33:33,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {13666#true} call #t~ret158 := main(); {13666#true} is VALID [2022-04-15 11:33:33,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {13666#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L272 TraceCheckUtils]: 6: Hoare triple {13666#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {13666#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {13666#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {13666#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {13666#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {13666#true} assume !false; {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {13666#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {13666#true} assume 12292 == #t~mem49;havoc #t~mem49; {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {13666#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {13666#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {13666#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {13666#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {13666#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {13666#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {13666#true} assume !(0 == ~tmp___4~0); {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {13666#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {13666#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {13666#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {13666#true} ~skip~0 := 0; {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {13666#true} assume !false; {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {13666#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {13666#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {13666#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {13666#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {13666#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {13666#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {13666#true} assume 4368 == #t~mem54;havoc #t~mem54; {13666#true} is VALID [2022-04-15 11:33:33,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {13666#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {13666#true} is VALID [2022-04-15 11:33:33,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {13666#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13666#true} is VALID [2022-04-15 11:33:33,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {13666#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:33,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:33,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:33,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:33,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:33,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:33,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:33,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:33,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:33,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:33,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {13671#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13672#(= |ssl3_connect_#t~mem53| 4384)} is VALID [2022-04-15 11:33:33,212 INFO L290 TraceCheckUtils]: 46: Hoare triple {13672#(= |ssl3_connect_#t~mem53| 4384)} assume 4099 == #t~mem53;havoc #t~mem53; {13667#false} is VALID [2022-04-15 11:33:33,212 INFO L290 TraceCheckUtils]: 47: Hoare triple {13667#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,212 INFO L290 TraceCheckUtils]: 48: Hoare triple {13667#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13667#false} is VALID [2022-04-15 11:33:33,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {13667#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {13667#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 51: Hoare triple {13667#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {13667#false} assume !(0 == ~tmp___4~0); {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {13667#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {13667#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 55: Hoare triple {13667#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {13667#false} ~skip~0 := 0; {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 57: Hoare triple {13667#false} assume !false; {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 58: Hoare triple {13667#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 59: Hoare triple {13667#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {13667#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {13667#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 62: Hoare triple {13667#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,213 INFO L290 TraceCheckUtils]: 63: Hoare triple {13667#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 64: Hoare triple {13667#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 65: Hoare triple {13667#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 66: Hoare triple {13667#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 67: Hoare triple {13667#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 68: Hoare triple {13667#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 69: Hoare triple {13667#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 70: Hoare triple {13667#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 71: Hoare triple {13667#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 72: Hoare triple {13667#false} assume 4432 == #t~mem62;havoc #t~mem62; {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {13667#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {13667#false} assume 4 == ~blastFlag~0; {13667#false} is VALID [2022-04-15 11:33:33,214 INFO L290 TraceCheckUtils]: 75: Hoare triple {13667#false} assume !false; {13667#false} is VALID [2022-04-15 11:33:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:33:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:33,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028380619] [2022-04-15 11:33:33,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028380619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:33,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:33,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:33,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:33,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1834685954] [2022-04-15 11:33:33,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1834685954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:33,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:33,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:33,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851668311] [2022-04-15 11:33:33,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:33,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 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 76 [2022-04-15 11:33:33,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:33,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 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-15 11:33:33,271 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-15 11:33:33,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:33:33,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:33,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:33:33,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:33:33,272 INFO L87 Difference]: Start difference. First operand 263 states and 385 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 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-15 11:33:35,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:36,082 INFO L93 Difference]: Finished difference Result 406 states and 598 transitions. [2022-04-15 11:33:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:33:36,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 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 76 [2022-04-15 11:33:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 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-15 11:33:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-15 11:33:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 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-15 11:33:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-15 11:33:36,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 371 transitions. [2022-04-15 11:33:36,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:36,336 INFO L225 Difference]: With dead ends: 406 [2022-04-15 11:33:36,336 INFO L226 Difference]: Without dead ends: 271 [2022-04-15 11:33:36,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:33:36,337 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:36,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 464 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 326 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:33:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-15 11:33:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2022-04-15 11:33:36,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:36,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:36,345 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:36,345 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:36,349 INFO L93 Difference]: Finished difference Result 271 states and 396 transitions. [2022-04-15 11:33:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 396 transitions. [2022-04-15 11:33:36,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:36,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:36,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 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 271 states. [2022-04-15 11:33:36,351 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 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 271 states. [2022-04-15 11:33:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:36,355 INFO L93 Difference]: Finished difference Result 271 states and 396 transitions. [2022-04-15 11:33:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 396 transitions. [2022-04-15 11:33:36,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:36,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:36,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:36,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4728682170542635) internal successors, (380), 258 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 384 transitions. [2022-04-15 11:33:36,359 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 384 transitions. Word has length 76 [2022-04-15 11:33:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:36,360 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 384 transitions. [2022-04-15 11:33:36,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 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-15 11:33:36,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 384 transitions. [2022-04-15 11:33:36,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 384 transitions. [2022-04-15 11:33:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:33:36,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:36,644 INFO L499 BasicCegarLoop]: 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] [2022-04-15 11:33:36,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:33:36,644 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:36,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash -988156823, now seen corresponding path program 1 times [2022-04-15 11:33:36,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:36,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1617923362] [2022-04-15 11:33:36,645 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash -988156823, now seen corresponding path program 2 times [2022-04-15 11:33:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:36,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22784469] [2022-04-15 11:33:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:36,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:36,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {15564#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {15558#true} is VALID [2022-04-15 11:33:36,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {15558#true} assume true; {15558#true} is VALID [2022-04-15 11:33:36,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15558#true} {15558#true} #593#return; {15558#true} is VALID [2022-04-15 11:33:36,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {15558#true} call ULTIMATE.init(); {15564#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:36,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {15564#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {15558#true} is VALID [2022-04-15 11:33:36,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {15558#true} assume true; {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15558#true} {15558#true} #593#return; {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {15558#true} call #t~ret158 := main(); {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {15558#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L272 TraceCheckUtils]: 6: Hoare triple {15558#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {15558#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {15558#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {15558#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {15558#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {15558#true} assume !false; {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {15558#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {15558#true} assume 12292 == #t~mem49;havoc #t~mem49; {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {15558#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {15558#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {15558#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {15558#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {15558#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {15558#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {15558#true} assume !(0 == ~tmp___4~0); {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {15558#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {15558#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {15558#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {15558#true} ~skip~0 := 0; {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {15558#true} assume !false; {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {15558#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {15558#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {15558#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {15558#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {15558#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {15558#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {15558#true} assume 4368 == #t~mem54;havoc #t~mem54; {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {15558#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {15558#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {15558#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {15558#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {15558#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {15558#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {15558#true} ~skip~0 := 0; {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {15558#true} assume !false; {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {15558#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {15558#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {15558#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {15558#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {15558#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {15558#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {15558#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {15558#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15558#true} is VALID [2022-04-15 11:33:36,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {15558#true} assume 4384 == #t~mem56;havoc #t~mem56; {15558#true} is VALID [2022-04-15 11:33:36,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {15558#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15558#true} is VALID [2022-04-15 11:33:36,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {15558#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,780 INFO L290 TraceCheckUtils]: 54: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,781 INFO L290 TraceCheckUtils]: 58: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,781 INFO L290 TraceCheckUtils]: 59: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,782 INFO L290 TraceCheckUtils]: 60: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,783 INFO L290 TraceCheckUtils]: 64: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,783 INFO L290 TraceCheckUtils]: 66: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,783 INFO L290 TraceCheckUtils]: 67: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,784 INFO L290 TraceCheckUtils]: 69: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,784 INFO L290 TraceCheckUtils]: 70: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,784 INFO L290 TraceCheckUtils]: 71: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,785 INFO L290 TraceCheckUtils]: 72: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,785 INFO L290 TraceCheckUtils]: 73: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,785 INFO L290 TraceCheckUtils]: 74: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15563#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:36,786 INFO L290 TraceCheckUtils]: 75: Hoare triple {15563#(= 2 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {15559#false} is VALID [2022-04-15 11:33:36,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {15559#false} assume !false; {15559#false} is VALID [2022-04-15 11:33:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 11:33:36,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:36,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22784469] [2022-04-15 11:33:36,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22784469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:36,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:36,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:33:36,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:36,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1617923362] [2022-04-15 11:33:36,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1617923362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:36,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:36,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:33:36,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939412802] [2022-04-15 11:33:36,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:36,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 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 77 [2022-04-15 11:33:36,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:36,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:36,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:36,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:33:36,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:36,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:33:36,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:33:36,854 INFO L87 Difference]: Start difference. First operand 263 states and 384 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:38,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:39,689 INFO L93 Difference]: Finished difference Result 530 states and 782 transitions. [2022-04-15 11:33:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:33:39,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 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 77 [2022-04-15 11:33:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 11:33:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 11:33:39,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-15 11:33:40,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:40,175 INFO L225 Difference]: With dead ends: 530 [2022-04-15 11:33:40,175 INFO L226 Difference]: Without dead ends: 395 [2022-04-15 11:33:40,176 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:33:40,177 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:40,179 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:33:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-15 11:33:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-04-15 11:33:40,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:40,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:40,190 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:40,190 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:40,197 INFO L93 Difference]: Finished difference Result 395 states and 576 transitions. [2022-04-15 11:33:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2022-04-15 11:33:40,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:40,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:40,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 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 395 states. [2022-04-15 11:33:40,199 INFO L87 Difference]: Start difference. First operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 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 395 states. [2022-04-15 11:33:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:40,225 INFO L93 Difference]: Finished difference Result 395 states and 576 transitions. [2022-04-15 11:33:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2022-04-15 11:33:40,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:40,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:40,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:40,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4666666666666666) internal successors, (572), 390 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 576 transitions. [2022-04-15 11:33:40,234 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 576 transitions. Word has length 77 [2022-04-15 11:33:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:40,234 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 576 transitions. [2022-04-15 11:33:40,234 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:40,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 395 states and 576 transitions. [2022-04-15 11:33:40,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2022-04-15 11:33:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:33:40,677 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:40,677 INFO L499 BasicCegarLoop]: 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] [2022-04-15 11:33:40,677 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:33:40,677 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:40,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash -926117209, now seen corresponding path program 1 times [2022-04-15 11:33:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:40,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1588405414] [2022-04-15 11:33:40,679 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:40,679 INFO L85 PathProgramCache]: Analyzing trace with hash -926117209, now seen corresponding path program 2 times [2022-04-15 11:33:40,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:40,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823262388] [2022-04-15 11:33:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:40,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:40,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {18213#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {18207#true} is VALID [2022-04-15 11:33:40,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {18207#true} assume true; {18207#true} is VALID [2022-04-15 11:33:40,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18207#true} {18207#true} #593#return; {18207#true} is VALID [2022-04-15 11:33:40,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {18207#true} call ULTIMATE.init(); {18213#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:40,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {18213#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {18207#true} is VALID [2022-04-15 11:33:40,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {18207#true} assume true; {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18207#true} {18207#true} #593#return; {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {18207#true} call #t~ret158 := main(); {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {18207#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L272 TraceCheckUtils]: 6: Hoare triple {18207#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {18207#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {18207#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {18207#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {18207#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {18207#true} assume !false; {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {18207#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {18207#true} assume 12292 == #t~mem49;havoc #t~mem49; {18207#true} is VALID [2022-04-15 11:33:40,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {18207#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {18207#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {18207#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {18207#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {18207#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {18207#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {18207#true} assume !(0 == ~tmp___4~0); {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {18207#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {18207#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {18207#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {18207#true} ~skip~0 := 0; {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {18207#true} assume !false; {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {18207#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {18207#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {18207#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {18207#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {18207#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {18207#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18207#true} is VALID [2022-04-15 11:33:40,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {18207#true} assume 4368 == #t~mem54;havoc #t~mem54; {18207#true} is VALID [2022-04-15 11:33:40,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {18207#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {18207#true} is VALID [2022-04-15 11:33:40,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {18207#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {18212#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:33:40,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {18212#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18208#false} is VALID [2022-04-15 11:33:40,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {18208#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {18208#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {18208#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,809 INFO L290 TraceCheckUtils]: 55: Hoare triple {18208#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {18208#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {18208#false} ~skip~0 := 0; {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 58: Hoare triple {18208#false} assume !false; {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 59: Hoare triple {18208#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 60: Hoare triple {18208#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 61: Hoare triple {18208#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 62: Hoare triple {18208#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 63: Hoare triple {18208#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 64: Hoare triple {18208#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {18208#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 66: Hoare triple {18208#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 67: Hoare triple {18208#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 68: Hoare triple {18208#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,810 INFO L290 TraceCheckUtils]: 69: Hoare triple {18208#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,811 INFO L290 TraceCheckUtils]: 70: Hoare triple {18208#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,811 INFO L290 TraceCheckUtils]: 71: Hoare triple {18208#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,811 INFO L290 TraceCheckUtils]: 72: Hoare triple {18208#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18208#false} is VALID [2022-04-15 11:33:40,811 INFO L290 TraceCheckUtils]: 73: Hoare triple {18208#false} assume 4432 == #t~mem62;havoc #t~mem62; {18208#false} is VALID [2022-04-15 11:33:40,811 INFO L290 TraceCheckUtils]: 74: Hoare triple {18208#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {18208#false} is VALID [2022-04-15 11:33:40,811 INFO L290 TraceCheckUtils]: 75: Hoare triple {18208#false} assume 4 == ~blastFlag~0; {18208#false} is VALID [2022-04-15 11:33:40,811 INFO L290 TraceCheckUtils]: 76: Hoare triple {18208#false} assume !false; {18208#false} is VALID [2022-04-15 11:33:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:33:40,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:40,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823262388] [2022-04-15 11:33:40,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823262388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:40,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:40,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:33:40,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:40,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1588405414] [2022-04-15 11:33:40,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1588405414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:40,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:40,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:33:40,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611522937] [2022-04-15 11:33:40,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:40,813 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 77 [2022-04-15 11:33:40,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:40,813 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-15 11:33:40,864 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-15 11:33:40,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:33:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:33:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:33:40,865 INFO L87 Difference]: Start difference. First operand 395 states and 576 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-15 11:33:42,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:43,425 INFO L93 Difference]: Finished difference Result 687 states and 1004 transitions. [2022-04-15 11:33:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:33:43,425 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 77 [2022-04-15 11:33:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:43,425 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-15 11:33:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2022-04-15 11:33:43,428 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-15 11:33:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2022-04-15 11:33:43,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 369 transitions. [2022-04-15 11:33:43,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 369 edges. 369 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:43,667 INFO L225 Difference]: With dead ends: 687 [2022-04-15 11:33:43,667 INFO L226 Difference]: Without dead ends: 420 [2022-04-15 11:33:43,668 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:33:43,668 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 16 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:43,669 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 358 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:33:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-15 11:33:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-04-15 11:33:43,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:43,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:43,680 INFO L74 IsIncluded]: Start isIncluded. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:43,680 INFO L87 Difference]: Start difference. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:43,686 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-15 11:33:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:33:43,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:43,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:43,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 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 420 states. [2022-04-15 11:33:43,688 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 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 420 states. [2022-04-15 11:33:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:43,694 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-15 11:33:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:33:43,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:43,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:43,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:43,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 609 transitions. [2022-04-15 11:33:43,703 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 609 transitions. Word has length 77 [2022-04-15 11:33:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:43,703 INFO L478 AbstractCegarLoop]: Abstraction has 420 states and 609 transitions. [2022-04-15 11:33:43,704 INFO L479 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-15 11:33:43,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 420 states and 609 transitions. [2022-04-15 11:33:44,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:33:44,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 11:33:44,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:44,134 INFO L499 BasicCegarLoop]: 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] [2022-04-15 11:33:44,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:33:44,134 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:44,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash 140608816, now seen corresponding path program 1 times [2022-04-15 11:33:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:44,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026774488] [2022-04-15 11:33:44,135 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash 140608816, now seen corresponding path program 2 times [2022-04-15 11:33:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:44,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403939389] [2022-04-15 11:33:44,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:44,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:44,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:44,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {21276#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {21270#true} is VALID [2022-04-15 11:33:44,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {21270#true} assume true; {21270#true} is VALID [2022-04-15 11:33:44,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21270#true} {21270#true} #593#return; {21270#true} is VALID [2022-04-15 11:33:44,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {21270#true} call ULTIMATE.init(); {21276#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:44,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {21276#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 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); {21270#true} is VALID [2022-04-15 11:33:44,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {21270#true} assume true; {21270#true} is VALID [2022-04-15 11:33:44,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21270#true} {21270#true} #593#return; {21270#true} is VALID [2022-04-15 11:33:44,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {21270#true} call #t~ret158 := main(); {21270#true} is VALID [2022-04-15 11:33:44,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {21270#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {21270#true} is VALID [2022-04-15 11:33:44,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {21270#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21270#true} is VALID [2022-04-15 11:33:44,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {21270#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {21270#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {21270#true} is VALID [2022-04-15 11:33:44,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {21270#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {21270#true} is VALID [2022-04-15 11:33:44,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {21270#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21270#true} is VALID [2022-04-15 11:33:44,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-15 11:33:44,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {21270#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {21270#true} assume 12292 == #t~mem49;havoc #t~mem49; {21270#true} is VALID [2022-04-15 11:33:44,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {21270#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {21270#true} is VALID [2022-04-15 11:33:44,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {21270#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {21270#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {21270#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {21270#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {21270#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {21270#true} assume !(0 == ~tmp___4~0); {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {21270#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {21270#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {21270#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {21270#true} ~skip~0 := 0; {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {21270#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {21270#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {21270#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {21270#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {21270#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {21270#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {21270#true} assume 4368 == #t~mem54;havoc #t~mem54; {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {21270#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {21270#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {21270#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {21270#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {21270#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {21270#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {21270#true} ~skip~0 := 0; {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {21270#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {21270#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {21270#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {21270#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {21270#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {21270#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {21270#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {21270#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {21270#true} assume 4384 == #t~mem56;havoc #t~mem56; {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {21270#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {21270#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {21270#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {21270#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {21270#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {21270#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {21270#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 57: Hoare triple {21270#true} ~skip~0 := 0; {21270#true} is VALID [2022-04-15 11:33:44,309 INFO L290 TraceCheckUtils]: 58: Hoare triple {21270#true} assume !false; {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {21270#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 60: Hoare triple {21270#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 61: Hoare triple {21270#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 62: Hoare triple {21270#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 63: Hoare triple {21270#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 64: Hoare triple {21270#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 65: Hoare triple {21270#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 66: Hoare triple {21270#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 67: Hoare triple {21270#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {21270#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 69: Hoare triple {21270#true} assume 4400 == #t~mem58;havoc #t~mem58; {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 70: Hoare triple {21270#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {21270#true} is VALID [2022-04-15 11:33:44,310 INFO L290 TraceCheckUtils]: 71: Hoare triple {21270#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {21270#true} is VALID [2022-04-15 11:33:44,317 INFO L290 TraceCheckUtils]: 72: Hoare triple {21270#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,318 INFO L290 TraceCheckUtils]: 73: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,318 INFO L290 TraceCheckUtils]: 74: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,318 INFO L290 TraceCheckUtils]: 75: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,318 INFO L290 TraceCheckUtils]: 76: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,319 INFO L290 TraceCheckUtils]: 78: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,319 INFO L290 TraceCheckUtils]: 79: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,319 INFO L290 TraceCheckUtils]: 80: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,319 INFO L290 TraceCheckUtils]: 81: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,320 INFO L290 TraceCheckUtils]: 82: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,320 INFO L290 TraceCheckUtils]: 83: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,320 INFO L290 TraceCheckUtils]: 84: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,320 INFO L290 TraceCheckUtils]: 85: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,321 INFO L290 TraceCheckUtils]: 86: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,321 INFO L290 TraceCheckUtils]: 87: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,321 INFO L290 TraceCheckUtils]: 88: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,321 INFO L290 TraceCheckUtils]: 89: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,322 INFO L290 TraceCheckUtils]: 90: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,322 INFO L290 TraceCheckUtils]: 91: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,322 INFO L290 TraceCheckUtils]: 92: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,322 INFO L290 TraceCheckUtils]: 93: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,323 INFO L290 TraceCheckUtils]: 94: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21275#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:44,323 INFO L290 TraceCheckUtils]: 95: Hoare triple {21275#(= 3 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {21271#false} is VALID [2022-04-15 11:33:44,323 INFO L290 TraceCheckUtils]: 96: Hoare triple {21271#false} assume !false; {21271#false} is VALID [2022-04-15 11:33:44,323 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-15 11:33:44,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:44,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403939389] [2022-04-15 11:33:44,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403939389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:44,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:44,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:33:44,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:44,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1026774488] [2022-04-15 11:33:44,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1026774488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:44,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:44,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:33:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949575551] [2022-04-15 11:33:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:44,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 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 97 [2022-04-15 11:33:44,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:44,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:44,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:44,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:33:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:33:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:33:44,395 INFO L87 Difference]: Start difference. First operand 420 states and 609 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:46,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:47,243 INFO L93 Difference]: Finished difference Result 843 states and 1231 transitions. [2022-04-15 11:33:47,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:33:47,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 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 97 [2022-04-15 11:33:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:33:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:33:47,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-15 11:33:47,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:47,543 INFO L225 Difference]: With dead ends: 843 [2022-04-15 11:33:47,543 INFO L226 Difference]: Without dead ends: 551 [2022-04-15 11:33:47,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:33:47,544 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:47,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:33:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-04-15 11:33:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2022-04-15 11:33:47,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:47,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:47,559 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:47,559 INFO L87 Difference]: Start difference. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:47,569 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-15 11:33:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:33:47,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:47,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:47,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 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 551 states. [2022-04-15 11:33:47,572 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 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 551 states. [2022-04-15 11:33:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:47,582 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-15 11:33:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:33:47,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:47,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:47,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:47,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 800 transitions. [2022-04-15 11:33:47,595 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 800 transitions. Word has length 97 [2022-04-15 11:33:47,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:47,595 INFO L478 AbstractCegarLoop]: Abstraction has 551 states and 800 transitions. [2022-04-15 11:33:47,595 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:47,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 800 transitions. [2022-04-15 11:33:48,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 800 edges. 800 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:33:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 11:33:48,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:48,137 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:33:48,137 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:33:48,137 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:48,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 1 times [2022-04-15 11:33:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:48,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1951763418] [2022-04-15 11:33:48,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 2 times [2022-04-15 11:33:48,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:48,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450026396] [2022-04-15 11:33:48,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:48,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 11:33:49,010 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 11:33:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 11:33:49,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 11:33:49,471 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 11:33:49,471 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 11:33:49,474 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 11:33:49,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:33:49,477 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 11:33:49,479 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-15 11:33:49,514 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 11:33:49,515 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 11:33:49,515 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 11:33:49,515 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 11:33:49,515 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-15 11:33:49,515 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-15 11:33:49,515 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-15 11:33:49,515 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 11:33:49,515 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 11:33:49,515 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1135-2 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1675-1 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 11:33:49,516 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1655 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1659-2 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1261 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1266-2 has no Hoare annotation [2022-04-15 11:33:49,517 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1319-2 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1319-2 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1319 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1319 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-15 11:33:49,518 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1332 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1332 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1341 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1341 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1341-2 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1341-2 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1624-1 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-15 11:33:49,519 WARN L170 areAnnotationChecker]: L1360-2 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-15 11:33:49,520 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-15 11:33:49,521 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1453-2 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-15 11:33:49,522 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1512-1 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 11:33:49,523 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 11:33:49,524 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-15 11:33:49,524 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-15 11:33:49,524 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-15 11:33:49,524 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-15 11:33:49,524 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-15 11:33:49,524 WARN L170 areAnnotationChecker]: L1542-1 has no Hoare annotation [2022-04-15 11:33:49,524 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-15 11:33:49,524 WARN L170 areAnnotationChecker]: L1255 has no Hoare annotation [2022-04-15 11:33:49,524 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-15 11:33:49,525 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-15 11:33:49,525 WARN L170 areAnnotationChecker]: L1558-2 has no Hoare annotation [2022-04-15 11:33:49,525 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-15 11:33:49,525 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-15 11:33:49,525 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-15 11:33:49,525 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-15 11:33:49,525 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-15 11:33:49,525 WARN L170 areAnnotationChecker]: L1570-2 has no Hoare annotation [2022-04-15 11:33:49,525 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-15 11:33:49,525 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-15 11:33:49,525 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 11:33:49,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 11:33:49 BoogieIcfgContainer [2022-04-15 11:33:49,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 11:33:49,529 INFO L158 Benchmark]: Toolchain (without parser) took 147775.87ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 134.3MB in the beginning and 210.0MB in the end (delta: -75.6MB). Peak memory consumption was 142.1MB. Max. memory is 8.0GB. [2022-04-15 11:33:49,529 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:33:49,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.04ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 134.1MB in the beginning and 179.9MB in the end (delta: -45.8MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-15 11:33:49,529 INFO L158 Benchmark]: Boogie Preprocessor took 84.07ms. Allocated memory is still 226.5MB. Free memory was 179.9MB in the beginning and 170.5MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 11:33:49,529 INFO L158 Benchmark]: RCFGBuilder took 1891.76ms. Allocated memory is still 226.5MB. Free memory was 170.5MB in the beginning and 158.3MB in the end (delta: 12.2MB). Peak memory consumption was 68.1MB. Max. memory is 8.0GB. [2022-04-15 11:33:49,533 INFO L158 Benchmark]: TraceAbstraction took 145350.40ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 157.8MB in the beginning and 210.0MB in the end (delta: -52.2MB). Peak memory consumption was 127.3MB. Max. memory is 8.0GB. [2022-04-15 11:33:49,533 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.09ms. Allocated memory is still 188.7MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 446.04ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 134.1MB in the beginning and 179.9MB in the end (delta: -45.8MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 84.07ms. Allocated memory is still 226.5MB. Free memory was 179.9MB in the beginning and 170.5MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1891.76ms. Allocated memory is still 226.5MB. Free memory was 170.5MB in the beginning and 158.3MB in the end (delta: 12.2MB). Peak memory consumption was 68.1MB. Max. memory is 8.0GB. * TraceAbstraction took 145350.40ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 157.8MB in the beginning and 210.0MB in the end (delta: -52.2MB). Peak memory consumption was 127.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1665]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1360. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) [L1271] EXPR s->version [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 [L1325] COND FALSE !(ret <= 0) [L1330] s->state = 4384 [L1331] s->init_num = 0 [L1332] EXPR s->bbio [L1332] EXPR s->wbio [L1332] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND TRUE s->state == 4384 [L1340] ret = __VERIFIER_nondet_int() [L1341] COND TRUE blastFlag == 1 [L1342] blastFlag = 2 [L1346] COND FALSE !(ret <= 0) [L1351] s->hit [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 [L1356] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND TRUE s->state == 4400 [L1360] EXPR s->s3 [L1360] EXPR (s->s3)->tmp.new_cipher [L1360] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 [L1369] COND FALSE !(ret <= 0) [L1375] s->state = 4416 [L1376] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 [L1393] COND FALSE !(! tmp___6) [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 [L1665] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 145.3s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 34.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 754 SdHoareTripleChecker+Valid, 25.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 754 mSDsluCounter, 4666 SdHoareTripleChecker+Invalid, 25.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2483 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3545 IncrementalHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 2183 mSDtfsCounter, 3545 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 376 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-15 11:33:49,550 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...