/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.04.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:34:34,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:34:34,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:34:34,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:34:34,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:34:34,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:34:34,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:34:34,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:34:34,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:34:34,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:34:34,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:34:34,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:34:34,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:34:34,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:34:34,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:34:34,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:34:34,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:34:34,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:34:34,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:34:34,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:34:34,652 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:34:34,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:34:34,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:34:34,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:34:34,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:34:34,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:34:34,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:34:34,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:34:34,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:34:34,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:34:34,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:34:34,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:34:34,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:34:34,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:34:34,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:34:34,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:34:34,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:34:34,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:34:34,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:34:34,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:34:34,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:34:34,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:34:34,673 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:34:34,686 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:34:34,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:34:34,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:34:34,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:34:34,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:34:34,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:34:34,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:34:34,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:34:34,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:34:34,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:34:34,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:34:34,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:34:34,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:34:34,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:34:34,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:34:34,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:34:34,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:34:34,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:34:34,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:34:34,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:34:34,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:34:34,691 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:34:34,691 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:34:34,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:34:34,691 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:34:34,692 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:34:34,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:34:34,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:34:34,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:34:34,930 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:34:34,931 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:34:34,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-1.c [2022-04-15 11:34:34,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7b787be/c2fddb445a364baabe45af14d3eb6b22/FLAGf44160836 [2022-04-15 11:34:35,513 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:34:35,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-1.c [2022-04-15 11:34:35,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7b787be/c2fddb445a364baabe45af14d3eb6b22/FLAGf44160836 [2022-04-15 11:34:35,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7b787be/c2fddb445a364baabe45af14d3eb6b22 [2022-04-15 11:34:35,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:34:35,835 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:34:35,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:34:35,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:34:35,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:34:35,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:34:35" (1/1) ... [2022-04-15 11:34:35,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8eb9503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:35, skipping insertion in model container [2022-04-15 11:34:35,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:34:35" (1/1) ... [2022-04-15 11:34:35,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:34:35,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:34:36,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-04-15 11:34:36,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:34:36,367 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:34:36,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-04-15 11:34:36,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:34:36,494 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:34:36,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:36 WrapperNode [2022-04-15 11:34:36,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:34:36,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:34:36,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:34:36,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:34:36,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:36" (1/1) ... [2022-04-15 11:34:36,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:36" (1/1) ... [2022-04-15 11:34:36,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:36" (1/1) ... [2022-04-15 11:34:36,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:36" (1/1) ... [2022-04-15 11:34:36,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:36" (1/1) ... [2022-04-15 11:34:36,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:36" (1/1) ... [2022-04-15 11:34:36,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:36" (1/1) ... [2022-04-15 11:34:36,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:34:36,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:34:36,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:34:36,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:34:36,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:36" (1/1) ... [2022-04-15 11:34:36,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:34:36,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:34:36,693 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:34:36,698 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:34:36,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:34:36,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:34:36,727 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:34:36,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 11:34:36,727 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 11:34:36,728 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:34:36,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 11:34:36,728 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:34:36,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:34:36,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:34:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:34:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:34:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:34:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:34:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:34:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:34:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:34:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:34:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:34:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:34:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 11:34:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:34:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 11:34:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 11:34:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:34:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:34:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:34:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:34:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:34:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:34:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:34:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:34:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:34:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:34:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:34:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:34:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:34:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:34:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:34:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:34:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:34:36,917 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:34:36,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:34:38,576 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:34:39,090 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 11:34:39,091 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 11:34:39,103 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:34:39,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:34:39,111 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:34:39,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:34:39 BoogieIcfgContainer [2022-04-15 11:34:39,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:34:39,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:34:39,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:34:39,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:34:39,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:34:35" (1/3) ... [2022-04-15 11:34:39,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7300c9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:34:39, skipping insertion in model container [2022-04-15 11:34:39,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:36" (2/3) ... [2022-04-15 11:34:39,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7300c9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:34:39, skipping insertion in model container [2022-04-15 11:34:39,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:34:39" (3/3) ... [2022-04-15 11:34:39,124 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2022-04-15 11:34:39,129 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:34:39,129 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:34:39,166 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:34:39,172 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:34:39,172 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:34:39,192 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:34:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:34:39,200 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:39,200 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:34:39,201 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-15 11:34:39,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:39,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [898070954] [2022-04-15 11:34:39,219 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:34:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-15 11:34:39,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:39,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48279841] [2022-04-15 11:34:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:39,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:39,795 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:34:39,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:34:39,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:34:39,798 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:34:39,798 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:34:39,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:34:39,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:34:39,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-15 11:34:39,800 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:34:39,800 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:34:39,803 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:34:39,804 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:34:39,805 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:34:39,806 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:34:39,806 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:34:39,807 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:34:39,807 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:34:39,808 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:34:39,808 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:34:39,808 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:34:39,808 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:34:39,809 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:34:39,809 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:34:39,809 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:34:39,809 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:34:39,810 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:34:39,810 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:34:39,810 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:34:39,810 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:34:39,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-15 11:34:39,811 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:34:39,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 4 == ~blastFlag~0; {142#false} is VALID [2022-04-15 11:34:39,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-15 11:34:39,812 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:34:39,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:39,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48279841] [2022-04-15 11:34:39,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48279841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:39,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:39,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:39,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:39,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [898070954] [2022-04-15 11:34:39,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [898070954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:39,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:39,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:39,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395308361] [2022-04-15 11:34:39,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:39,823 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:34:39,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:39,828 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:34:39,869 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:34:39,869 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:39,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:39,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:39,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:39,892 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:34:41,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:43,312 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-15 11:34:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:43,313 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:34:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:43,314 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:34:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:34:43,326 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:34:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:34:43,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 11:34:43,735 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:34:43,745 INFO L225 Difference]: With dead ends: 267 [2022-04-15 11:34:43,745 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 11:34:43,748 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:34:43,750 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:43,751 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.5s Time] [2022-04-15 11:34:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 11:34:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 11:34:43,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:43,786 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:34:43,787 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:34:43,788 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:34:43,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:43,794 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:34:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:34:43,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:43,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:43,796 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:34:43,796 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:34:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:43,802 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:34:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:34:43,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:43,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:43,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:43,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:43,804 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:34:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-15 11:34:43,810 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-15 11:34:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:43,810 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-15 11:34:43,810 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:34:43,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-15 11:34:43,966 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:34:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-15 11:34:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 11:34:43,977 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:43,977 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:34:43,977 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:34:43,978 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:43,979 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-15 11:34:43,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:43,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [230091165] [2022-04-15 11:34:43,981 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-15 11:34:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:43,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834367118] [2022-04-15 11:34:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:44,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:44,286 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:34:44,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:34:44,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:34:44,289 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:34:44,290 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:34:44,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:34:44,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:34:44,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-15 11:34:44,290 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:34:44,291 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:34:44,291 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:34:44,293 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:34:44,293 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:34:44,293 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:34:44,294 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:34:44,294 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:34:44,297 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:34:44,298 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:34:44,299 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:34:44,299 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:34:44,300 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:34:44,300 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:34:44,302 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:34:44,303 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:34:44,304 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:34:44,305 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:34:44,305 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:34:44,306 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:34:44,306 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:34:44,307 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:34:44,307 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:34:44,307 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:34:44,308 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:34:44,309 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:34:44,309 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:34:44,309 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:34:44,310 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:34:44,310 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:34:44,311 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:34:44,316 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:34:44,316 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:34:44,319 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:34:44,319 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:34:44,320 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:34:44,320 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:34:44,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {1174#false} is VALID [2022-04-15 11:34:44,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-15 11:34:44,321 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:34:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:44,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834367118] [2022-04-15 11:34:44,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834367118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:44,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:44,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:44,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:44,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [230091165] [2022-04-15 11:34:44,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [230091165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:44,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:44,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:44,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032767186] [2022-04-15 11:34:44,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:44,324 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:34:44,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:44,325 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:34:44,362 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:34:44,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:44,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:44,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:44,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:44,363 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:34:46,385 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:34:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:47,140 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-15 11:34:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:47,141 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:34:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:47,141 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:34:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:34:47,147 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:34:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:34:47,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 11:34:47,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:47,547 INFO L225 Difference]: With dead ends: 327 [2022-04-15 11:34:47,547 INFO L226 Difference]: Without dead ends: 222 [2022-04-15 11:34:47,548 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:34:47,549 INFO L913 BasicCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:47,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:34:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-15 11:34:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-15 11:34:47,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:47,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:47,567 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:47,568 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:47,577 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 11:34:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:34:47,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:47,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:47,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 11:34:47,579 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 11:34:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:47,589 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 11:34:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:34:47,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:47,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:47,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:47,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-15 11:34:47,600 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-15 11:34:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:47,600 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-15 11:34:47,601 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:34:47,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-15 11:34:47,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:34:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 11:34:47,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:47,845 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:34:47,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:34:47,845 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:47,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:47,846 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-15 11:34:47,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:47,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [879266263] [2022-04-15 11:34:47,847 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-15 11:34:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:47,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500646817] [2022-04-15 11:34:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:48,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:48,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {2724#true} is VALID [2022-04-15 11:34:48,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 11:34:48,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 11:34:48,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:34:48,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {2724#true} is VALID [2022-04-15 11:34:48,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 11:34:48,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 11:34:48,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-15 11:34:48,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#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; {2724#true} is VALID [2022-04-15 11:34:48,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {2724#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2724#true} is VALID [2022-04-15 11:34:48,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -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); {2724#true} is VALID [2022-04-15 11:34:48,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {2724#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; {2724#true} is VALID [2022-04-15 11:34:48,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {2724#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; {2724#true} is VALID [2022-04-15 11:34:48,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {2724#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2724#true} is VALID [2022-04-15 11:34:48,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 11:34:48,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {2724#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); {2724#true} is VALID [2022-04-15 11:34:48,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-15 11:34:48,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {2724#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; {2724#true} is VALID [2022-04-15 11:34:48,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:34:48,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {2724#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2724#true} is VALID [2022-04-15 11:34:48,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:34:48,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {2724#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:34:48,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {2724#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {2724#true} is VALID [2022-04-15 11:34:48,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-15 11:34:48,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {2724#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); {2724#true} is VALID [2022-04-15 11:34:48,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {2724#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); {2724#true} is VALID [2022-04-15 11:34:48,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {2724#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2724#true} is VALID [2022-04-15 11:34:48,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-15 11:34:48,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 11:34:48,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {2724#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); {2724#true} is VALID [2022-04-15 11:34:48,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {2724#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:34:48,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {2724#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:34:48,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {2724#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:34:48,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {2724#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:34:48,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {2724#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:34:48,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-15 11:34:48,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {2724#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; {2724#true} is VALID [2022-04-15 11:34:48,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-15 11:34:48,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {2724#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); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {2729#(= 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; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {2729#(= 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); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {2729#(= 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; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {2729#(= 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); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {2729#(= 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); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {2729#(= 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); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {2729#(= 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); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {2729#(= 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); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,130 INFO L290 TraceCheckUtils]: 46: Hoare triple {2729#(= 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); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {2729#(= 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); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:48,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {2729#(= 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); {2730#(= |ssl3_connect_#t~mem56| 4384)} is VALID [2022-04-15 11:34:48,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {2730#(= |ssl3_connect_#t~mem56| 4384)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:34:48,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {2725#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:34:48,131 INFO L290 TraceCheckUtils]: 51: Hoare triple {2725#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:34:48,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {2725#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:34:48,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {2725#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:34:48,132 INFO L290 TraceCheckUtils]: 54: Hoare triple {2725#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:34:48,132 INFO L290 TraceCheckUtils]: 55: Hoare triple {2725#false} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-15 11:34:48,132 INFO L290 TraceCheckUtils]: 56: Hoare triple {2725#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {2725#false} is VALID [2022-04-15 11:34:48,132 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 4 == ~blastFlag~0; {2725#false} is VALID [2022-04-15 11:34:48,133 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 11:34:48,133 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:34:48,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:48,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500646817] [2022-04-15 11:34:48,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500646817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:48,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:48,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:48,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:48,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [879266263] [2022-04-15 11:34:48,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [879266263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:48,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:48,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:48,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518927339] [2022-04-15 11:34:48,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:48,136 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:34:48,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:48,136 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:34:48,192 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:34:48,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:48,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:48,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:48,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:48,193 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:50,222 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:34:51,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:51,358 INFO L93 Difference]: Finished difference Result 362 states and 537 transitions. [2022-04-15 11:34:51,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:51,359 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:34:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:51,361 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:34:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-15 11:34:51,366 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:34:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-15 11:34:51,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-15 11:34:51,693 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:34:51,699 INFO L225 Difference]: With dead ends: 362 [2022-04-15 11:34:51,699 INFO L226 Difference]: Without dead ends: 257 [2022-04-15 11:34:51,700 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:34:51,701 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 31 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 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:34:51,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 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:34:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-15 11:34:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2022-04-15 11:34:51,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:51,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have 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:34:51,717 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have 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:34:51,718 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have 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:34:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:51,725 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-15 11:34:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-15 11:34:51,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:51,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:51,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 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:34:51,728 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 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:34:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:51,736 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-15 11:34:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-15 11:34:51,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:51,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:51,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:51,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have 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:34:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-15 11:34:51,745 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-15 11:34:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:51,746 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-15 11:34:51,746 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:34:51,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 356 transitions. [2022-04-15 11:34:52,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-15 11:34:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:34:52,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:52,016 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:34:52,016 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:34:52,016 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:52,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:52,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 3 times [2022-04-15 11:34:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:52,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1608725302] [2022-04-15 11:35:01,194 WARN L232 SmtUtils]: Spent 9.17s 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:35:10,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 4 times [2022-04-15 11:35:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:10,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821284064] [2022-04-15 11:35:10,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:10,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {4461#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {4454#true} is VALID [2022-04-15 11:35:10,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-15 11:35:10,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4454#true} {4454#true} #593#return; {4454#true} is VALID [2022-04-15 11:35:10,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {4454#true} call ULTIMATE.init(); {4461#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:35:10,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {4461#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {4454#true} is VALID [2022-04-15 11:35:10,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-15 11:35:10,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#true} {4454#true} #593#return; {4454#true} is VALID [2022-04-15 11:35:10,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {4454#true} call #t~ret158 := main(); {4454#true} is VALID [2022-04-15 11:35:10,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {4454#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; {4454#true} is VALID [2022-04-15 11:35:10,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {4454#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4454#true} is VALID [2022-04-15 11:35:10,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:10,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {4454#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; {4454#true} is VALID [2022-04-15 11:35:10,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {4454#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; {4454#true} is VALID [2022-04-15 11:35:10,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {4454#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4454#true} is VALID [2022-04-15 11:35:10,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {4454#true} assume !false; {4454#true} is VALID [2022-04-15 11:35:10,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:10,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {4454#true} assume 12292 == #t~mem49;havoc #t~mem49; {4454#true} is VALID [2022-04-15 11:35:10,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {4454#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; {4454#true} is VALID [2022-04-15 11:35:10,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {4454#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:10,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {4454#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4454#true} is VALID [2022-04-15 11:35:10,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {4454#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:10,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:10,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {4454#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4454#true} is VALID [2022-04-15 11:35:10,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {4454#true} assume !(0 == ~tmp___4~0); {4454#true} is VALID [2022-04-15 11:35:10,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:10,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:10,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {4454#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4454#true} is VALID [2022-04-15 11:35:10,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {4454#true} ~skip~0 := 0; {4454#true} is VALID [2022-04-15 11:35:10,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {4454#true} assume !false; {4454#true} is VALID [2022-04-15 11:35:10,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:10,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {4454#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:10,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {4454#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:10,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {4454#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:10,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {4454#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:10,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {4454#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:10,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {4454#true} assume 4368 == #t~mem54;havoc #t~mem54; {4454#true} is VALID [2022-04-15 11:35:10,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {4454#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; {4454#true} is VALID [2022-04-15 11:35:10,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {4454#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4454#true} is VALID [2022-04-15 11:35:10,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {4454#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); {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:10,960 INFO L290 TraceCheckUtils]: 36: Hoare triple {4459#(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; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:10,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {4459#(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); {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:10,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {4459#(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; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:10,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:10,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:10,963 INFO L290 TraceCheckUtils]: 41: Hoare triple {4459#(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); {4460#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-15 11:35:10,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {4460#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {4455#false} is VALID [2022-04-15 11:35:10,964 INFO L290 TraceCheckUtils]: 43: Hoare triple {4455#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; {4455#false} is VALID [2022-04-15 11:35:10,964 INFO L290 TraceCheckUtils]: 44: Hoare triple {4455#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,964 INFO L290 TraceCheckUtils]: 45: Hoare triple {4455#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4455#false} is VALID [2022-04-15 11:35:10,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {4455#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,964 INFO L290 TraceCheckUtils]: 47: Hoare triple {4455#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); {4455#false} is VALID [2022-04-15 11:35:10,965 INFO L290 TraceCheckUtils]: 48: Hoare triple {4455#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4455#false} is VALID [2022-04-15 11:35:10,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {4455#false} assume !(0 == ~tmp___4~0); {4455#false} is VALID [2022-04-15 11:35:10,965 INFO L290 TraceCheckUtils]: 50: Hoare triple {4455#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); {4455#false} is VALID [2022-04-15 11:35:10,965 INFO L290 TraceCheckUtils]: 51: Hoare triple {4455#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); {4455#false} is VALID [2022-04-15 11:35:10,965 INFO L290 TraceCheckUtils]: 52: Hoare triple {4455#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4455#false} is VALID [2022-04-15 11:35:10,965 INFO L290 TraceCheckUtils]: 53: Hoare triple {4455#false} ~skip~0 := 0; {4455#false} is VALID [2022-04-15 11:35:10,966 INFO L290 TraceCheckUtils]: 54: Hoare triple {4455#false} assume !false; {4455#false} is VALID [2022-04-15 11:35:10,966 INFO L290 TraceCheckUtils]: 55: Hoare triple {4455#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); {4455#false} is VALID [2022-04-15 11:35:10,969 INFO L290 TraceCheckUtils]: 56: Hoare triple {4455#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,969 INFO L290 TraceCheckUtils]: 57: Hoare triple {4455#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,969 INFO L290 TraceCheckUtils]: 58: Hoare triple {4455#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,969 INFO L290 TraceCheckUtils]: 59: Hoare triple {4455#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,970 INFO L290 TraceCheckUtils]: 60: Hoare triple {4455#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,970 INFO L290 TraceCheckUtils]: 61: Hoare triple {4455#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,970 INFO L290 TraceCheckUtils]: 62: Hoare triple {4455#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,970 INFO L290 TraceCheckUtils]: 63: Hoare triple {4455#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,970 INFO L290 TraceCheckUtils]: 64: Hoare triple {4455#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,970 INFO L290 TraceCheckUtils]: 65: Hoare triple {4455#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,970 INFO L290 TraceCheckUtils]: 66: Hoare triple {4455#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,970 INFO L290 TraceCheckUtils]: 67: Hoare triple {4455#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,970 INFO L290 TraceCheckUtils]: 68: Hoare triple {4455#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:10,971 INFO L290 TraceCheckUtils]: 69: Hoare triple {4455#false} assume 4432 == #t~mem62;havoc #t~mem62; {4455#false} is VALID [2022-04-15 11:35:10,971 INFO L290 TraceCheckUtils]: 70: Hoare triple {4455#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4455#false} is VALID [2022-04-15 11:35:10,971 INFO L290 TraceCheckUtils]: 71: Hoare triple {4455#false} assume 4 == ~blastFlag~0; {4455#false} is VALID [2022-04-15 11:35:10,971 INFO L290 TraceCheckUtils]: 72: Hoare triple {4455#false} assume !false; {4455#false} is VALID [2022-04-15 11:35:10,972 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:35:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:10,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821284064] [2022-04-15 11:35:10,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821284064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:10,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:10,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:10,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:10,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1608725302] [2022-04-15 11:35:10,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1608725302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:10,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:10,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142410761] [2022-04-15 11:35:10,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:10,974 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:35:10,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:10,975 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:35:11,040 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:35:11,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:35:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:11,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:35:11,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:35:11,041 INFO L87 Difference]: Start difference. First operand 240 states and 356 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:35:13,070 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:35:14,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:14,162 INFO L93 Difference]: Finished difference Result 645 states and 966 transitions. [2022-04-15 11:35:14,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:14,163 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:35:14,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:14,163 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:35:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:35:14,169 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:35:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:35:14,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:35:14,514 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:35:14,543 INFO L225 Difference]: With dead ends: 645 [2022-04-15 11:35:14,543 INFO L226 Difference]: Without dead ends: 421 [2022-04-15 11:35:14,544 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:35:14,545 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:35:14,545 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:35:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-15 11:35:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 262. [2022-04-15 11:35:14,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:14,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 421 states. Second operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 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:35:14,568 INFO L74 IsIncluded]: Start isIncluded. First operand 421 states. Second operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 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:35:14,568 INFO L87 Difference]: Start difference. First operand 421 states. Second operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 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:35:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:14,599 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-15 11:35:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-15 11:35:14,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:14,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:14,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 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 421 states. [2022-04-15 11:35:14,602 INFO L87 Difference]: Start difference. First operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 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 421 states. [2022-04-15 11:35:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:14,624 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-15 11:35:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-15 11:35:14,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:14,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:14,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:14,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 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:35:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 387 transitions. [2022-04-15 11:35:14,634 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 387 transitions. Word has length 73 [2022-04-15 11:35:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:14,634 INFO L478 AbstractCegarLoop]: Abstraction has 262 states and 387 transitions. [2022-04-15 11:35:14,635 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:35:14,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 262 states and 387 transitions. [2022-04-15 11:35:14,964 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:35:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 387 transitions. [2022-04-15 11:35:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:35:14,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:14,965 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:35:14,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:35:14,965 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:14,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:14,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-15 11:35:14,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:14,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589220909] [2022-04-15 11:35:31,989 WARN L232 SmtUtils]: Spent 12.46s 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:35:40,083 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 2 times [2022-04-15 11:35:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:40,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909588129] [2022-04-15 11:35:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:40,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:40,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {7129#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {7122#true} is VALID [2022-04-15 11:35:40,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {7122#true} assume true; {7122#true} is VALID [2022-04-15 11:35:40,320 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7122#true} {7122#true} #593#return; {7122#true} is VALID [2022-04-15 11:35:40,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {7122#true} call ULTIMATE.init(); {7129#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:35:40,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {7129#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {7122#true} is VALID [2022-04-15 11:35:40,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {7122#true} assume true; {7122#true} is VALID [2022-04-15 11:35:40,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7122#true} {7122#true} #593#return; {7122#true} is VALID [2022-04-15 11:35:40,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {7122#true} call #t~ret158 := main(); {7122#true} is VALID [2022-04-15 11:35:40,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {7122#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; {7122#true} is VALID [2022-04-15 11:35:40,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {7122#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7122#true} is VALID [2022-04-15 11:35:40,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:40,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {7122#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; {7122#true} is VALID [2022-04-15 11:35:40,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {7122#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; {7122#true} is VALID [2022-04-15 11:35:40,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {7122#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7122#true} is VALID [2022-04-15 11:35:40,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {7122#true} assume !false; {7122#true} is VALID [2022-04-15 11:35:40,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:40,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {7122#true} assume 12292 == #t~mem49;havoc #t~mem49; {7122#true} is VALID [2022-04-15 11:35:40,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {7122#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; {7122#true} is VALID [2022-04-15 11:35:40,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {7122#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:40,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {7122#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7122#true} is VALID [2022-04-15 11:35:40,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {7122#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:40,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:40,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {7122#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7122#true} is VALID [2022-04-15 11:35:40,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {7122#true} assume !(0 == ~tmp___4~0); {7122#true} is VALID [2022-04-15 11:35:40,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:40,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:40,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {7122#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7122#true} is VALID [2022-04-15 11:35:40,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {7122#true} ~skip~0 := 0; {7122#true} is VALID [2022-04-15 11:35:40,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {7122#true} assume !false; {7122#true} is VALID [2022-04-15 11:35:40,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:40,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {7122#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:40,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {7122#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:40,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {7122#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:40,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {7122#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:40,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {7122#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:40,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {7122#true} assume 4368 == #t~mem54;havoc #t~mem54; {7122#true} is VALID [2022-04-15 11:35:40,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {7122#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; {7122#true} is VALID [2022-04-15 11:35:40,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {7122#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7122#true} is VALID [2022-04-15 11:35:40,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {7122#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); {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:40,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {7127#(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; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:40,340 INFO L290 TraceCheckUtils]: 37: Hoare triple {7127#(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); {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:40,340 INFO L290 TraceCheckUtils]: 38: Hoare triple {7127#(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; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:40,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:40,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:40,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {7127#(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); {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:40,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {7127#(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); {7128#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-15 11:35:40,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {7128#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {7123#false} is VALID [2022-04-15 11:35:40,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {7123#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,344 INFO L290 TraceCheckUtils]: 45: Hoare triple {7123#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7123#false} is VALID [2022-04-15 11:35:40,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {7123#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,344 INFO L290 TraceCheckUtils]: 47: Hoare triple {7123#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); {7123#false} is VALID [2022-04-15 11:35:40,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {7123#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7123#false} is VALID [2022-04-15 11:35:40,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {7123#false} assume !(0 == ~tmp___4~0); {7123#false} is VALID [2022-04-15 11:35:40,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {7123#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); {7123#false} is VALID [2022-04-15 11:35:40,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {7123#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); {7123#false} is VALID [2022-04-15 11:35:40,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {7123#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7123#false} is VALID [2022-04-15 11:35:40,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {7123#false} ~skip~0 := 0; {7123#false} is VALID [2022-04-15 11:35:40,346 INFO L290 TraceCheckUtils]: 54: Hoare triple {7123#false} assume !false; {7123#false} is VALID [2022-04-15 11:35:40,346 INFO L290 TraceCheckUtils]: 55: Hoare triple {7123#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); {7123#false} is VALID [2022-04-15 11:35:40,346 INFO L290 TraceCheckUtils]: 56: Hoare triple {7123#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,346 INFO L290 TraceCheckUtils]: 57: Hoare triple {7123#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,346 INFO L290 TraceCheckUtils]: 58: Hoare triple {7123#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,346 INFO L290 TraceCheckUtils]: 59: Hoare triple {7123#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,346 INFO L290 TraceCheckUtils]: 60: Hoare triple {7123#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,347 INFO L290 TraceCheckUtils]: 61: Hoare triple {7123#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,347 INFO L290 TraceCheckUtils]: 62: Hoare triple {7123#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,347 INFO L290 TraceCheckUtils]: 63: Hoare triple {7123#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,347 INFO L290 TraceCheckUtils]: 64: Hoare triple {7123#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,347 INFO L290 TraceCheckUtils]: 65: Hoare triple {7123#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {7123#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,347 INFO L290 TraceCheckUtils]: 67: Hoare triple {7123#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,347 INFO L290 TraceCheckUtils]: 68: Hoare triple {7123#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:40,347 INFO L290 TraceCheckUtils]: 69: Hoare triple {7123#false} assume 4432 == #t~mem62;havoc #t~mem62; {7123#false} is VALID [2022-04-15 11:35:40,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {7123#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7123#false} is VALID [2022-04-15 11:35:40,347 INFO L290 TraceCheckUtils]: 71: Hoare triple {7123#false} assume 4 == ~blastFlag~0; {7123#false} is VALID [2022-04-15 11:35:40,348 INFO L290 TraceCheckUtils]: 72: Hoare triple {7123#false} assume !false; {7123#false} is VALID [2022-04-15 11:35:40,350 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:35:40,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:40,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909588129] [2022-04-15 11:35:40,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909588129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:40,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:40,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:40,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:40,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589220909] [2022-04-15 11:35:40,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589220909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:40,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:40,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243010833] [2022-04-15 11:35:40,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:40,353 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:35:40,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:40,353 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:35:40,417 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:35:40,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:35:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:35:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:35:40,418 INFO L87 Difference]: Start difference. First operand 262 states and 387 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:35:42,445 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:35:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:43,634 INFO L93 Difference]: Finished difference Result 668 states and 995 transitions. [2022-04-15 11:35:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:43,634 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:35:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:43,635 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:35:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:35:43,638 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:35:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:35:43,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 11:35:44,010 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:35:44,023 INFO L225 Difference]: With dead ends: 668 [2022-04-15 11:35:44,024 INFO L226 Difference]: Without dead ends: 422 [2022-04-15 11:35:44,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:35:44,025 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:44,025 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.5s Time] [2022-04-15 11:35:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-15 11:35:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 264. [2022-04-15 11:35:44,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:44,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have 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:35:44,042 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have 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:35:44,043 INFO L87 Difference]: Start difference. First operand 422 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have 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:35:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:44,055 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-15 11:35:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-15 11:35:44,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:44,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:44,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 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 422 states. [2022-04-15 11:35:44,058 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 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 422 states. [2022-04-15 11:35:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:44,070 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-15 11:35:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-15 11:35:44,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:44,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:44,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:44,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have 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:35:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-15 11:35:44,078 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 73 [2022-04-15 11:35:44,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:44,078 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-15 11:35:44,079 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:35:44,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 388 transitions. [2022-04-15 11:35:44,410 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:35:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-15 11:35:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 11:35:44,412 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:44,412 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:35:44,412 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:35:44,412 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:44,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-15 11:35:44,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:44,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [51057164] [2022-04-15 11:35:55,740 WARN L232 SmtUtils]: Spent 11.33s 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:36:08,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:08,519 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 2 times [2022-04-15 11:36:08,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:08,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273250827] [2022-04-15 11:36:08,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:08,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:08,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {9849#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {9842#true} is VALID [2022-04-15 11:36:08,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {9842#true} assume true; {9842#true} is VALID [2022-04-15 11:36:08,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9842#true} {9842#true} #593#return; {9842#true} is VALID [2022-04-15 11:36:08,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {9842#true} call ULTIMATE.init(); {9849#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:36:08,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {9849#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {9842#true} is VALID [2022-04-15 11:36:08,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {9842#true} assume true; {9842#true} is VALID [2022-04-15 11:36:08,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9842#true} {9842#true} #593#return; {9842#true} is VALID [2022-04-15 11:36:08,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {9842#true} call #t~ret158 := main(); {9842#true} is VALID [2022-04-15 11:36:08,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {9842#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; {9842#true} is VALID [2022-04-15 11:36:08,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {9842#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9842#true} is VALID [2022-04-15 11:36:08,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:08,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {9842#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; {9842#true} is VALID [2022-04-15 11:36:08,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {9842#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; {9842#true} is VALID [2022-04-15 11:36:08,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {9842#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9842#true} is VALID [2022-04-15 11:36:08,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {9842#true} assume !false; {9842#true} is VALID [2022-04-15 11:36:08,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:08,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {9842#true} assume 12292 == #t~mem49;havoc #t~mem49; {9842#true} is VALID [2022-04-15 11:36:08,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {9842#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; {9842#true} is VALID [2022-04-15 11:36:08,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {9842#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {9842#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {9842#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {9842#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {9842#true} assume !(0 == ~tmp___4~0); {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {9842#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {9842#true} ~skip~0 := 0; {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {9842#true} assume !false; {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:08,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {9842#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:08,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {9842#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:08,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {9842#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:08,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {9842#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:08,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {9842#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:08,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {9842#true} assume 4368 == #t~mem54;havoc #t~mem54; {9842#true} is VALID [2022-04-15 11:36:08,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {9842#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; {9842#true} is VALID [2022-04-15 11:36:08,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {9842#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9842#true} is VALID [2022-04-15 11:36:08,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {9842#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); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:08,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {9847#(= 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; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:08,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {9847#(= 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); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:08,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {9847#(= 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; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:08,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:08,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:08,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {9847#(= 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); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:08,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {9847#(= 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); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:08,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {9847#(= 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); {9848#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-15 11:36:08,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {9848#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {9843#false} is VALID [2022-04-15 11:36:08,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {9843#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {9843#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9843#false} is VALID [2022-04-15 11:36:08,798 INFO L290 TraceCheckUtils]: 47: Hoare triple {9843#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,798 INFO L290 TraceCheckUtils]: 48: Hoare triple {9843#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); {9843#false} is VALID [2022-04-15 11:36:08,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {9843#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9843#false} is VALID [2022-04-15 11:36:08,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {9843#false} assume !(0 == ~tmp___4~0); {9843#false} is VALID [2022-04-15 11:36:08,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {9843#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); {9843#false} is VALID [2022-04-15 11:36:08,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {9843#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); {9843#false} is VALID [2022-04-15 11:36:08,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {9843#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9843#false} is VALID [2022-04-15 11:36:08,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {9843#false} ~skip~0 := 0; {9843#false} is VALID [2022-04-15 11:36:08,805 INFO L290 TraceCheckUtils]: 55: Hoare triple {9843#false} assume !false; {9843#false} is VALID [2022-04-15 11:36:08,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {9843#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); {9843#false} is VALID [2022-04-15 11:36:08,805 INFO L290 TraceCheckUtils]: 57: Hoare triple {9843#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,805 INFO L290 TraceCheckUtils]: 58: Hoare triple {9843#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,805 INFO L290 TraceCheckUtils]: 59: Hoare triple {9843#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {9843#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {9843#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {9843#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {9843#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {9843#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {9843#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,806 INFO L290 TraceCheckUtils]: 66: Hoare triple {9843#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,806 INFO L290 TraceCheckUtils]: 67: Hoare triple {9843#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,806 INFO L290 TraceCheckUtils]: 68: Hoare triple {9843#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,806 INFO L290 TraceCheckUtils]: 69: Hoare triple {9843#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:08,806 INFO L290 TraceCheckUtils]: 70: Hoare triple {9843#false} assume 4432 == #t~mem62;havoc #t~mem62; {9843#false} is VALID [2022-04-15 11:36:08,806 INFO L290 TraceCheckUtils]: 71: Hoare triple {9843#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9843#false} is VALID [2022-04-15 11:36:08,806 INFO L290 TraceCheckUtils]: 72: Hoare triple {9843#false} assume 4 == ~blastFlag~0; {9843#false} is VALID [2022-04-15 11:36:08,806 INFO L290 TraceCheckUtils]: 73: Hoare triple {9843#false} assume !false; {9843#false} is VALID [2022-04-15 11:36:08,806 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:36:08,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:08,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273250827] [2022-04-15 11:36:08,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273250827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:08,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:08,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:08,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:08,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [51057164] [2022-04-15 11:36:08,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [51057164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:08,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:08,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:08,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87181590] [2022-04-15 11:36:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:08,808 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:36:08,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:08,808 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:36:08,872 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:36:08,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:36:08,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:08,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:36:08,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:36:08,874 INFO L87 Difference]: Start difference. First operand 264 states and 388 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:36:10,900 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:36:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:12,002 INFO L93 Difference]: Finished difference Result 415 states and 612 transitions. [2022-04-15 11:36:12,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:36:12,007 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:36:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:12,007 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:36:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-15 11:36:12,011 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:36:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-15 11:36:12,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 382 transitions. [2022-04-15 11:36:12,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:12,292 INFO L225 Difference]: With dead ends: 415 [2022-04-15 11:36:12,292 INFO L226 Difference]: Without dead ends: 280 [2022-04-15 11:36:12,292 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:36:12,293 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 33 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:12,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:36:12,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-15 11:36:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-15 11:36:12,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:12,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 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:36:12,326 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 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:36:12,327 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 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:36:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:12,333 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-15 11:36:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-15 11:36:12,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:12,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:12,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 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 280 states. [2022-04-15 11:36:12,335 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 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 280 states. [2022-04-15 11:36:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:12,341 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-15 11:36:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-15 11:36:12,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:12,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:12,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:12,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 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:36:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 387 transitions. [2022-04-15 11:36:12,349 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 387 transitions. Word has length 74 [2022-04-15 11:36:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:12,349 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 387 transitions. [2022-04-15 11:36:12,349 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:36:12,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 387 transitions. [2022-04-15 11:36:12,647 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:36:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 387 transitions. [2022-04-15 11:36:12,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 11:36:12,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:12,648 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:36:12,648 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:36:12,649 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-15 11:36:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:12,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [684919140] [2022-04-15 11:36:27,381 WARN L232 SmtUtils]: Spent 10.72s 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:36:36,272 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 2 times [2022-04-15 11:36:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:36,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158058312] [2022-04-15 11:36:36,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:36,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:36,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {11779#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {11772#true} is VALID [2022-04-15 11:36:36,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {11772#true} assume true; {11772#true} is VALID [2022-04-15 11:36:36,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11772#true} {11772#true} #593#return; {11772#true} is VALID [2022-04-15 11:36:36,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {11772#true} call ULTIMATE.init(); {11779#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:36:36,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {11779#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {11772#true} is VALID [2022-04-15 11:36:36,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {11772#true} assume true; {11772#true} is VALID [2022-04-15 11:36:36,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11772#true} {11772#true} #593#return; {11772#true} is VALID [2022-04-15 11:36:36,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {11772#true} call #t~ret158 := main(); {11772#true} is VALID [2022-04-15 11:36:36,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {11772#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; {11772#true} is VALID [2022-04-15 11:36:36,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {11772#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11772#true} is VALID [2022-04-15 11:36:36,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:36,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {11772#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; {11772#true} is VALID [2022-04-15 11:36:36,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {11772#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; {11772#true} is VALID [2022-04-15 11:36:36,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {11772#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11772#true} is VALID [2022-04-15 11:36:36,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {11772#true} assume !false; {11772#true} is VALID [2022-04-15 11:36:36,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:36,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {11772#true} assume 12292 == #t~mem49;havoc #t~mem49; {11772#true} is VALID [2022-04-15 11:36:36,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {11772#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; {11772#true} is VALID [2022-04-15 11:36:36,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {11772#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:36,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {11772#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11772#true} is VALID [2022-04-15 11:36:36,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {11772#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:36,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:36,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {11772#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11772#true} is VALID [2022-04-15 11:36:36,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {11772#true} assume !(0 == ~tmp___4~0); {11772#true} is VALID [2022-04-15 11:36:36,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:36,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:36,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {11772#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11772#true} is VALID [2022-04-15 11:36:36,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {11772#true} ~skip~0 := 0; {11772#true} is VALID [2022-04-15 11:36:36,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {11772#true} assume !false; {11772#true} is VALID [2022-04-15 11:36:36,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:36,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {11772#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:36,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {11772#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:36,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {11772#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:36,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {11772#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:36,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {11772#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:36,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {11772#true} assume 4368 == #t~mem54;havoc #t~mem54; {11772#true} is VALID [2022-04-15 11:36:36,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {11772#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; {11772#true} is VALID [2022-04-15 11:36:36,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {11772#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11772#true} is VALID [2022-04-15 11:36:36,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {11772#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); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:36,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {11777#(= 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; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:36,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {11777#(= 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); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:36,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {11777#(= 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; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:36,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:36,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:36,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {11777#(= 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); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:36,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {11777#(= 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); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:36,532 INFO L290 TraceCheckUtils]: 43: Hoare triple {11777#(= 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); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:36,532 INFO L290 TraceCheckUtils]: 44: Hoare triple {11777#(= 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); {11778#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-15 11:36:36,532 INFO L290 TraceCheckUtils]: 45: Hoare triple {11778#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {11773#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {11773#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {11773#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {11773#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); {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {11773#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 51: Hoare triple {11773#false} assume !(0 == ~tmp___4~0); {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 52: Hoare triple {11773#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); {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {11773#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); {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {11773#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 55: Hoare triple {11773#false} ~skip~0 := 0; {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 56: Hoare triple {11773#false} assume !false; {11773#false} is VALID [2022-04-15 11:36:36,533 INFO L290 TraceCheckUtils]: 57: Hoare triple {11773#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); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 58: Hoare triple {11773#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 59: Hoare triple {11773#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 60: Hoare triple {11773#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 61: Hoare triple {11773#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 62: Hoare triple {11773#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 63: Hoare triple {11773#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {11773#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {11773#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {11773#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 67: Hoare triple {11773#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {11773#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {11773#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {11773#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:36,535 INFO L290 TraceCheckUtils]: 71: Hoare triple {11773#false} assume 4432 == #t~mem62;havoc #t~mem62; {11773#false} is VALID [2022-04-15 11:36:36,535 INFO L290 TraceCheckUtils]: 72: Hoare triple {11773#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11773#false} is VALID [2022-04-15 11:36:36,535 INFO L290 TraceCheckUtils]: 73: Hoare triple {11773#false} assume 4 == ~blastFlag~0; {11773#false} is VALID [2022-04-15 11:36:36,535 INFO L290 TraceCheckUtils]: 74: Hoare triple {11773#false} assume !false; {11773#false} is VALID [2022-04-15 11:36:36,536 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:36:36,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:36,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158058312] [2022-04-15 11:36:36,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158058312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:36,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:36,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:36,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:36,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [684919140] [2022-04-15 11:36:36,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [684919140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:36,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:36,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:36,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960072539] [2022-04-15 11:36:36,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:36,538 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:36:36,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:36,539 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:36:36,609 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:36:36,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:36:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:36:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:36:36,610 INFO L87 Difference]: Start difference. First operand 264 states and 387 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:36:38,637 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:36:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:39,678 INFO L93 Difference]: Finished difference Result 415 states and 610 transitions. [2022-04-15 11:36:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:36:39,678 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:36:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:39,679 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:36:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-15 11:36:39,684 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:36:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-15 11:36:39,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 381 transitions. [2022-04-15 11:36:40,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:40,023 INFO L225 Difference]: With dead ends: 415 [2022-04-15 11:36:40,023 INFO L226 Difference]: Without dead ends: 280 [2022-04-15 11:36:40,023 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:36:40,024 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 31 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:40,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 478 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:36:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-15 11:36:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-15 11:36:40,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:40,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 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:36:40,039 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 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:36:40,041 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 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:36:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:40,049 INFO L93 Difference]: Finished difference Result 280 states and 407 transitions. [2022-04-15 11:36:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2022-04-15 11:36:40,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:40,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:40,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 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:36:40,051 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 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:36:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:40,057 INFO L93 Difference]: Finished difference Result 280 states and 407 transitions. [2022-04-15 11:36:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2022-04-15 11:36:40,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:40,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:40,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:40,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 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:36:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 386 transitions. [2022-04-15 11:36:40,065 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 386 transitions. Word has length 75 [2022-04-15 11:36:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:40,065 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 386 transitions. [2022-04-15 11:36:40,065 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:36:40,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 386 transitions. [2022-04-15 11:36:40,438 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:36:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 386 transitions. [2022-04-15 11:36:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 11:36:40,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:40,439 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:36:40,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:36:40,439 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:40,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:40,440 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-15 11:36:40,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:40,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986319888] [2022-04-15 11:36:52,838 WARN L232 SmtUtils]: Spent 7.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:37:00,543 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 2 times [2022-04-15 11:37:00,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:00,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992341347] [2022-04-15 11:37:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:00,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:00,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {13709#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {13702#true} is VALID [2022-04-15 11:37:00,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-15 11:37:00,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13702#true} {13702#true} #593#return; {13702#true} is VALID [2022-04-15 11:37:00,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {13702#true} call ULTIMATE.init(); {13709#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:37:00,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {13709#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {13702#true} is VALID [2022-04-15 11:37:00,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-15 11:37:00,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13702#true} {13702#true} #593#return; {13702#true} is VALID [2022-04-15 11:37:00,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {13702#true} call #t~ret158 := main(); {13702#true} is VALID [2022-04-15 11:37:00,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {13702#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; {13702#true} is VALID [2022-04-15 11:37:00,749 INFO L272 TraceCheckUtils]: 6: Hoare triple {13702#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13702#true} is VALID [2022-04-15 11:37:00,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:37:00,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {13702#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; {13702#true} is VALID [2022-04-15 11:37:00,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {13702#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; {13702#true} is VALID [2022-04-15 11:37:00,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {13702#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13702#true} is VALID [2022-04-15 11:37:00,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {13702#true} assume !false; {13702#true} is VALID [2022-04-15 11:37:00,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:37:00,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {13702#true} assume 12292 == #t~mem49;havoc #t~mem49; {13702#true} is VALID [2022-04-15 11:37:00,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {13702#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; {13702#true} is VALID [2022-04-15 11:37:00,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {13702#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:37:00,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {13702#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13702#true} is VALID [2022-04-15 11:37:00,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {13702#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:37:00,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:37:00,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {13702#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {13702#true} assume !(0 == ~tmp___4~0); {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {13702#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {13702#true} ~skip~0 := 0; {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {13702#true} assume !false; {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {13702#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {13702#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {13702#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {13702#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:37:00,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {13702#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:37:00,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {13702#true} assume 4368 == #t~mem54;havoc #t~mem54; {13702#true} is VALID [2022-04-15 11:37:00,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {13702#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; {13702#true} is VALID [2022-04-15 11:37:00,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {13702#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13702#true} is VALID [2022-04-15 11:37:00,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {13702#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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:00,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {13707#(= 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; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:00,754 INFO L290 TraceCheckUtils]: 37: Hoare triple {13707#(= 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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:00,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {13707#(= 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; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:00,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:00,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:00,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {13707#(= 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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:00,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {13707#(= 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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:00,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {13707#(= 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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:00,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {13707#(= 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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:00,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {13707#(= 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); {13708#(= |ssl3_connect_#t~mem53| 4384)} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#(= |ssl3_connect_#t~mem53| 4384)} assume 4099 == #t~mem53;havoc #t~mem53; {13703#false} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {13703#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {13703#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13703#false} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {13703#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 50: Hoare triple {13703#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); {13703#false} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 51: Hoare triple {13703#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13703#false} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 52: Hoare triple {13703#false} assume !(0 == ~tmp___4~0); {13703#false} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 53: Hoare triple {13703#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); {13703#false} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 54: Hoare triple {13703#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); {13703#false} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 55: Hoare triple {13703#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13703#false} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 56: Hoare triple {13703#false} ~skip~0 := 0; {13703#false} is VALID [2022-04-15 11:37:00,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {13703#false} assume !false; {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 58: Hoare triple {13703#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); {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 59: Hoare triple {13703#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 60: Hoare triple {13703#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {13703#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 62: Hoare triple {13703#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 63: Hoare triple {13703#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 64: Hoare triple {13703#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 65: Hoare triple {13703#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 66: Hoare triple {13703#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 67: Hoare triple {13703#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 68: Hoare triple {13703#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,759 INFO L290 TraceCheckUtils]: 69: Hoare triple {13703#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,760 INFO L290 TraceCheckUtils]: 70: Hoare triple {13703#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {13703#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:37:00,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {13703#false} assume 4432 == #t~mem62;havoc #t~mem62; {13703#false} is VALID [2022-04-15 11:37:00,760 INFO L290 TraceCheckUtils]: 73: Hoare triple {13703#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {13703#false} is VALID [2022-04-15 11:37:00,760 INFO L290 TraceCheckUtils]: 74: Hoare triple {13703#false} assume 4 == ~blastFlag~0; {13703#false} is VALID [2022-04-15 11:37:00,760 INFO L290 TraceCheckUtils]: 75: Hoare triple {13703#false} assume !false; {13703#false} is VALID [2022-04-15 11:37:00,760 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:37:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:00,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992341347] [2022-04-15 11:37:00,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992341347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:00,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:00,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:00,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:00,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986319888] [2022-04-15 11:37:00,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986319888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:00,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:00,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378041309] [2022-04-15 11:37:00,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:00,762 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:37:00,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:00,762 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:37:00,830 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:37:00,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:00,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:00,831 INFO L87 Difference]: Start difference. First operand 264 states and 386 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:37:02,858 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:37:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:03,698 INFO L93 Difference]: Finished difference Result 406 states and 597 transitions. [2022-04-15 11:37:03,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:03,698 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:37:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:03,698 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:37:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2022-04-15 11:37:03,701 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:37:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2022-04-15 11:37:03,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 369 transitions. [2022-04-15 11:37:04,002 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:37:04,007 INFO L225 Difference]: With dead ends: 406 [2022-04-15 11:37:04,008 INFO L226 Difference]: Without dead ends: 271 [2022-04-15 11:37:04,008 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:37:04,008 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 22 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 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:37:04,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 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:37:04,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-15 11:37:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 264. [2022-04-15 11:37:04,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:04,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 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:37:04,020 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 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:37:04,021 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 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:37:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:04,027 INFO L93 Difference]: Finished difference Result 271 states and 395 transitions. [2022-04-15 11:37:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 395 transitions. [2022-04-15 11:37:04,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:04,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:04,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 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 271 states. [2022-04-15 11:37:04,030 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 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 271 states. [2022-04-15 11:37:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:04,035 INFO L93 Difference]: Finished difference Result 271 states and 395 transitions. [2022-04-15 11:37:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 395 transitions. [2022-04-15 11:37:04,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:04,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:04,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:04,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 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:37:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 385 transitions. [2022-04-15 11:37:04,043 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 385 transitions. Word has length 76 [2022-04-15 11:37:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:04,043 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 385 transitions. [2022-04-15 11:37:04,043 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:37:04,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 385 transitions. [2022-04-15 11:37:04,368 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:37:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 385 transitions. [2022-04-15 11:37:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:37:04,372 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:04,372 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:37:04,372 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:37:04,372 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash -790014140, now seen corresponding path program 1 times [2022-04-15 11:37:04,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:04,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1145128936] [2022-04-15 11:37:04,375 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash -790014140, now seen corresponding path program 2 times [2022-04-15 11:37:04,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:04,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560349758] [2022-04-15 11:37:04,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:04,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {15602#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {15596#true} is VALID [2022-04-15 11:37:04,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {15596#true} assume true; {15596#true} is VALID [2022-04-15 11:37:04,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15596#true} {15596#true} #593#return; {15596#true} is VALID [2022-04-15 11:37:04,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {15596#true} call ULTIMATE.init(); {15602#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:37:04,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {15602#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {15596#true} is VALID [2022-04-15 11:37:04,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {15596#true} assume true; {15596#true} is VALID [2022-04-15 11:37:04,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15596#true} {15596#true} #593#return; {15596#true} is VALID [2022-04-15 11:37:04,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {15596#true} call #t~ret158 := main(); {15596#true} is VALID [2022-04-15 11:37:04,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {15596#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; {15596#true} is VALID [2022-04-15 11:37:04,564 INFO L272 TraceCheckUtils]: 6: Hoare triple {15596#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15596#true} is VALID [2022-04-15 11:37:04,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:04,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {15596#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; {15596#true} is VALID [2022-04-15 11:37:04,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {15596#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; {15596#true} is VALID [2022-04-15 11:37:04,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {15596#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15596#true} is VALID [2022-04-15 11:37:04,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {15596#true} assume !false; {15596#true} is VALID [2022-04-15 11:37:04,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:04,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {15596#true} assume 12292 == #t~mem49;havoc #t~mem49; {15596#true} is VALID [2022-04-15 11:37:04,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {15596#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; {15596#true} is VALID [2022-04-15 11:37:04,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {15596#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:04,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {15596#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15596#true} is VALID [2022-04-15 11:37:04,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {15596#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {15596#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {15596#true} assume !(0 == ~tmp___4~0); {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {15596#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {15596#true} ~skip~0 := 0; {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {15596#true} assume !false; {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {15596#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {15596#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:04,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {15596#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:04,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {15596#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:04,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {15596#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:04,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {15596#true} assume 4368 == #t~mem54;havoc #t~mem54; {15596#true} is VALID [2022-04-15 11:37:04,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {15596#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; {15596#true} is VALID [2022-04-15 11:37:04,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {15596#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,568 INFO L290 TraceCheckUtils]: 35: Hoare triple {15601#(= 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); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,568 INFO L290 TraceCheckUtils]: 36: Hoare triple {15601#(= 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; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {15601#(= 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); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,569 INFO L290 TraceCheckUtils]: 39: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !false; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,569 INFO L290 TraceCheckUtils]: 41: Hoare triple {15601#(= 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); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,571 INFO L290 TraceCheckUtils]: 46: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:04,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {15597#false} is VALID [2022-04-15 11:37:04,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {15597#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {15597#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {15597#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {15597#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); {15597#false} is VALID [2022-04-15 11:37:04,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {15597#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15597#false} is VALID [2022-04-15 11:37:04,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {15597#false} ~skip~0 := 0; {15597#false} is VALID [2022-04-15 11:37:04,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {15597#false} assume !false; {15597#false} is VALID [2022-04-15 11:37:04,573 INFO L290 TraceCheckUtils]: 59: Hoare triple {15597#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); {15597#false} is VALID [2022-04-15 11:37:04,573 INFO L290 TraceCheckUtils]: 60: Hoare triple {15597#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 61: Hoare triple {15597#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 62: Hoare triple {15597#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 63: Hoare triple {15597#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 64: Hoare triple {15597#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 65: Hoare triple {15597#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 66: Hoare triple {15597#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {15597#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {15597#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {15597#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {15597#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {15597#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {15597#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:04,575 INFO L290 TraceCheckUtils]: 73: Hoare triple {15597#false} assume 4432 == #t~mem62;havoc #t~mem62; {15597#false} is VALID [2022-04-15 11:37:04,575 INFO L290 TraceCheckUtils]: 74: Hoare triple {15597#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15597#false} is VALID [2022-04-15 11:37:04,575 INFO L290 TraceCheckUtils]: 75: Hoare triple {15597#false} assume 4 == ~blastFlag~0; {15597#false} is VALID [2022-04-15 11:37:04,575 INFO L290 TraceCheckUtils]: 76: Hoare triple {15597#false} assume !false; {15597#false} is VALID [2022-04-15 11:37:04,576 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:37:04,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:04,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560349758] [2022-04-15 11:37:04,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560349758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:04,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:04,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:04,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:04,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1145128936] [2022-04-15 11:37:04,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1145128936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:04,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:04,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:04,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328639615] [2022-04-15 11:37:04,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:04,578 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:37:04,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:04,578 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:37:04,647 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:37:04,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:37:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:04,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:37:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:37:04,648 INFO L87 Difference]: Start difference. First operand 264 states and 385 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:37:06,669 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:37:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:07,259 INFO L93 Difference]: Finished difference Result 423 states and 619 transitions. [2022-04-15 11:37:07,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:37:07,260 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:37:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:07,260 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:37:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-15 11:37:07,264 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:37:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-15 11:37:07,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-15 11:37:07,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:07,571 INFO L225 Difference]: With dead ends: 423 [2022-04-15 11:37:07,571 INFO L226 Difference]: Without dead ends: 288 [2022-04-15 11:37:07,572 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:37:07,574 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:07,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 359 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:37:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-15 11:37:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-04-15 11:37:07,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:07,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 288 states. Second operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 3 states have 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:37:07,590 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 3 states have 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:37:07,590 INFO L87 Difference]: Start difference. First operand 288 states. Second operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 3 states have 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:37:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:07,596 INFO L93 Difference]: Finished difference Result 288 states and 417 transitions. [2022-04-15 11:37:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-15 11:37:07,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:07,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:07,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 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 288 states. [2022-04-15 11:37:07,598 INFO L87 Difference]: Start difference. First operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 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 288 states. [2022-04-15 11:37:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:07,604 INFO L93 Difference]: Finished difference Result 288 states and 417 transitions. [2022-04-15 11:37:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-15 11:37:07,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:07,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:07,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:07,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 3 states have call successors, (3), 3 states have 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:37:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 417 transitions. [2022-04-15 11:37:07,612 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 417 transitions. Word has length 77 [2022-04-15 11:37:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:07,613 INFO L478 AbstractCegarLoop]: Abstraction has 288 states and 417 transitions. [2022-04-15 11:37:07,613 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:37:07,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 417 transitions. [2022-04-15 11:37:08,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 417 edges. 417 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:08,008 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-15 11:37:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:37:08,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:08,009 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:37:08,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:37:08,009 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:08,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:08,009 INFO L85 PathProgramCache]: Analyzing trace with hash -852053754, now seen corresponding path program 1 times [2022-04-15 11:37:08,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:08,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1225664414] [2022-04-15 11:37:08,010 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:08,010 INFO L85 PathProgramCache]: Analyzing trace with hash -852053754, now seen corresponding path program 2 times [2022-04-15 11:37:08,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:08,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417299378] [2022-04-15 11:37:08,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:08,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:08,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {17609#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {17603#true} is VALID [2022-04-15 11:37:08,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-15 11:37:08,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17603#true} {17603#true} #593#return; {17603#true} is VALID [2022-04-15 11:37:08,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {17603#true} call ULTIMATE.init(); {17609#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:37:08,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {17609#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {17603#true} is VALID [2022-04-15 11:37:08,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-15 11:37:08,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17603#true} {17603#true} #593#return; {17603#true} is VALID [2022-04-15 11:37:08,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {17603#true} call #t~ret158 := main(); {17603#true} is VALID [2022-04-15 11:37:08,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:08,206 INFO L272 TraceCheckUtils]: 6: Hoare triple {17603#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {17603#true} is VALID [2022-04-15 11:37:08,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:08,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:08,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:08,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {17603#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17603#true} is VALID [2022-04-15 11:37:08,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-15 11:37:08,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:08,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {17603#true} assume 12292 == #t~mem49;havoc #t~mem49; {17603#true} is VALID [2022-04-15 11:37:08,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:08,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {17603#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {17603#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17603#true} is VALID [2022-04-15 11:37:08,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {17603#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:08,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {17603#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {17603#true} is VALID [2022-04-15 11:37:08,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {17603#true} assume !(0 == ~tmp___4~0); {17603#true} is VALID [2022-04-15 11:37:08,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:08,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:08,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {17603#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {17603#true} ~skip~0 := 0; {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {17603#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {17603#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {17603#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {17603#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {17603#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {17603#true} assume 4368 == #t~mem54;havoc #t~mem54; {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {17603#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17603#true} is VALID [2022-04-15 11:37:08,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {17603#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {17603#true} ~skip~0 := 0; {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {17603#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {17603#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {17603#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {17603#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {17603#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {17603#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {17603#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:08,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {17603#true} assume 4384 == #t~mem56;havoc #t~mem56; {17603#true} is VALID [2022-04-15 11:37:08,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {17603#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {17603#true} is VALID [2022-04-15 11:37:08,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {17603#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,211 INFO L290 TraceCheckUtils]: 53: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,211 INFO L290 TraceCheckUtils]: 54: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,211 INFO L290 TraceCheckUtils]: 55: Hoare triple {17608#(= 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); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,211 INFO L290 TraceCheckUtils]: 56: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,212 INFO L290 TraceCheckUtils]: 57: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,212 INFO L290 TraceCheckUtils]: 58: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,212 INFO L290 TraceCheckUtils]: 59: Hoare triple {17608#(= 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); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,213 INFO L290 TraceCheckUtils]: 62: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,213 INFO L290 TraceCheckUtils]: 63: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,214 INFO L290 TraceCheckUtils]: 64: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,214 INFO L290 TraceCheckUtils]: 65: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,214 INFO L290 TraceCheckUtils]: 66: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,215 INFO L290 TraceCheckUtils]: 67: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,215 INFO L290 TraceCheckUtils]: 68: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,215 INFO L290 TraceCheckUtils]: 69: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,215 INFO L290 TraceCheckUtils]: 70: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,216 INFO L290 TraceCheckUtils]: 71: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,216 INFO L290 TraceCheckUtils]: 72: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,216 INFO L290 TraceCheckUtils]: 73: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,217 INFO L290 TraceCheckUtils]: 74: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:08,217 INFO L290 TraceCheckUtils]: 75: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {17604#false} is VALID [2022-04-15 11:37:08,217 INFO L290 TraceCheckUtils]: 76: Hoare triple {17604#false} assume !false; {17604#false} is VALID [2022-04-15 11:37:08,218 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:37:08,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:08,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417299378] [2022-04-15 11:37:08,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417299378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:08,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:08,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:08,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:08,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1225664414] [2022-04-15 11:37:08,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1225664414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:08,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:08,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:08,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138653315] [2022-04-15 11:37:08,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:08,219 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:37:08,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:08,219 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:37:08,274 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:37:08,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:37:08,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:08,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:37:08,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:37:08,275 INFO L87 Difference]: Start difference. First operand 288 states and 417 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:37:10,296 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:37:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:11,225 INFO L93 Difference]: Finished difference Result 578 states and 845 transitions. [2022-04-15 11:37:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:37:11,225 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:37:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:11,225 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:37:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:37:11,229 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:37:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:37:11,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 11:37:11,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:11,604 INFO L225 Difference]: With dead ends: 578 [2022-04-15 11:37:11,605 INFO L226 Difference]: Without dead ends: 419 [2022-04-15 11:37:11,605 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:37:11,605 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 125 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:11,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 477 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:37:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-04-15 11:37:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2022-04-15 11:37:11,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:11,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have 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:37:11,622 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have 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:37:11,623 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have 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:37:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:11,632 INFO L93 Difference]: Finished difference Result 419 states and 608 transitions. [2022-04-15 11:37:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-15 11:37:11,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:11,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:11,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 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:37:11,635 INFO L87 Difference]: Start difference. First operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 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:37:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:11,645 INFO L93 Difference]: Finished difference Result 419 states and 608 transitions. [2022-04-15 11:37:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-15 11:37:11,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:11,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:11,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:11,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have 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:37:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 608 transitions. [2022-04-15 11:37:11,659 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 608 transitions. Word has length 77 [2022-04-15 11:37:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:11,659 INFO L478 AbstractCegarLoop]: Abstraction has 419 states and 608 transitions. [2022-04-15 11:37:11,660 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:37:11,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 419 states and 608 transitions. [2022-04-15 11:37:12,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-15 11:37:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 11:37:12,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:12,168 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:37:12,168 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:37:12,168 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:12,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash 58549480, now seen corresponding path program 1 times [2022-04-15 11:37:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:12,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [72703717] [2022-04-15 11:37:12,170 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash 58549480, now seen corresponding path program 2 times [2022-04-15 11:37:12,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:12,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920728028] [2022-04-15 11:37:12,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:12,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:12,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {20450#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {20444#true} is VALID [2022-04-15 11:37:12,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {20444#true} assume true; {20444#true} is VALID [2022-04-15 11:37:12,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20444#true} {20444#true} #593#return; {20444#true} is VALID [2022-04-15 11:37:12,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {20444#true} call ULTIMATE.init(); {20450#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:37:12,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {20450#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {20444#true} is VALID [2022-04-15 11:37:12,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {20444#true} assume true; {20444#true} is VALID [2022-04-15 11:37:12,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20444#true} {20444#true} #593#return; {20444#true} is VALID [2022-04-15 11:37:12,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {20444#true} call #t~ret158 := main(); {20444#true} is VALID [2022-04-15 11:37:12,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:12,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {20444#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {20444#true} is VALID [2022-04-15 11:37:12,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:12,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:12,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {20444#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20444#true} is VALID [2022-04-15 11:37:12,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-15 11:37:12,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {20444#true} assume 12292 == #t~mem49;havoc #t~mem49; {20444#true} is VALID [2022-04-15 11:37:12,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:12,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {20444#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {20444#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20444#true} is VALID [2022-04-15 11:37:12,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {20444#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {20444#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {20444#true} is VALID [2022-04-15 11:37:12,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {20444#true} assume !(0 == ~tmp___4~0); {20444#true} is VALID [2022-04-15 11:37:12,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {20444#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20444#true} is VALID [2022-04-15 11:37:12,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-15 11:37:12,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-15 11:37:12,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {20444#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {20444#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {20444#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {20444#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {20444#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {20444#true} assume 4368 == #t~mem54;havoc #t~mem54; {20444#true} is VALID [2022-04-15 11:37:12,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:12,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {20444#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20444#true} is VALID [2022-04-15 11:37:12,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:12,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {20444#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20444#true} is VALID [2022-04-15 11:37:12,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-15 11:37:12,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-15 11:37:12,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {20444#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {20444#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {20444#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {20444#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {20444#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {20444#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {20444#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {20444#true} assume 4384 == #t~mem56;havoc #t~mem56; {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {20444#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 51: Hoare triple {20444#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {20444#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {20444#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {20444#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 55: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {20444#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {20444#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {20444#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {20444#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {20444#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {20444#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {20444#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {20444#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,383 INFO L290 TraceCheckUtils]: 67: Hoare triple {20444#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {20444#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:12,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {20444#true} assume 4400 == #t~mem58;havoc #t~mem58; {20444#true} is VALID [2022-04-15 11:37:12,384 INFO L290 TraceCheckUtils]: 70: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:12,384 INFO L290 TraceCheckUtils]: 71: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:12,391 INFO L290 TraceCheckUtils]: 72: Hoare triple {20444#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,391 INFO L290 TraceCheckUtils]: 73: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,392 INFO L290 TraceCheckUtils]: 74: Hoare triple {20449#(= 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); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,392 INFO L290 TraceCheckUtils]: 75: Hoare triple {20449#(= 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); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,392 INFO L290 TraceCheckUtils]: 77: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,393 INFO L290 TraceCheckUtils]: 78: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,393 INFO L290 TraceCheckUtils]: 79: Hoare triple {20449#(= 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); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,393 INFO L290 TraceCheckUtils]: 80: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,394 INFO L290 TraceCheckUtils]: 81: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,394 INFO L290 TraceCheckUtils]: 82: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,394 INFO L290 TraceCheckUtils]: 83: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,394 INFO L290 TraceCheckUtils]: 84: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,395 INFO L290 TraceCheckUtils]: 85: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,395 INFO L290 TraceCheckUtils]: 86: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,395 INFO L290 TraceCheckUtils]: 87: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,396 INFO L290 TraceCheckUtils]: 88: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,396 INFO L290 TraceCheckUtils]: 89: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,396 INFO L290 TraceCheckUtils]: 90: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,396 INFO L290 TraceCheckUtils]: 91: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,397 INFO L290 TraceCheckUtils]: 92: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,397 INFO L290 TraceCheckUtils]: 93: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,397 INFO L290 TraceCheckUtils]: 94: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:12,398 INFO L290 TraceCheckUtils]: 95: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {20445#false} is VALID [2022-04-15 11:37:12,398 INFO L290 TraceCheckUtils]: 96: Hoare triple {20445#false} assume !false; {20445#false} is VALID [2022-04-15 11:37:12,398 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:37:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:12,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920728028] [2022-04-15 11:37:12,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920728028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:12,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:12,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:12,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:12,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [72703717] [2022-04-15 11:37:12,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [72703717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:12,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:12,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872246945] [2022-04-15 11:37:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:12,400 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:37:12,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:12,400 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:37:12,466 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:37:12,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:37:12,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:12,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:37:12,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:37:12,467 INFO L87 Difference]: Start difference. First operand 419 states and 608 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:37:14,488 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:37:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:15,521 INFO L93 Difference]: Finished difference Result 840 states and 1228 transitions. [2022-04-15 11:37:15,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:37:15,521 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:37:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:15,522 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:37:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:37:15,524 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:37:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:37:15,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-15 11:37:15,856 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:37:15,873 INFO L225 Difference]: With dead ends: 840 [2022-04-15 11:37:15,873 INFO L226 Difference]: Without dead ends: 550 [2022-04-15 11:37:15,873 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:37:15,874 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:15,874 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.3s Time] [2022-04-15 11:37:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-04-15 11:37:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2022-04-15 11:37:15,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:15,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 550 states. Second operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 3 states have 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:37:15,899 INFO L74 IsIncluded]: Start isIncluded. First operand 550 states. Second operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 3 states have 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:37:15,900 INFO L87 Difference]: Start difference. First operand 550 states. Second operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 3 states have 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:37:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:15,916 INFO L93 Difference]: Finished difference Result 550 states and 799 transitions. [2022-04-15 11:37:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-15 11:37:15,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:15,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:15,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 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 550 states. [2022-04-15 11:37:15,919 INFO L87 Difference]: Start difference. First operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 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 550 states. [2022-04-15 11:37:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:15,934 INFO L93 Difference]: Finished difference Result 550 states and 799 transitions. [2022-04-15 11:37:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-15 11:37:15,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:15,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:15,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:15,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 3 states have call successors, (3), 3 states have 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:37:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 799 transitions. [2022-04-15 11:37:15,957 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 799 transitions. Word has length 97 [2022-04-15 11:37:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:15,957 INFO L478 AbstractCegarLoop]: Abstraction has 550 states and 799 transitions. [2022-04-15 11:37:15,957 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:37:15,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 550 states and 799 transitions. [2022-04-15 11:37:16,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 799 edges. 799 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-15 11:37:16,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 11:37:16,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:16,554 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:37:16,554 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:37:16,555 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:16,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:16,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 1 times [2022-04-15 11:37:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:16,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370827369] [2022-04-15 11:37:16,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:16,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 2 times [2022-04-15 11:37:16,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:16,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047709289] [2022-04-15 11:37:16,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:16,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {24340#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {24333#true} is VALID [2022-04-15 11:37:16,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {24333#true} assume true; {24333#true} is VALID [2022-04-15 11:37:16,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24333#true} {24333#true} #593#return; {24333#true} is VALID [2022-04-15 11:37:16,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {24333#true} call ULTIMATE.init(); {24340#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:37:16,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {24340#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {24333#true} is VALID [2022-04-15 11:37:16,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {24333#true} assume true; {24333#true} is VALID [2022-04-15 11:37:16,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24333#true} {24333#true} #593#return; {24333#true} is VALID [2022-04-15 11:37:16,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {24333#true} call #t~ret158 := main(); {24333#true} is VALID [2022-04-15 11:37:16,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:16,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {24333#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {24333#true} is VALID [2022-04-15 11:37:16,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:16,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:16,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:16,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {24333#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24333#true} is VALID [2022-04-15 11:37:16,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-15 11:37:16,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:16,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {24333#true} assume 12292 == #t~mem49;havoc #t~mem49; {24333#true} is VALID [2022-04-15 11:37:16,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:16,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {24333#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {24333#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24333#true} is VALID [2022-04-15 11:37:16,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {24333#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:16,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {24333#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {24333#true} is VALID [2022-04-15 11:37:16,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {24333#true} assume !(0 == ~tmp___4~0); {24333#true} is VALID [2022-04-15 11:37:16,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:16,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:16,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {24333#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24333#true} is VALID [2022-04-15 11:37:16,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-15 11:37:16,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-15 11:37:16,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:16,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {24333#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {24333#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {24333#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {24333#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {24333#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {24333#true} assume 4368 == #t~mem54;havoc #t~mem54; {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {24333#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 35: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {24333#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {24333#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {24333#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {24333#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {24333#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {24333#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {24333#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {24333#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {24333#true} assume 4384 == #t~mem56;havoc #t~mem56; {24333#true} is VALID [2022-04-15 11:37:16,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {24333#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {24333#true} is VALID [2022-04-15 11:37:16,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {24333#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {24333#true} is VALID [2022-04-15 11:37:16,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {24333#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:16,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {24333#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {24338#(= 4560 (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); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {24338#(= 4560 (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; {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,789 INFO L290 TraceCheckUtils]: 58: Hoare triple {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {24338#(= 4560 (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); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {24338#(= 4560 (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); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,791 INFO L290 TraceCheckUtils]: 61: Hoare triple {24338#(= 4560 (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); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,791 INFO L290 TraceCheckUtils]: 62: Hoare triple {24338#(= 4560 (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); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,791 INFO L290 TraceCheckUtils]: 63: Hoare triple {24338#(= 4560 (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); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {24338#(= 4560 (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); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,792 INFO L290 TraceCheckUtils]: 65: Hoare triple {24338#(= 4560 (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); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,792 INFO L290 TraceCheckUtils]: 66: Hoare triple {24338#(= 4560 (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); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,793 INFO L290 TraceCheckUtils]: 67: Hoare triple {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:37:16,793 INFO L290 TraceCheckUtils]: 68: Hoare triple {24338#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24339#(= |ssl3_connect_#t~mem58| 4560)} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 69: Hoare triple {24339#(= |ssl3_connect_#t~mem58| 4560)} assume 4400 == #t~mem58;havoc #t~mem58; {24334#false} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 70: Hoare triple {24334#false} 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); {24334#false} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 71: Hoare triple {24334#false} 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; {24334#false} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 72: Hoare triple {24334#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {24334#false} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 73: Hoare triple {24334#false} assume !(~ret~0 <= 0); {24334#false} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 74: Hoare triple {24334#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 75: Hoare triple {24334#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); {24334#false} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 76: Hoare triple {24334#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24334#false} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 77: Hoare triple {24334#false} ~skip~0 := 0; {24334#false} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 78: Hoare triple {24334#false} assume !false; {24334#false} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 79: Hoare triple {24334#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); {24334#false} is VALID [2022-04-15 11:37:16,794 INFO L290 TraceCheckUtils]: 80: Hoare triple {24334#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 81: Hoare triple {24334#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 82: Hoare triple {24334#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 83: Hoare triple {24334#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 84: Hoare triple {24334#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 85: Hoare triple {24334#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 86: Hoare triple {24334#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 87: Hoare triple {24334#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 88: Hoare triple {24334#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 89: Hoare triple {24334#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 90: Hoare triple {24334#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 91: Hoare triple {24334#false} assume 4416 == #t~mem60;havoc #t~mem60; {24334#false} is VALID [2022-04-15 11:37:16,795 INFO L290 TraceCheckUtils]: 92: Hoare triple {24334#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 93: Hoare triple {24334#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 94: Hoare triple {24334#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 95: Hoare triple {24334#false} assume !(0 == ~tmp___6~0); {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 96: Hoare triple {24334#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); {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 97: Hoare triple {24334#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 98: Hoare triple {24334#false} ~skip~0 := 0; {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 99: Hoare triple {24334#false} assume !false; {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 100: Hoare triple {24334#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); {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 101: Hoare triple {24334#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 102: Hoare triple {24334#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 103: Hoare triple {24334#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,796 INFO L290 TraceCheckUtils]: 104: Hoare triple {24334#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 105: Hoare triple {24334#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 106: Hoare triple {24334#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 107: Hoare triple {24334#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 108: Hoare triple {24334#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 109: Hoare triple {24334#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 110: Hoare triple {24334#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 111: Hoare triple {24334#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 112: Hoare triple {24334#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 113: Hoare triple {24334#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 114: Hoare triple {24334#false} assume 4432 == #t~mem62;havoc #t~mem62; {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 115: Hoare triple {24334#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 116: Hoare triple {24334#false} assume 4 == ~blastFlag~0; {24334#false} is VALID [2022-04-15 11:37:16,797 INFO L290 TraceCheckUtils]: 117: Hoare triple {24334#false} assume !false; {24334#false} is VALID [2022-04-15 11:37:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-15 11:37:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:16,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047709289] [2022-04-15 11:37:16,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047709289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:16,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:16,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:16,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:16,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [370827369] [2022-04-15 11:37:16,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [370827369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:16,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:16,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:16,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515149043] [2022-04-15 11:37:16,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:16,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:37:16,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:16,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have 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:37:16,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:16,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:16,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:16,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:16,875 INFO L87 Difference]: Start difference. First operand 550 states and 799 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have 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:37:18,900 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:37:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:20,500 INFO L93 Difference]: Finished difference Result 1447 states and 2114 transitions. [2022-04-15 11:37:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:20,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:37:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have 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:37:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:37:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have 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:37:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:37:20,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 11:37:20,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:20,876 INFO L225 Difference]: With dead ends: 1447 [2022-04-15 11:37:20,877 INFO L226 Difference]: Without dead ends: 913 [2022-04-15 11:37:20,878 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:37:20,878 INFO L913 BasicCegarLoop]: 243 mSDtfsCounter, 99 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:20,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 576 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 546 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 11:37:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2022-04-15 11:37:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 634. [2022-04-15 11:37:20,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:20,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 913 states. Second operand has 634 states, 629 states have (on average 1.4737678855325913) internal successors, (927), 629 states have internal predecessors, (927), 3 states have call successors, (3), 3 states have 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:37:20,923 INFO L74 IsIncluded]: Start isIncluded. First operand 913 states. Second operand has 634 states, 629 states have (on average 1.4737678855325913) internal successors, (927), 629 states have internal predecessors, (927), 3 states have call successors, (3), 3 states have 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:37:20,924 INFO L87 Difference]: Start difference. First operand 913 states. Second operand has 634 states, 629 states have (on average 1.4737678855325913) internal successors, (927), 629 states have internal predecessors, (927), 3 states have call successors, (3), 3 states have 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:37:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:20,962 INFO L93 Difference]: Finished difference Result 913 states and 1331 transitions. [2022-04-15 11:37:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1331 transitions. [2022-04-15 11:37:20,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:20,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:20,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 634 states, 629 states have (on average 1.4737678855325913) internal successors, (927), 629 states have internal predecessors, (927), 3 states have call successors, (3), 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 913 states. [2022-04-15 11:37:20,966 INFO L87 Difference]: Start difference. First operand has 634 states, 629 states have (on average 1.4737678855325913) internal successors, (927), 629 states have internal predecessors, (927), 3 states have call successors, (3), 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 913 states. [2022-04-15 11:37:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:21,000 INFO L93 Difference]: Finished difference Result 913 states and 1331 transitions. [2022-04-15 11:37:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1331 transitions. [2022-04-15 11:37:21,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:21,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:21,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:21,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 629 states have (on average 1.4737678855325913) internal successors, (927), 629 states have internal predecessors, (927), 3 states have call successors, (3), 3 states have 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:37:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 931 transitions. [2022-04-15 11:37:21,029 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 931 transitions. Word has length 118 [2022-04-15 11:37:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:21,030 INFO L478 AbstractCegarLoop]: Abstraction has 634 states and 931 transitions. [2022-04-15 11:37:21,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have 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:37:21,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 634 states and 931 transitions. [2022-04-15 11:37:21,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 931 edges. 931 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 931 transitions. [2022-04-15 11:37:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 11:37:21,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:21,771 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:37:21,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:37:21,771 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:21,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:21,771 INFO L85 PathProgramCache]: Analyzing trace with hash -577524775, now seen corresponding path program 1 times [2022-04-15 11:37:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:21,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446007347] [2022-04-15 11:37:21,772 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -577524775, now seen corresponding path program 2 times [2022-04-15 11:37:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:21,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104809983] [2022-04-15 11:37:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 11:37:23,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 11:37:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 11:37:23,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 11:37:23,820 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 11:37:23,820 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 11:37:23,825 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 11:37:23,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:37:23,829 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 11:37:23,832 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 11:37:23,865 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-15 11:37:23,866 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1135-2 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1675-1 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-15 11:37:23,867 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1655 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1659-2 has no Hoare annotation [2022-04-15 11:37:23,868 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1261 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1266-2 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-15 11:37:23,869 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-15 11:37:23,870 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1337-2 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1337-2 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1624-1 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-15 11:37:23,871 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1347-2 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1363-2 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1363-2 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1363 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1363 has no Hoare annotation [2022-04-15 11:37:23,872 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-15 11:37:23,873 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-15 11:37:23,874 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1453-2 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-15 11:37:23,875 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1512-1 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 11:37:23,876 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1542-1 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1255 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1558-2 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1570-2 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-15 11:37:23,877 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-15 11:37:23,877 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:37:23,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 11:37:23 BoogieIcfgContainer [2022-04-15 11:37:23,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 11:37:23,880 INFO L158 Benchmark]: Toolchain (without parser) took 168044.72ms. Allocated memory was 184.5MB in the beginning and 342.9MB in the end (delta: 158.3MB). Free memory was 136.6MB in the beginning and 188.0MB in the end (delta: -51.4MB). Peak memory consumption was 152.3MB. Max. memory is 8.0GB. [2022-04-15 11:37:23,880 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:37:23,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.66ms. Allocated memory is still 184.5MB. Free memory was 136.3MB in the beginning and 141.5MB in the end (delta: -5.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 11:37:23,880 INFO L158 Benchmark]: Boogie Preprocessor took 160.56ms. Allocated memory is still 184.5MB. Free memory was 141.5MB in the beginning and 131.8MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 11:37:23,881 INFO L158 Benchmark]: RCFGBuilder took 2455.38ms. Allocated memory is still 184.5MB. Free memory was 131.8MB in the beginning and 77.1MB in the end (delta: 54.6MB). Peak memory consumption was 55.7MB. Max. memory is 8.0GB. [2022-04-15 11:37:23,881 INFO L158 Benchmark]: TraceAbstraction took 164762.80ms. Allocated memory was 184.5MB in the beginning and 342.9MB in the end (delta: 158.3MB). Free memory was 76.6MB in the beginning and 188.0MB in the end (delta: -111.3MB). Peak memory consumption was 92.1MB. Max. memory is 8.0GB. [2022-04-15 11:37:23,881 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.12ms. Allocated memory is still 184.5MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 657.66ms. Allocated memory is still 184.5MB. Free memory was 136.3MB in the beginning and 141.5MB in the end (delta: -5.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 160.56ms. Allocated memory is still 184.5MB. Free memory was 141.5MB in the beginning and 131.8MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2455.38ms. Allocated memory is still 184.5MB. Free memory was 131.8MB in the beginning and 77.1MB in the end (delta: 54.6MB). Peak memory consumption was 55.7MB. Max. memory is 8.0GB. * TraceAbstraction took 164762.80ms. Allocated memory was 184.5MB in the beginning and 342.9MB in the end (delta: 158.3MB). Free memory was 76.6MB in the beginning and 188.0MB in the end (delta: -111.3MB). Peak memory consumption was 92.1MB. 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 1356. 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 [L1321] COND FALSE !(ret <= 0) [L1326] s->state = 4384 [L1327] s->init_num = 0 [L1328] EXPR s->bbio [L1328] EXPR s->wbio [L1328] 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 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 [L1342] COND FALSE !(ret <= 0) [L1347] s->hit [L1347] COND FALSE !(s->hit) [L1350] s->state = 4400 [L1352] 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 [L1356] EXPR s->s3 [L1356] EXPR (s->s3)->tmp.new_cipher [L1356] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1356] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1359] ret = __VERIFIER_nondet_int() [L1360] COND TRUE blastFlag == 2 [L1361] 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: 164.7s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 41.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 844 SdHoareTripleChecker+Valid, 28.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 844 mSDsluCounter, 5242 SdHoareTripleChecker+Invalid, 28.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2816 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4089 IncrementalHoareTripleChecker+Invalid, 4255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 2426 mSDtfsCounter, 4089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=12, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 653 StatesRemovedByMinimization, 8 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:37:23,923 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...