/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.03.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:33:21,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:33:21,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:33:21,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:33:21,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:33:21,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:33:21,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:33:21,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:33:21,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:33:21,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:33:21,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:33:21,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:33:21,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:33:21,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:33:21,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:33:21,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:33:21,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:33:21,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:33:21,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:33:21,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:33:21,104 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:33:21,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:33:21,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:33:21,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:33:21,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:33:21,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:33:21,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:33:21,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:33:21,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:33:21,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:33:21,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:33:21,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:33:21,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:33:21,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:33:21,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:33:21,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:33:21,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:33:21,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:33:21,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:33:21,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:33:21,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:33:21,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:33:21,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:33:21,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:33:21,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:33:21,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:33:21,135 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:33:21,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:33:21,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:33:21,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:33:21,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:33:21,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:33:21,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:33:21,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:33:21,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:33:21,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:33:21,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:33:21,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:33:21,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:33:21,137 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:33:21,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:33:21,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:33:21,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:33:21,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:33:21,137 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:33:21,138 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:33:21,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:33:21,138 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:33:21,138 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:33:21,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:33:21,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:33:21,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:33:21,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:33:21,379 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:33:21,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c [2022-04-28 08:33:21,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb449e561/6a93981bc12e44aeb72b648f2f0c013f/FLAGa2f8a7bd6 [2022-04-28 08:33:21,885 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:33:21,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c [2022-04-28 08:33:21,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb449e561/6a93981bc12e44aeb72b648f2f0c013f/FLAGa2f8a7bd6 [2022-04-28 08:33:21,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb449e561/6a93981bc12e44aeb72b648f2f0c013f [2022-04-28 08:33:21,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:33:21,946 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:33:21,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:33:21,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:33:21,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:33:21,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:33:21" (1/1) ... [2022-04-28 08:33:21,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70951d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:33:21, skipping insertion in model container [2022-04-28 08:33:21,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:33:21" (1/1) ... [2022-04-28 08:33:21,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:33:22,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:33:22,458 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.03.i.cil-1.c[65397,65410] [2022-04-28 08:33:22,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:33:22,489 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:33:22,640 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.03.i.cil-1.c[65397,65410] [2022-04-28 08:33:22,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:33:22,658 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:33:22,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:33:22 WrapperNode [2022-04-28 08:33:22,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:33:22,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:33:22,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:33:22,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:33:22,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:33:22" (1/1) ... [2022-04-28 08:33:22,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:33:22" (1/1) ... [2022-04-28 08:33:22,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:33:22" (1/1) ... [2022-04-28 08:33:22,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:33:22" (1/1) ... [2022-04-28 08:33:22,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:33:22" (1/1) ... [2022-04-28 08:33:22,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:33:22" (1/1) ... [2022-04-28 08:33:22,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:33:22" (1/1) ... [2022-04-28 08:33:22,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:33:22,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:33:22,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:33:22,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:33:22,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:33:22" (1/1) ... [2022-04-28 08:33:22,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:33:22,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:33:22,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:33:22,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:33:22,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:33:22,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:33:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:33:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-28 08:33:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-28 08:33:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:33:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-28 08:33:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 08:33:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 08:33:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 08:33:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:33:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:33:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:33:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:33:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:33:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:33:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:33:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:33:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:33:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:33:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-28 08:33:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 08:33:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-28 08:33:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-28 08:33:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 08:33:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:33:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:33:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:33:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:33:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:33:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:33:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 08:33:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 08:33:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:33:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:33:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:33:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:33:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:33:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:33:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:33:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:33:23,072 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:33:23,073 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:33:24,406 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:33:24,919 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-28 08:33:24,919 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-28 08:33:24,930 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:33:24,938 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:33:24,938 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:33:24,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:33:24 BoogieIcfgContainer [2022-04-28 08:33:24,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:33:24,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:33:24,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:33:24,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:33:24,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:33:21" (1/3) ... [2022-04-28 08:33:24,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9adcfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:33:24, skipping insertion in model container [2022-04-28 08:33:24,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:33:22" (2/3) ... [2022-04-28 08:33:24,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9adcfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:33:24, skipping insertion in model container [2022-04-28 08:33:24,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:33:24" (3/3) ... [2022-04-28 08:33:24,947 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2022-04-28 08:33:24,959 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:33:24,960 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:33:25,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:33:25,006 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c3d9e80, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@581cf3be [2022-04-28 08:33:25,006 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:33:25,015 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-28 08:33:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:33:25,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:25,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:33:25,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:25,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:25,028 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-28 08:33:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:25,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1553364236] [2022-04-28 08:33:25,044 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:33:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-28 08:33:25,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:25,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659848718] [2022-04-28 08:33:25,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:25,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:25,629 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-28 08:33:25,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-28 08:33:25,629 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-28 08:33:25,632 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-28 08:33:25,632 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-28 08:33:25,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-28 08:33:25,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-28 08:33:25,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-28 08:33:25,638 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-28 08:33:25,638 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-28 08:33:25,641 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-28 08:33:25,642 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-28 08:33:25,643 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-28 08:33:25,643 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-28 08:33:25,644 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-28 08:33:25,645 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-28 08:33:25,645 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-28 08:33:25,645 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-28 08:33:25,647 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-28 08:33:25,647 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-28 08:33:25,647 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-28 08:33:25,648 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-28 08:33:25,648 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-28 08:33:25,648 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-28 08:33:25,648 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-28 08:33:25,649 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-28 08:33:25,649 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-28 08:33:25,650 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-28 08:33:25,650 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-28 08:33:25,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-28 08:33:25,651 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-28 08:33:25,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 4 == ~blastFlag~0; {142#false} is VALID [2022-04-28 08:33:25,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-28 08:33:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:33:25,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:25,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659848718] [2022-04-28 08:33:25,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659848718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:25,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:25,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:25,657 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:25,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1553364236] [2022-04-28 08:33:25,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1553364236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:25,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:25,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544031918] [2022-04-28 08:33:25,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:25,664 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-28 08:33:25,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:25,669 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-28 08:33:25,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:25,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:33:25,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:25,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:33:25,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:33:25,727 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-28 08:33:27,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:29,185 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-28 08:33:29,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:33:29,186 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-28 08:33:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:29,191 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-28 08:33:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 08:33:29,210 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-28 08:33:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 08:33:29,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-28 08:33:29,587 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-28 08:33:29,602 INFO L225 Difference]: With dead ends: 267 [2022-04-28 08:33:29,602 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 08:33:29,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:33:29,614 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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-28 08:33:29,616 INFO L414 NwaCegarLoop]: 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-28 08:33:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 08:33:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-28 08:33:29,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:29,660 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-28 08:33:29,662 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-28 08:33:29,662 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-28 08:33:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:29,678 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-28 08:33:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-28 08:33:29,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:29,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:29,680 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-28 08:33:29,681 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-28 08:33:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:29,691 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-28 08:33:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-28 08:33:29,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:29,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:29,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:29,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:29,699 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-28 08:33:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-28 08:33:29,705 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-28 08:33:29,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:29,705 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-28 08:33:29,706 INFO L496 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-28 08:33:29,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-28 08:33:29,859 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-28 08:33:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-28 08:33:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 08:33:29,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:29,861 INFO L195 NwaCegarLoop]: 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-28 08:33:29,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:33:29,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-28 08:33:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:29,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [636141303] [2022-04-28 08:33:29,862 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-28 08:33:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:29,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724137706] [2022-04-28 08:33:29,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:29,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:30,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:30,166 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-28 08:33:30,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-28 08:33:30,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-28 08:33:30,169 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-28 08:33:30,169 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-28 08:33:30,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-28 08:33:30,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-28 08:33:30,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-28 08:33:30,170 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-28 08:33:30,170 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-28 08:33:30,171 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-28 08:33:30,172 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-28 08:33:30,172 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-28 08:33:30,173 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-28 08:33:30,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:33:30,174 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-28 08:33:30,174 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-28 08:33:30,177 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-28 08:33:30,177 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-28 08:33:30,178 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-28 08:33:30,178 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-28 08:33:30,179 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-28 08:33:30,179 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-28 08:33:30,181 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-28 08:33:30,181 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-28 08:33:30,182 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-28 08:33:30,182 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-28 08:33:30,182 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-28 08:33:30,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:33:30,183 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-28 08:33:30,184 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-28 08:33:30,184 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-28 08:33:30,185 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-28 08:33:30,185 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-28 08:33:30,185 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-28 08:33:30,186 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-28 08:33:30,186 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-28 08:33:30,187 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-28 08:33:30,187 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-28 08:33:30,187 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-28 08:33:30,188 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-28 08:33:30,188 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-28 08:33:30,189 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-28 08:33:30,189 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-28 08:33:30,189 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-28 08:33:30,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {1174#false} is VALID [2022-04-28 08:33:30,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-28 08:33:30,191 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-28 08:33:30,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:30,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724137706] [2022-04-28 08:33:30,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724137706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:30,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:30,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:33:30,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:30,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [636141303] [2022-04-28 08:33:30,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [636141303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:30,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:30,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:33:30,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435263459] [2022-04-28 08:33:30,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:30,193 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-28 08:33:30,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:30,194 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-28 08:33:30,231 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-28 08:33:30,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:33:30,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:30,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:33:30,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:33:30,233 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-28 08:33:32,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:33,029 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-28 08:33:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:33:33,029 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-28 08:33:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:33,030 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-28 08:33:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 08:33:33,035 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-28 08:33:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 08:33:33,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-28 08:33:33,438 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-28 08:33:33,445 INFO L225 Difference]: With dead ends: 327 [2022-04-28 08:33:33,446 INFO L226 Difference]: Without dead ends: 222 [2022-04-28 08:33:33,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:33:33,447 INFO L413 NwaCegarLoop]: 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-28 08:33:33,448 INFO L414 NwaCegarLoop]: 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-28 08:33:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-28 08:33:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-28 08:33:33,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:33,463 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-28 08:33:33,464 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-28 08:33:33,465 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-28 08:33:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:33,473 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-28 08:33:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-28 08:33:33,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:33,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:33,474 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-28 08:33:33,475 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-28 08:33:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:33,483 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-28 08:33:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-28 08:33:33,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:33,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:33,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:33,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:33,484 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-28 08:33:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-28 08:33:33,493 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-28 08:33:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:33,493 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-28 08:33:33,494 INFO L496 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-28 08:33:33,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-28 08:33:33,767 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-28 08:33:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-28 08:33:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 08:33:33,769 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:33,769 INFO L195 NwaCegarLoop]: 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-28 08:33:33,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:33:33,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:33,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:33,770 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-28 08:33:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:33,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [293240277] [2022-04-28 08:33:33,771 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-28 08:33:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:33,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48670141] [2022-04-28 08:33:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:33,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:33,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:33,993 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-28 08:33:33,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-28 08:33:33,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-28 08:33:33,994 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-28 08:33:33,994 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-28 08:33:33,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-28 08:33:33,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-28 08:33:33,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-28 08:33:33,995 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-28 08:33:33,995 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-28 08:33:33,995 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-28 08:33:33,996 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-28 08:33:33,996 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-28 08:33:33,996 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-28 08:33:33,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-28 08:33:33,996 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-28 08:33:33,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-28 08:33:33,997 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-28 08:33:33,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:33:33,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {2724#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2724#true} is VALID [2022-04-28 08:33:33,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2724#true} is VALID [2022-04-28 08:33:33,997 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-28 08:33:33,997 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-28 08:33:33,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-28 08:33:33,998 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-28 08:33:33,998 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-28 08:33:33,998 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-28 08:33:33,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-28 08:33:33,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-28 08:33:33,999 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-28 08:33:33,999 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-28 08:33:33,999 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-28 08:33:33,999 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-28 08:33:33,999 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-28 08:33:34,000 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-28 08:33:34,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-28 08:33:34,000 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-28 08:33:34,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-28 08:33:34,002 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-28 08:33:34,003 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-28 08:33:34,011 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-28 08:33:34,011 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-28 08:33:34,012 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-28 08:33:34,012 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-28 08:33:34,013 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-28 08:33:34,013 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-28 08:33:34,014 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-28 08:33:34,014 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-28 08:33:34,015 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-28 08:33:34,015 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-28 08:33:34,016 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-28 08:33:34,016 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-28 08:33:34,017 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-28 08:33:34,017 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-28 08:33:34,017 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-28 08:33:34,017 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-28 08:33:34,017 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-28 08:33:34,017 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-28 08:33:34,017 INFO L290 TraceCheckUtils]: 55: Hoare triple {2725#false} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-28 08:33:34,018 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-28 08:33:34,018 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 4 == ~blastFlag~0; {2725#false} is VALID [2022-04-28 08:33:34,018 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-28 08:33:34,018 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-28 08:33:34,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:34,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48670141] [2022-04-28 08:33:34,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48670141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:34,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:34,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:34,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:34,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [293240277] [2022-04-28 08:33:34,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [293240277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:34,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:34,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:34,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439107435] [2022-04-28 08:33:34,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:34,020 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-28 08:33:34,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:34,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:34,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:34,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:33:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:33:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:33:34,080 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-28 08:33:36,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:37,280 INFO L93 Difference]: Finished difference Result 363 states and 539 transitions. [2022-04-28 08:33:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:33:37,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 08:33:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-28 08:33:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-28 08:33:37,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-28 08:33:37,577 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-28 08:33:37,583 INFO L225 Difference]: With dead ends: 363 [2022-04-28 08:33:37,583 INFO L226 Difference]: Without dead ends: 258 [2022-04-28 08:33:37,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:33:37,584 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 33 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:33:37,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:33:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-28 08:33:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 240. [2022-04-28 08:33:37,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:37,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 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-28 08:33:37,599 INFO L74 IsIncluded]: Start isIncluded. First operand 258 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-28 08:33:37,600 INFO L87 Difference]: Start difference. First operand 258 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-28 08:33:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:37,608 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-28 08:33:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-28 08:33:37,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:37,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:37,609 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 258 states. [2022-04-28 08:33:37,610 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 258 states. [2022-04-28 08:33:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:37,618 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-28 08:33:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-28 08:33:37,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:37,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:37,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:37,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:37,619 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-28 08:33:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-28 08:33:37,627 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-28 08:33:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:37,627 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-28 08:33:37,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:37,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 356 transitions. [2022-04-28 08:33:37,875 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-28 08:33:37,875 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-28 08:33:37,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 08:33:37,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:37,876 INFO L195 NwaCegarLoop]: 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-28 08:33:37,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:33:37,877 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:37,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:37,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 3 times [2022-04-28 08:33:37,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:37,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [173510222] [2022-04-28 08:33:47,314 WARN L232 SmtUtils]: Spent 9.43s 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-28 08:33:56,080 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 4 times [2022-04-28 08:33:56,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:56,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111008866] [2022-04-28 08:33:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:56,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {4465#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {4458#true} is VALID [2022-04-28 08:33:56,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 08:33:56,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4458#true} {4458#true} #593#return; {4458#true} is VALID [2022-04-28 08:33:56,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {4458#true} call ULTIMATE.init(); {4465#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:33:56,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {4465#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {4458#true} is VALID [2022-04-28 08:33:56,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 08:33:56,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4458#true} {4458#true} #593#return; {4458#true} is VALID [2022-04-28 08:33:56,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {4458#true} call #t~ret158 := main(); {4458#true} is VALID [2022-04-28 08:33:56,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {4458#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; {4458#true} is VALID [2022-04-28 08:33:56,379 INFO L272 TraceCheckUtils]: 6: Hoare triple {4458#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4458#true} is VALID [2022-04-28 08:33:56,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {4458#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); {4458#true} is VALID [2022-04-28 08:33:56,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {4458#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; {4458#true} is VALID [2022-04-28 08:33:56,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {4458#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; {4458#true} is VALID [2022-04-28 08:33:56,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {4458#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4458#true} is VALID [2022-04-28 08:33:56,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {4458#true} assume !false; {4458#true} is VALID [2022-04-28 08:33:56,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {4458#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); {4458#true} is VALID [2022-04-28 08:33:56,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {4458#true} assume 12292 == #t~mem49;havoc #t~mem49; {4458#true} is VALID [2022-04-28 08:33:56,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {4458#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; {4458#true} is VALID [2022-04-28 08:33:56,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {4458#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4458#true} is VALID [2022-04-28 08:33:56,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {4458#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4458#true} is VALID [2022-04-28 08:33:56,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {4458#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4458#true} is VALID [2022-04-28 08:33:56,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {4458#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); {4458#true} is VALID [2022-04-28 08:33:56,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {4458#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4458#true} is VALID [2022-04-28 08:33:56,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {4458#true} assume !(0 == ~tmp___4~0); {4458#true} is VALID [2022-04-28 08:33:56,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {4458#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); {4458#true} is VALID [2022-04-28 08:33:56,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {4458#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); {4458#true} is VALID [2022-04-28 08:33:56,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {4458#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4458#true} is VALID [2022-04-28 08:33:56,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {4458#true} ~skip~0 := 0; {4458#true} is VALID [2022-04-28 08:33:56,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {4458#true} assume !false; {4458#true} is VALID [2022-04-28 08:33:56,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {4458#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); {4458#true} is VALID [2022-04-28 08:33:56,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {4458#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-28 08:33:56,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {4458#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-28 08:33:56,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {4458#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-28 08:33:56,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {4458#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-28 08:33:56,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {4458#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-28 08:33:56,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {4458#true} assume 4368 == #t~mem54;havoc #t~mem54; {4458#true} is VALID [2022-04-28 08:33:56,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {4458#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; {4458#true} is VALID [2022-04-28 08:33:56,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {4458#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4458#true} is VALID [2022-04-28 08:33:56,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {4458#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); {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:56,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {4463#(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; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:56,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {4463#(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); {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:56,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {4463#(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; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:56,391 INFO L290 TraceCheckUtils]: 39: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:56,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:56,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {4463#(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); {4464#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-28 08:33:56,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {4464#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {4459#false} is VALID [2022-04-28 08:33:56,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {4459#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; {4459#false} is VALID [2022-04-28 08:33:56,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {4459#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {4459#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4459#false} is VALID [2022-04-28 08:33:56,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {4459#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {4459#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); {4459#false} is VALID [2022-04-28 08:33:56,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {4459#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4459#false} is VALID [2022-04-28 08:33:56,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {4459#false} assume !(0 == ~tmp___4~0); {4459#false} is VALID [2022-04-28 08:33:56,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {4459#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); {4459#false} is VALID [2022-04-28 08:33:56,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {4459#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); {4459#false} is VALID [2022-04-28 08:33:56,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {4459#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4459#false} is VALID [2022-04-28 08:33:56,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {4459#false} ~skip~0 := 0; {4459#false} is VALID [2022-04-28 08:33:56,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2022-04-28 08:33:56,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {4459#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); {4459#false} is VALID [2022-04-28 08:33:56,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {4459#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {4459#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,401 INFO L290 TraceCheckUtils]: 58: Hoare triple {4459#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,402 INFO L290 TraceCheckUtils]: 59: Hoare triple {4459#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {4459#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {4459#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,402 INFO L290 TraceCheckUtils]: 62: Hoare triple {4459#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,402 INFO L290 TraceCheckUtils]: 63: Hoare triple {4459#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {4459#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,402 INFO L290 TraceCheckUtils]: 65: Hoare triple {4459#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,402 INFO L290 TraceCheckUtils]: 66: Hoare triple {4459#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,403 INFO L290 TraceCheckUtils]: 67: Hoare triple {4459#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,403 INFO L290 TraceCheckUtils]: 68: Hoare triple {4459#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-28 08:33:56,403 INFO L290 TraceCheckUtils]: 69: Hoare triple {4459#false} assume 4432 == #t~mem62;havoc #t~mem62; {4459#false} is VALID [2022-04-28 08:33:56,403 INFO L290 TraceCheckUtils]: 70: Hoare triple {4459#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4459#false} is VALID [2022-04-28 08:33:56,403 INFO L290 TraceCheckUtils]: 71: Hoare triple {4459#false} assume 4 == ~blastFlag~0; {4459#false} is VALID [2022-04-28 08:33:56,403 INFO L290 TraceCheckUtils]: 72: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2022-04-28 08:33:56,404 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-28 08:33:56,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:56,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111008866] [2022-04-28 08:33:56,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111008866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:56,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:56,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:56,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:56,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [173510222] [2022-04-28 08:33:56,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [173510222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:56,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:56,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:56,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644081306] [2022-04-28 08:33:56,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:56,410 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-28 08:33:56,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:56,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:56,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:56,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:33:56,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:56,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:33:56,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:33:56,466 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-28 08:33:58,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:59,593 INFO L93 Difference]: Finished difference Result 645 states and 966 transitions. [2022-04-28 08:33:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:33:59,593 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-28 08:33:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:33:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:33:59,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-28 08:33:59,958 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-28 08:33:59,970 INFO L225 Difference]: With dead ends: 645 [2022-04-28 08:33:59,970 INFO L226 Difference]: Without dead ends: 421 [2022-04-28 08:33:59,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:33:59,972 INFO L413 NwaCegarLoop]: 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-28 08:33:59,972 INFO L414 NwaCegarLoop]: 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-28 08:33:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-28 08:34:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 262. [2022-04-28 08:34:00,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:34:00,014 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-28 08:34:00,015 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-28 08:34:00,015 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-28 08:34:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:00,027 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-28 08:34:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-28 08:34:00,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:00,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:00,029 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-28 08:34:00,029 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-28 08:34:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:00,041 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-28 08:34:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-28 08:34:00,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:00,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:00,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:34:00,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:34:00,043 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-28 08:34:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 387 transitions. [2022-04-28 08:34:00,049 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 387 transitions. Word has length 73 [2022-04-28 08:34:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:34:00,049 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 387 transitions. [2022-04-28 08:34:00,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:00,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 262 states and 387 transitions. [2022-04-28 08:34:00,405 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-28 08:34:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 387 transitions. [2022-04-28 08:34:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 08:34:00,407 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:34:00,407 INFO L195 NwaCegarLoop]: 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-28 08:34:00,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:34:00,407 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:34:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:34:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-28 08:34:00,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:00,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [487042946] [2022-04-28 08:34:13,264 WARN L232 SmtUtils]: Spent 8.81s 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-28 08:34:19,815 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:34:19,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 2 times [2022-04-28 08:34:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:34:19,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91242644] [2022-04-28 08:34:19,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:34:19,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:34:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:34:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:20,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {7133#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {7126#true} is VALID [2022-04-28 08:34:20,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {7126#true} assume true; {7126#true} is VALID [2022-04-28 08:34:20,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7126#true} {7126#true} #593#return; {7126#true} is VALID [2022-04-28 08:34:20,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {7126#true} call ULTIMATE.init(); {7133#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:34:20,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {7133#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {7126#true} is VALID [2022-04-28 08:34:20,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {7126#true} assume true; {7126#true} is VALID [2022-04-28 08:34:20,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7126#true} {7126#true} #593#return; {7126#true} is VALID [2022-04-28 08:34:20,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {7126#true} call #t~ret158 := main(); {7126#true} is VALID [2022-04-28 08:34:20,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {7126#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; {7126#true} is VALID [2022-04-28 08:34:20,052 INFO L272 TraceCheckUtils]: 6: Hoare triple {7126#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7126#true} is VALID [2022-04-28 08:34:20,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {7126#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); {7126#true} is VALID [2022-04-28 08:34:20,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {7126#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; {7126#true} is VALID [2022-04-28 08:34:20,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {7126#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; {7126#true} is VALID [2022-04-28 08:34:20,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {7126#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7126#true} is VALID [2022-04-28 08:34:20,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {7126#true} assume !false; {7126#true} is VALID [2022-04-28 08:34:20,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {7126#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); {7126#true} is VALID [2022-04-28 08:34:20,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {7126#true} assume 12292 == #t~mem49;havoc #t~mem49; {7126#true} is VALID [2022-04-28 08:34:20,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {7126#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; {7126#true} is VALID [2022-04-28 08:34:20,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {7126#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7126#true} is VALID [2022-04-28 08:34:20,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {7126#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7126#true} is VALID [2022-04-28 08:34:20,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {7126#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7126#true} is VALID [2022-04-28 08:34:20,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {7126#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); {7126#true} is VALID [2022-04-28 08:34:20,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {7126#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7126#true} is VALID [2022-04-28 08:34:20,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {7126#true} assume !(0 == ~tmp___4~0); {7126#true} is VALID [2022-04-28 08:34:20,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {7126#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); {7126#true} is VALID [2022-04-28 08:34:20,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {7126#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); {7126#true} is VALID [2022-04-28 08:34:20,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {7126#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7126#true} is VALID [2022-04-28 08:34:20,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {7126#true} ~skip~0 := 0; {7126#true} is VALID [2022-04-28 08:34:20,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {7126#true} assume !false; {7126#true} is VALID [2022-04-28 08:34:20,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {7126#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); {7126#true} is VALID [2022-04-28 08:34:20,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {7126#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-28 08:34:20,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {7126#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-28 08:34:20,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {7126#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-28 08:34:20,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {7126#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-28 08:34:20,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {7126#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-28 08:34:20,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {7126#true} assume 4368 == #t~mem54;havoc #t~mem54; {7126#true} is VALID [2022-04-28 08:34:20,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {7126#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; {7126#true} is VALID [2022-04-28 08:34:20,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {7126#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7126#true} is VALID [2022-04-28 08:34:20,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {7126#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); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:20,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {7131#(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; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:20,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {7131#(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); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:20,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {7131#(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; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:20,071 INFO L290 TraceCheckUtils]: 39: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:20,071 INFO L290 TraceCheckUtils]: 40: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:20,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {7131#(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); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:34:20,072 INFO L290 TraceCheckUtils]: 42: Hoare triple {7131#(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); {7132#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-28 08:34:20,072 INFO L290 TraceCheckUtils]: 43: Hoare triple {7132#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {7127#false} is VALID [2022-04-28 08:34:20,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {7127#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,073 INFO L290 TraceCheckUtils]: 45: Hoare triple {7127#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7127#false} is VALID [2022-04-28 08:34:20,073 INFO L290 TraceCheckUtils]: 46: Hoare triple {7127#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,073 INFO L290 TraceCheckUtils]: 47: Hoare triple {7127#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); {7127#false} is VALID [2022-04-28 08:34:20,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {7127#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7127#false} is VALID [2022-04-28 08:34:20,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {7127#false} assume !(0 == ~tmp___4~0); {7127#false} is VALID [2022-04-28 08:34:20,074 INFO L290 TraceCheckUtils]: 50: Hoare triple {7127#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); {7127#false} is VALID [2022-04-28 08:34:20,074 INFO L290 TraceCheckUtils]: 51: Hoare triple {7127#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); {7127#false} is VALID [2022-04-28 08:34:20,074 INFO L290 TraceCheckUtils]: 52: Hoare triple {7127#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7127#false} is VALID [2022-04-28 08:34:20,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {7127#false} ~skip~0 := 0; {7127#false} is VALID [2022-04-28 08:34:20,074 INFO L290 TraceCheckUtils]: 54: Hoare triple {7127#false} assume !false; {7127#false} is VALID [2022-04-28 08:34:20,074 INFO L290 TraceCheckUtils]: 55: Hoare triple {7127#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); {7127#false} is VALID [2022-04-28 08:34:20,076 INFO L290 TraceCheckUtils]: 56: Hoare triple {7127#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {7127#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,076 INFO L290 TraceCheckUtils]: 58: Hoare triple {7127#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,076 INFO L290 TraceCheckUtils]: 59: Hoare triple {7127#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {7127#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,077 INFO L290 TraceCheckUtils]: 61: Hoare triple {7127#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,077 INFO L290 TraceCheckUtils]: 62: Hoare triple {7127#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,077 INFO L290 TraceCheckUtils]: 63: Hoare triple {7127#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,077 INFO L290 TraceCheckUtils]: 64: Hoare triple {7127#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,077 INFO L290 TraceCheckUtils]: 65: Hoare triple {7127#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,077 INFO L290 TraceCheckUtils]: 66: Hoare triple {7127#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,077 INFO L290 TraceCheckUtils]: 67: Hoare triple {7127#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,077 INFO L290 TraceCheckUtils]: 68: Hoare triple {7127#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-28 08:34:20,078 INFO L290 TraceCheckUtils]: 69: Hoare triple {7127#false} assume 4432 == #t~mem62;havoc #t~mem62; {7127#false} is VALID [2022-04-28 08:34:20,078 INFO L290 TraceCheckUtils]: 70: Hoare triple {7127#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7127#false} is VALID [2022-04-28 08:34:20,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {7127#false} assume 4 == ~blastFlag~0; {7127#false} is VALID [2022-04-28 08:34:20,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {7127#false} assume !false; {7127#false} is VALID [2022-04-28 08:34:20,080 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-28 08:34:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:34:20,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91242644] [2022-04-28 08:34:20,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91242644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:20,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:20,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:34:20,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:34:20,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [487042946] [2022-04-28 08:34:20,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [487042946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:20,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:20,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:34:20,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683554140] [2022-04-28 08:34:20,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:34:20,084 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-28 08:34:20,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:34:20,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:20,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:20,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:34:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:34:20,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:34:20,151 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-28 08:34:22,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:23,258 INFO L93 Difference]: Finished difference Result 668 states and 995 transitions. [2022-04-28 08:34:23,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:34:23,259 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-28 08:34:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:34:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 08:34:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 08:34:23,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 08:34:23,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:23,623 INFO L225 Difference]: With dead ends: 668 [2022-04-28 08:34:23,623 INFO L226 Difference]: Without dead ends: 422 [2022-04-28 08:34:23,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:34:23,625 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:34:23,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:34:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-28 08:34:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 264. [2022-04-28 08:34:23,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:34:23,650 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-28 08:34:23,651 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-28 08:34:23,651 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-28 08:34:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:23,663 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-28 08:34:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-28 08:34:23,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:23,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:23,665 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-28 08:34:23,666 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-28 08:34:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:23,677 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-28 08:34:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-28 08:34:23,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:23,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:23,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:34:23,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:34:23,679 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-28 08:34:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-28 08:34:23,686 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 73 [2022-04-28 08:34:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:34:23,686 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-28 08:34:23,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:23,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 388 transitions. [2022-04-28 08:34:23,994 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-28 08:34:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-28 08:34:23,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 08:34:23,995 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:34:23,995 INFO L195 NwaCegarLoop]: 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-28 08:34:23,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:34:23,995 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:34:23,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:34:23,996 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-28 08:34:23,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:23,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1496500860] [2022-04-28 08:34:35,762 WARN L232 SmtUtils]: Spent 11.76s 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-28 08:34:50,299 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:34:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 2 times [2022-04-28 08:34:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:34:50,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689654757] [2022-04-28 08:34:50,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:34:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:34:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:50,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:34:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:50,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {9853#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {9846#true} is VALID [2022-04-28 08:34:50,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {9846#true} assume true; {9846#true} is VALID [2022-04-28 08:34:50,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9846#true} {9846#true} #593#return; {9846#true} is VALID [2022-04-28 08:34:50,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {9846#true} call ULTIMATE.init(); {9853#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:34:50,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {9853#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {9846#true} is VALID [2022-04-28 08:34:50,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {9846#true} assume true; {9846#true} is VALID [2022-04-28 08:34:50,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9846#true} {9846#true} #593#return; {9846#true} is VALID [2022-04-28 08:34:50,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {9846#true} call #t~ret158 := main(); {9846#true} is VALID [2022-04-28 08:34:50,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {9846#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; {9846#true} is VALID [2022-04-28 08:34:50,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {9846#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9846#true} is VALID [2022-04-28 08:34:50,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {9846#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); {9846#true} is VALID [2022-04-28 08:34:50,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {9846#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; {9846#true} is VALID [2022-04-28 08:34:50,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {9846#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; {9846#true} is VALID [2022-04-28 08:34:50,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {9846#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9846#true} is VALID [2022-04-28 08:34:50,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {9846#true} assume !false; {9846#true} is VALID [2022-04-28 08:34:50,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {9846#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); {9846#true} is VALID [2022-04-28 08:34:50,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {9846#true} assume 12292 == #t~mem49;havoc #t~mem49; {9846#true} is VALID [2022-04-28 08:34:50,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {9846#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; {9846#true} is VALID [2022-04-28 08:34:50,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {9846#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9846#true} is VALID [2022-04-28 08:34:50,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {9846#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9846#true} is VALID [2022-04-28 08:34:50,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {9846#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9846#true} is VALID [2022-04-28 08:34:50,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {9846#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); {9846#true} is VALID [2022-04-28 08:34:50,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {9846#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9846#true} is VALID [2022-04-28 08:34:50,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {9846#true} assume !(0 == ~tmp___4~0); {9846#true} is VALID [2022-04-28 08:34:50,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {9846#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); {9846#true} is VALID [2022-04-28 08:34:50,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {9846#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); {9846#true} is VALID [2022-04-28 08:34:50,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {9846#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9846#true} is VALID [2022-04-28 08:34:50,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {9846#true} ~skip~0 := 0; {9846#true} is VALID [2022-04-28 08:34:50,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {9846#true} assume !false; {9846#true} is VALID [2022-04-28 08:34:50,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {9846#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); {9846#true} is VALID [2022-04-28 08:34:50,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {9846#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-28 08:34:50,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {9846#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-28 08:34:50,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {9846#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-28 08:34:50,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {9846#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-28 08:34:50,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {9846#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-28 08:34:50,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {9846#true} assume 4368 == #t~mem54;havoc #t~mem54; {9846#true} is VALID [2022-04-28 08:34:50,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {9846#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; {9846#true} is VALID [2022-04-28 08:34:50,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {9846#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9846#true} is VALID [2022-04-28 08:34:50,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {9846#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); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:50,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {9851#(= 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; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:50,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {9851#(= 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); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:50,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {9851#(= 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; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:50,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:50,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:50,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {9851#(= 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); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:50,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {9851#(= 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); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:50,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {9851#(= 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); {9852#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-28 08:34:50,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {9852#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {9847#false} is VALID [2022-04-28 08:34:50,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {9847#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {9847#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9847#false} is VALID [2022-04-28 08:34:50,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {9847#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {9847#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); {9847#false} is VALID [2022-04-28 08:34:50,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {9847#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9847#false} is VALID [2022-04-28 08:34:50,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {9847#false} assume !(0 == ~tmp___4~0); {9847#false} is VALID [2022-04-28 08:34:50,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {9847#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); {9847#false} is VALID [2022-04-28 08:34:50,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {9847#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); {9847#false} is VALID [2022-04-28 08:34:50,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {9847#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9847#false} is VALID [2022-04-28 08:34:50,526 INFO L290 TraceCheckUtils]: 54: Hoare triple {9847#false} ~skip~0 := 0; {9847#false} is VALID [2022-04-28 08:34:50,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {9847#false} assume !false; {9847#false} is VALID [2022-04-28 08:34:50,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {9847#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); {9847#false} is VALID [2022-04-28 08:34:50,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {9847#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,527 INFO L290 TraceCheckUtils]: 58: Hoare triple {9847#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,527 INFO L290 TraceCheckUtils]: 59: Hoare triple {9847#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,527 INFO L290 TraceCheckUtils]: 60: Hoare triple {9847#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {9847#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,527 INFO L290 TraceCheckUtils]: 62: Hoare triple {9847#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,527 INFO L290 TraceCheckUtils]: 63: Hoare triple {9847#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,527 INFO L290 TraceCheckUtils]: 64: Hoare triple {9847#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,528 INFO L290 TraceCheckUtils]: 65: Hoare triple {9847#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,528 INFO L290 TraceCheckUtils]: 66: Hoare triple {9847#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,528 INFO L290 TraceCheckUtils]: 67: Hoare triple {9847#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,528 INFO L290 TraceCheckUtils]: 68: Hoare triple {9847#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,528 INFO L290 TraceCheckUtils]: 69: Hoare triple {9847#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-28 08:34:50,528 INFO L290 TraceCheckUtils]: 70: Hoare triple {9847#false} assume 4432 == #t~mem62;havoc #t~mem62; {9847#false} is VALID [2022-04-28 08:34:50,528 INFO L290 TraceCheckUtils]: 71: Hoare triple {9847#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9847#false} is VALID [2022-04-28 08:34:50,528 INFO L290 TraceCheckUtils]: 72: Hoare triple {9847#false} assume 4 == ~blastFlag~0; {9847#false} is VALID [2022-04-28 08:34:50,528 INFO L290 TraceCheckUtils]: 73: Hoare triple {9847#false} assume !false; {9847#false} is VALID [2022-04-28 08:34:50,529 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-28 08:34:50,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:34:50,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689654757] [2022-04-28 08:34:50,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689654757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:50,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:50,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:34:50,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:34:50,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1496500860] [2022-04-28 08:34:50,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1496500860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:50,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:50,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:34:50,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704397973] [2022-04-28 08:34:50,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:34:50,531 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-28 08:34:50,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:34:50,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:50,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:50,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:34:50,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:34:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:34:50,600 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-28 08:34:52,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:53,565 INFO L93 Difference]: Finished difference Result 416 states and 614 transitions. [2022-04-28 08:34:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:34:53,565 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-28 08:34:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:34:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-28 08:34:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-28 08:34:53,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-28 08:34:53,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:53,903 INFO L225 Difference]: With dead ends: 416 [2022-04-28 08:34:53,904 INFO L226 Difference]: Without dead ends: 281 [2022-04-28 08:34:53,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:34:53,907 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 35 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:34:53,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 482 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:34:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-28 08:34:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-28 08:34:53,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:34:53,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 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-28 08:34:53,923 INFO L74 IsIncluded]: Start isIncluded. First operand 281 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-28 08:34:53,923 INFO L87 Difference]: Start difference. First operand 281 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-28 08:34:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:53,929 INFO L93 Difference]: Finished difference Result 281 states and 410 transitions. [2022-04-28 08:34:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 410 transitions. [2022-04-28 08:34:53,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:53,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:53,930 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 281 states. [2022-04-28 08:34:53,931 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 281 states. [2022-04-28 08:34:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:53,937 INFO L93 Difference]: Finished difference Result 281 states and 410 transitions. [2022-04-28 08:34:53,937 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 410 transitions. [2022-04-28 08:34:53,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:53,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:53,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:34:53,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:34:53,938 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-28 08:34:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 387 transitions. [2022-04-28 08:34:53,944 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 387 transitions. Word has length 74 [2022-04-28 08:34:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:34:53,945 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 387 transitions. [2022-04-28 08:34:53,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:53,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 387 transitions. [2022-04-28 08:34:54,277 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-28 08:34:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 387 transitions. [2022-04-28 08:34:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 08:34:54,280 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:34:54,280 INFO L195 NwaCegarLoop]: 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-28 08:34:54,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:34:54,280 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:34:54,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:34:54,281 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-28 08:34:54,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:54,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [3087807] [2022-04-28 08:35:08,195 WARN L232 SmtUtils]: Spent 9.85s 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-28 08:35:15,967 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 2 times [2022-04-28 08:35:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:15,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977370634] [2022-04-28 08:35:15,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:16,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:16,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {11787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {11780#true} is VALID [2022-04-28 08:35:16,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {11780#true} assume true; {11780#true} is VALID [2022-04-28 08:35:16,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11780#true} {11780#true} #593#return; {11780#true} is VALID [2022-04-28 08:35:16,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {11780#true} call ULTIMATE.init(); {11787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:35:16,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {11787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {11780#true} is VALID [2022-04-28 08:35:16,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {11780#true} assume true; {11780#true} is VALID [2022-04-28 08:35:16,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11780#true} {11780#true} #593#return; {11780#true} is VALID [2022-04-28 08:35:16,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {11780#true} call #t~ret158 := main(); {11780#true} is VALID [2022-04-28 08:35:16,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {11780#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; {11780#true} is VALID [2022-04-28 08:35:16,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {11780#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11780#true} is VALID [2022-04-28 08:35:16,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {11780#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); {11780#true} is VALID [2022-04-28 08:35:16,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {11780#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; {11780#true} is VALID [2022-04-28 08:35:16,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {11780#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; {11780#true} is VALID [2022-04-28 08:35:16,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {11780#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11780#true} is VALID [2022-04-28 08:35:16,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {11780#true} assume !false; {11780#true} is VALID [2022-04-28 08:35:16,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {11780#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); {11780#true} is VALID [2022-04-28 08:35:16,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {11780#true} assume 12292 == #t~mem49;havoc #t~mem49; {11780#true} is VALID [2022-04-28 08:35:16,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {11780#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; {11780#true} is VALID [2022-04-28 08:35:16,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {11780#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11780#true} is VALID [2022-04-28 08:35:16,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {11780#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11780#true} is VALID [2022-04-28 08:35:16,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {11780#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11780#true} is VALID [2022-04-28 08:35:16,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {11780#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); {11780#true} is VALID [2022-04-28 08:35:16,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {11780#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11780#true} is VALID [2022-04-28 08:35:16,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {11780#true} assume !(0 == ~tmp___4~0); {11780#true} is VALID [2022-04-28 08:35:16,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {11780#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); {11780#true} is VALID [2022-04-28 08:35:16,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {11780#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); {11780#true} is VALID [2022-04-28 08:35:16,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {11780#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11780#true} is VALID [2022-04-28 08:35:16,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {11780#true} ~skip~0 := 0; {11780#true} is VALID [2022-04-28 08:35:16,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {11780#true} assume !false; {11780#true} is VALID [2022-04-28 08:35:16,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {11780#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); {11780#true} is VALID [2022-04-28 08:35:16,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {11780#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-28 08:35:16,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {11780#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-28 08:35:16,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {11780#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-28 08:35:16,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {11780#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-28 08:35:16,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {11780#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-28 08:35:16,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {11780#true} assume 4368 == #t~mem54;havoc #t~mem54; {11780#true} is VALID [2022-04-28 08:35:16,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {11780#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; {11780#true} is VALID [2022-04-28 08:35:16,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {11780#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11780#true} is VALID [2022-04-28 08:35:16,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {11780#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); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:16,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {11785#(= 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; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:16,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {11785#(= 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); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:16,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {11785#(= 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; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:16,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:16,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:16,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {11785#(= 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); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:16,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {11785#(= 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); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:16,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {11785#(= 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); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:16,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {11785#(= 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); {11786#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-28 08:35:16,201 INFO L290 TraceCheckUtils]: 45: Hoare triple {11786#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {11781#false} is VALID [2022-04-28 08:35:16,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {11781#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {11781#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11781#false} is VALID [2022-04-28 08:35:16,202 INFO L290 TraceCheckUtils]: 48: Hoare triple {11781#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,202 INFO L290 TraceCheckUtils]: 49: Hoare triple {11781#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); {11781#false} is VALID [2022-04-28 08:35:16,202 INFO L290 TraceCheckUtils]: 50: Hoare triple {11781#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11781#false} is VALID [2022-04-28 08:35:16,202 INFO L290 TraceCheckUtils]: 51: Hoare triple {11781#false} assume !(0 == ~tmp___4~0); {11781#false} is VALID [2022-04-28 08:35:16,202 INFO L290 TraceCheckUtils]: 52: Hoare triple {11781#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); {11781#false} is VALID [2022-04-28 08:35:16,202 INFO L290 TraceCheckUtils]: 53: Hoare triple {11781#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); {11781#false} is VALID [2022-04-28 08:35:16,202 INFO L290 TraceCheckUtils]: 54: Hoare triple {11781#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11781#false} is VALID [2022-04-28 08:35:16,203 INFO L290 TraceCheckUtils]: 55: Hoare triple {11781#false} ~skip~0 := 0; {11781#false} is VALID [2022-04-28 08:35:16,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {11781#false} assume !false; {11781#false} is VALID [2022-04-28 08:35:16,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {11781#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); {11781#false} is VALID [2022-04-28 08:35:16,203 INFO L290 TraceCheckUtils]: 58: Hoare triple {11781#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,203 INFO L290 TraceCheckUtils]: 59: Hoare triple {11781#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,203 INFO L290 TraceCheckUtils]: 60: Hoare triple {11781#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,203 INFO L290 TraceCheckUtils]: 61: Hoare triple {11781#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,203 INFO L290 TraceCheckUtils]: 62: Hoare triple {11781#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,203 INFO L290 TraceCheckUtils]: 63: Hoare triple {11781#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,204 INFO L290 TraceCheckUtils]: 64: Hoare triple {11781#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,204 INFO L290 TraceCheckUtils]: 65: Hoare triple {11781#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,204 INFO L290 TraceCheckUtils]: 66: Hoare triple {11781#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,204 INFO L290 TraceCheckUtils]: 67: Hoare triple {11781#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,204 INFO L290 TraceCheckUtils]: 68: Hoare triple {11781#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,204 INFO L290 TraceCheckUtils]: 69: Hoare triple {11781#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,204 INFO L290 TraceCheckUtils]: 70: Hoare triple {11781#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-28 08:35:16,204 INFO L290 TraceCheckUtils]: 71: Hoare triple {11781#false} assume 4432 == #t~mem62;havoc #t~mem62; {11781#false} is VALID [2022-04-28 08:35:16,205 INFO L290 TraceCheckUtils]: 72: Hoare triple {11781#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11781#false} is VALID [2022-04-28 08:35:16,205 INFO L290 TraceCheckUtils]: 73: Hoare triple {11781#false} assume 4 == ~blastFlag~0; {11781#false} is VALID [2022-04-28 08:35:16,205 INFO L290 TraceCheckUtils]: 74: Hoare triple {11781#false} assume !false; {11781#false} is VALID [2022-04-28 08:35:16,206 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-28 08:35:16,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:16,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977370634] [2022-04-28 08:35:16,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977370634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:16,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:16,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:16,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:16,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [3087807] [2022-04-28 08:35:16,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [3087807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:16,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:16,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:16,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789898370] [2022-04-28 08:35:16,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:16,208 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-28 08:35:16,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:16,208 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-28 08:35:16,278 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-28 08:35:16,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:35:16,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:16,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:35:16,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:35:16,279 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-28 08:35:18,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:19,377 INFO L93 Difference]: Finished difference Result 416 states and 612 transitions. [2022-04-28 08:35:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:35:19,378 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-28 08:35:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:19,378 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-28 08:35:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-28 08:35:19,381 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-28 08:35:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-28 08:35:19,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-28 08:35:19,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:19,703 INFO L225 Difference]: With dead ends: 416 [2022-04-28 08:35:19,703 INFO L226 Difference]: Without dead ends: 281 [2022-04-28 08:35:19,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:35:19,704 INFO L413 NwaCegarLoop]: 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-28 08:35:19,705 INFO L414 NwaCegarLoop]: 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-28 08:35:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-28 08:35:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-28 08:35:19,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:19,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 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-28 08:35:19,720 INFO L74 IsIncluded]: Start isIncluded. First operand 281 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-28 08:35:19,721 INFO L87 Difference]: Start difference. First operand 281 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-28 08:35:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:19,726 INFO L93 Difference]: Finished difference Result 281 states and 409 transitions. [2022-04-28 08:35:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 409 transitions. [2022-04-28 08:35:19,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:19,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:19,728 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 281 states. [2022-04-28 08:35:19,728 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 281 states. [2022-04-28 08:35:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:19,734 INFO L93 Difference]: Finished difference Result 281 states and 409 transitions. [2022-04-28 08:35:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 409 transitions. [2022-04-28 08:35:19,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:19,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:19,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:19,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:19,736 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-28 08:35:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 386 transitions. [2022-04-28 08:35:19,743 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 386 transitions. Word has length 75 [2022-04-28 08:35:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:19,743 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 386 transitions. [2022-04-28 08:35:19,743 INFO L496 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-28 08:35:19,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 386 transitions. [2022-04-28 08:35:20,153 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-28 08:35:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 386 transitions. [2022-04-28 08:35:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 08:35:20,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:20,154 INFO L195 NwaCegarLoop]: 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-28 08:35:20,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:35:20,155 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:20,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-28 08:35:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:20,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2138595911] [2022-04-28 08:35:34,147 WARN L232 SmtUtils]: Spent 9.63s 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-28 08:35:43,426 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 2 times [2022-04-28 08:35:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:43,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404357584] [2022-04-28 08:35:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:43,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:43,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {13721#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {13714#true} is VALID [2022-04-28 08:35:43,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {13714#true} assume true; {13714#true} is VALID [2022-04-28 08:35:43,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13714#true} {13714#true} #593#return; {13714#true} is VALID [2022-04-28 08:35:43,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {13714#true} call ULTIMATE.init(); {13721#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:35:43,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {13721#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {13714#true} is VALID [2022-04-28 08:35:43,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {13714#true} assume true; {13714#true} is VALID [2022-04-28 08:35:43,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13714#true} {13714#true} #593#return; {13714#true} is VALID [2022-04-28 08:35:43,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {13714#true} call #t~ret158 := main(); {13714#true} is VALID [2022-04-28 08:35:43,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {13714#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; {13714#true} is VALID [2022-04-28 08:35:43,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {13714#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13714#true} is VALID [2022-04-28 08:35:43,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {13714#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); {13714#true} is VALID [2022-04-28 08:35:43,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {13714#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; {13714#true} is VALID [2022-04-28 08:35:43,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#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; {13714#true} is VALID [2022-04-28 08:35:43,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13714#true} is VALID [2022-04-28 08:35:43,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {13714#true} assume !false; {13714#true} is VALID [2022-04-28 08:35:43,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {13714#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); {13714#true} is VALID [2022-04-28 08:35:43,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {13714#true} assume 12292 == #t~mem49;havoc #t~mem49; {13714#true} is VALID [2022-04-28 08:35:43,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {13714#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; {13714#true} is VALID [2022-04-28 08:35:43,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {13714#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13714#true} is VALID [2022-04-28 08:35:43,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {13714#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13714#true} is VALID [2022-04-28 08:35:43,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {13714#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13714#true} is VALID [2022-04-28 08:35:43,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {13714#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); {13714#true} is VALID [2022-04-28 08:35:43,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {13714#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13714#true} is VALID [2022-04-28 08:35:43,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {13714#true} assume !(0 == ~tmp___4~0); {13714#true} is VALID [2022-04-28 08:35:43,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {13714#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); {13714#true} is VALID [2022-04-28 08:35:43,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {13714#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); {13714#true} is VALID [2022-04-28 08:35:43,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {13714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13714#true} is VALID [2022-04-28 08:35:43,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {13714#true} ~skip~0 := 0; {13714#true} is VALID [2022-04-28 08:35:43,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {13714#true} assume !false; {13714#true} is VALID [2022-04-28 08:35:43,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {13714#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); {13714#true} is VALID [2022-04-28 08:35:43,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {13714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-28 08:35:43,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {13714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-28 08:35:43,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {13714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-28 08:35:43,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {13714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-28 08:35:43,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {13714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-28 08:35:43,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {13714#true} assume 4368 == #t~mem54;havoc #t~mem54; {13714#true} is VALID [2022-04-28 08:35:43,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {13714#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; {13714#true} is VALID [2022-04-28 08:35:43,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {13714#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13714#true} is VALID [2022-04-28 08:35:43,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {13714#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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {13719#(= 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; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {13719#(= 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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {13719#(= 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; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {13719#(= 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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {13719#(= 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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {13719#(= 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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {13719#(= 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); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:43,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {13719#(= 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); {13720#(= |ssl3_connect_#t~mem53| 4384)} is VALID [2022-04-28 08:35:43,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {13720#(= |ssl3_connect_#t~mem53| 4384)} assume 4099 == #t~mem53;havoc #t~mem53; {13715#false} is VALID [2022-04-28 08:35:43,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {13715#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {13715#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13715#false} is VALID [2022-04-28 08:35:43,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {13715#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {13715#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); {13715#false} is VALID [2022-04-28 08:35:43,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {13715#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13715#false} is VALID [2022-04-28 08:35:43,617 INFO L290 TraceCheckUtils]: 52: Hoare triple {13715#false} assume !(0 == ~tmp___4~0); {13715#false} is VALID [2022-04-28 08:35:43,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {13715#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); {13715#false} is VALID [2022-04-28 08:35:43,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {13715#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); {13715#false} is VALID [2022-04-28 08:35:43,617 INFO L290 TraceCheckUtils]: 55: Hoare triple {13715#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13715#false} is VALID [2022-04-28 08:35:43,617 INFO L290 TraceCheckUtils]: 56: Hoare triple {13715#false} ~skip~0 := 0; {13715#false} is VALID [2022-04-28 08:35:43,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {13715#false} assume !false; {13715#false} is VALID [2022-04-28 08:35:43,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {13715#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); {13715#false} is VALID [2022-04-28 08:35:43,618 INFO L290 TraceCheckUtils]: 59: Hoare triple {13715#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,618 INFO L290 TraceCheckUtils]: 60: Hoare triple {13715#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {13715#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {13715#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {13715#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,618 INFO L290 TraceCheckUtils]: 64: Hoare triple {13715#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,618 INFO L290 TraceCheckUtils]: 65: Hoare triple {13715#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,618 INFO L290 TraceCheckUtils]: 66: Hoare triple {13715#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,618 INFO L290 TraceCheckUtils]: 67: Hoare triple {13715#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,619 INFO L290 TraceCheckUtils]: 68: Hoare triple {13715#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,619 INFO L290 TraceCheckUtils]: 69: Hoare triple {13715#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,619 INFO L290 TraceCheckUtils]: 70: Hoare triple {13715#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,619 INFO L290 TraceCheckUtils]: 71: Hoare triple {13715#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-28 08:35:43,619 INFO L290 TraceCheckUtils]: 72: Hoare triple {13715#false} assume 4432 == #t~mem62;havoc #t~mem62; {13715#false} is VALID [2022-04-28 08:35:43,619 INFO L290 TraceCheckUtils]: 73: Hoare triple {13715#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {13715#false} is VALID [2022-04-28 08:35:43,619 INFO L290 TraceCheckUtils]: 74: Hoare triple {13715#false} assume 4 == ~blastFlag~0; {13715#false} is VALID [2022-04-28 08:35:43,619 INFO L290 TraceCheckUtils]: 75: Hoare triple {13715#false} assume !false; {13715#false} is VALID [2022-04-28 08:35:43,620 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-28 08:35:43,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:43,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404357584] [2022-04-28 08:35:43,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404357584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:43,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:43,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:43,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:43,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2138595911] [2022-04-28 08:35:43,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2138595911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:43,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:43,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:43,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307286767] [2022-04-28 08:35:43,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:43,621 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-28 08:35:43,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:43,622 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-28 08:35:43,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:43,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:35:43,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:43,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:35:43,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:35:43,689 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-28 08:35:45,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:46,630 INFO L93 Difference]: Finished difference Result 407 states and 599 transitions. [2022-04-28 08:35:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:35:46,631 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-28 08:35:46,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:46,631 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-28 08:35:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-28 08:35:46,634 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-28 08:35:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-28 08:35:46,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 371 transitions. [2022-04-28 08:35:46,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:46,896 INFO L225 Difference]: With dead ends: 407 [2022-04-28 08:35:46,896 INFO L226 Difference]: Without dead ends: 272 [2022-04-28 08:35:46,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:35:46,897 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 24 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:35:46,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 466 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:35:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-28 08:35:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2022-04-28 08:35:46,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:46,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 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-28 08:35:46,910 INFO L74 IsIncluded]: Start isIncluded. First operand 272 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-28 08:35:46,911 INFO L87 Difference]: Start difference. First operand 272 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-28 08:35:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:46,916 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2022-04-28 08:35:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 397 transitions. [2022-04-28 08:35:46,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:46,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:46,918 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 272 states. [2022-04-28 08:35:46,918 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 272 states. [2022-04-28 08:35:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:46,924 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2022-04-28 08:35:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 397 transitions. [2022-04-28 08:35:46,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:46,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:46,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:46,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:46,925 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-28 08:35:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 385 transitions. [2022-04-28 08:35:46,931 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 385 transitions. Word has length 76 [2022-04-28 08:35:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:46,931 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 385 transitions. [2022-04-28 08:35:46,931 INFO L496 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-28 08:35:46,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 385 transitions. [2022-04-28 08:35:47,249 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-28 08:35:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 385 transitions. [2022-04-28 08:35:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 08:35:47,250 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:47,250 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:35:47,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:35:47,250 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:47,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1188358039, now seen corresponding path program 1 times [2022-04-28 08:35:47,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:47,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1150555099] [2022-04-28 08:35:47,251 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1188358039, now seen corresponding path program 2 times [2022-04-28 08:35:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:47,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964987865] [2022-04-28 08:35:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:47,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:47,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {15618#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {15612#true} is VALID [2022-04-28 08:35:47,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {15612#true} assume true; {15612#true} is VALID [2022-04-28 08:35:47,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15612#true} {15612#true} #593#return; {15612#true} is VALID [2022-04-28 08:35:47,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {15612#true} call ULTIMATE.init(); {15618#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:35:47,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {15618#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {15612#true} is VALID [2022-04-28 08:35:47,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {15612#true} assume true; {15612#true} is VALID [2022-04-28 08:35:47,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15612#true} {15612#true} #593#return; {15612#true} is VALID [2022-04-28 08:35:47,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {15612#true} call #t~ret158 := main(); {15612#true} is VALID [2022-04-28 08:35:47,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {15612#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; {15612#true} is VALID [2022-04-28 08:35:47,446 INFO L272 TraceCheckUtils]: 6: Hoare triple {15612#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15612#true} is VALID [2022-04-28 08:35:47,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {15612#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); {15612#true} is VALID [2022-04-28 08:35:47,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {15612#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; {15612#true} is VALID [2022-04-28 08:35:47,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {15612#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; {15612#true} is VALID [2022-04-28 08:35:47,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {15612#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15612#true} is VALID [2022-04-28 08:35:47,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-28 08:35:47,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {15612#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); {15612#true} is VALID [2022-04-28 08:35:47,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {15612#true} assume 12292 == #t~mem49;havoc #t~mem49; {15612#true} is VALID [2022-04-28 08:35:47,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {15612#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; {15612#true} is VALID [2022-04-28 08:35:47,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {15612#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {15612#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15612#true} is VALID [2022-04-28 08:35:47,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {15612#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {15612#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); {15612#true} is VALID [2022-04-28 08:35:47,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {15612#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15612#true} is VALID [2022-04-28 08:35:47,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {15612#true} assume !(0 == ~tmp___4~0); {15612#true} is VALID [2022-04-28 08:35:47,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {15612#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); {15612#true} is VALID [2022-04-28 08:35:47,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {15612#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); {15612#true} is VALID [2022-04-28 08:35:47,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {15612#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15612#true} is VALID [2022-04-28 08:35:47,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {15612#true} ~skip~0 := 0; {15612#true} is VALID [2022-04-28 08:35:47,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-28 08:35:47,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {15612#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); {15612#true} is VALID [2022-04-28 08:35:47,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {15612#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {15612#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {15612#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {15612#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {15612#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {15612#true} assume 4368 == #t~mem54;havoc #t~mem54; {15612#true} is VALID [2022-04-28 08:35:47,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {15612#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; {15612#true} is VALID [2022-04-28 08:35:47,449 INFO L290 TraceCheckUtils]: 34: Hoare triple {15612#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15612#true} is VALID [2022-04-28 08:35:47,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {15612#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); {15612#true} is VALID [2022-04-28 08:35:47,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {15612#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; {15612#true} is VALID [2022-04-28 08:35:47,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {15612#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); {15612#true} is VALID [2022-04-28 08:35:47,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {15612#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15612#true} is VALID [2022-04-28 08:35:47,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {15612#true} ~skip~0 := 0; {15612#true} is VALID [2022-04-28 08:35:47,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-28 08:35:47,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {15612#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); {15612#true} is VALID [2022-04-28 08:35:47,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {15612#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {15612#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {15612#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {15612#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {15612#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {15612#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {15612#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-28 08:35:47,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {15612#true} assume 4384 == #t~mem56;havoc #t~mem56; {15612#true} is VALID [2022-04-28 08:35:47,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {15612#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15612#true} is VALID [2022-04-28 08:35:47,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {15612#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,452 INFO L290 TraceCheckUtils]: 55: Hoare triple {15617#(= 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); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,454 INFO L290 TraceCheckUtils]: 59: Hoare triple {15617#(= 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); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,455 INFO L290 TraceCheckUtils]: 61: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,455 INFO L290 TraceCheckUtils]: 62: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,456 INFO L290 TraceCheckUtils]: 63: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,456 INFO L290 TraceCheckUtils]: 64: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,456 INFO L290 TraceCheckUtils]: 65: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,458 INFO L290 TraceCheckUtils]: 67: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,458 INFO L290 TraceCheckUtils]: 68: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,459 INFO L290 TraceCheckUtils]: 69: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,459 INFO L290 TraceCheckUtils]: 70: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,459 INFO L290 TraceCheckUtils]: 71: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,460 INFO L290 TraceCheckUtils]: 73: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,460 INFO L290 TraceCheckUtils]: 74: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:47,461 INFO L290 TraceCheckUtils]: 75: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {15613#false} is VALID [2022-04-28 08:35:47,461 INFO L290 TraceCheckUtils]: 76: Hoare triple {15613#false} assume !false; {15613#false} is VALID [2022-04-28 08:35:47,461 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-28 08:35:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:47,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964987865] [2022-04-28 08:35:47,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964987865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:47,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:47,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:35:47,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:47,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1150555099] [2022-04-28 08:35:47,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1150555099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:47,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:47,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:35:47,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651233471] [2022-04-28 08:35:47,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:47,463 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-28 08:35:47,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:47,463 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-28 08:35:47,519 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-28 08:35:47,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:35:47,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:47,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:35:47,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:35:47,520 INFO L87 Difference]: Start difference. First operand 264 states and 385 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-28 08:35:49,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:50,529 INFO L93 Difference]: Finished difference Result 531 states and 783 transitions. [2022-04-28 08:35:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:35:50,529 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-28 08:35:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:50,530 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-28 08:35:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-28 08:35:50,533 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-28 08:35:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-28 08:35:50,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-28 08:35:50,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:50,904 INFO L225 Difference]: With dead ends: 531 [2022-04-28 08:35:50,904 INFO L226 Difference]: Without dead ends: 396 [2022-04-28 08:35:50,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:35:50,905 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:35:50,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:35:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-28 08:35:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2022-04-28 08:35:50,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:50,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:50,921 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:50,921 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:50,931 INFO L93 Difference]: Finished difference Result 396 states and 577 transitions. [2022-04-28 08:35:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-28 08:35:50,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:50,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:50,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 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 396 states. [2022-04-28 08:35:50,933 INFO L87 Difference]: Start difference. First operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 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 396 states. [2022-04-28 08:35:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:50,943 INFO L93 Difference]: Finished difference Result 396 states and 577 transitions. [2022-04-28 08:35:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-28 08:35:50,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:50,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:50,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:50,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 577 transitions. [2022-04-28 08:35:50,956 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 577 transitions. Word has length 77 [2022-04-28 08:35:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:50,957 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 577 transitions. [2022-04-28 08:35:50,957 INFO L496 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-28 08:35:50,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 396 states and 577 transitions. [2022-04-28 08:35:51,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-28 08:35:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 08:35:51,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:51,429 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:35:51,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:35:51,430 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:51,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash -979274608, now seen corresponding path program 1 times [2022-04-28 08:35:51,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:51,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2109598304] [2022-04-28 08:35:51,430 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash -979274608, now seen corresponding path program 2 times [2022-04-28 08:35:51,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:51,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523936525] [2022-04-28 08:35:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:51,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:51,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {18273#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {18267#true} is VALID [2022-04-28 08:35:51,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {18267#true} assume true; {18267#true} is VALID [2022-04-28 08:35:51,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18267#true} {18267#true} #593#return; {18267#true} is VALID [2022-04-28 08:35:51,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {18267#true} call ULTIMATE.init(); {18273#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:35:51,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {18273#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {18267#true} is VALID [2022-04-28 08:35:51,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {18267#true} assume true; {18267#true} is VALID [2022-04-28 08:35:51,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18267#true} {18267#true} #593#return; {18267#true} is VALID [2022-04-28 08:35:51,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {18267#true} call #t~ret158 := main(); {18267#true} is VALID [2022-04-28 08:35:51,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {18267#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; {18267#true} is VALID [2022-04-28 08:35:51,585 INFO L272 TraceCheckUtils]: 6: Hoare triple {18267#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {18267#true} is VALID [2022-04-28 08:35:51,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {18267#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); {18267#true} is VALID [2022-04-28 08:35:51,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {18267#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; {18267#true} is VALID [2022-04-28 08:35:51,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {18267#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; {18267#true} is VALID [2022-04-28 08:35:51,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {18267#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18267#true} is VALID [2022-04-28 08:35:51,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {18267#true} assume !false; {18267#true} is VALID [2022-04-28 08:35:51,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {18267#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); {18267#true} is VALID [2022-04-28 08:35:51,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {18267#true} assume 12292 == #t~mem49;havoc #t~mem49; {18267#true} is VALID [2022-04-28 08:35:51,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {18267#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; {18267#true} is VALID [2022-04-28 08:35:51,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {18267#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18267#true} is VALID [2022-04-28 08:35:51,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {18267#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18267#true} is VALID [2022-04-28 08:35:51,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {18267#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {18267#true} is VALID [2022-04-28 08:35:51,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {18267#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); {18267#true} is VALID [2022-04-28 08:35:51,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {18267#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {18267#true} is VALID [2022-04-28 08:35:51,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {18267#true} assume !(0 == ~tmp___4~0); {18267#true} is VALID [2022-04-28 08:35:51,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {18267#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); {18267#true} is VALID [2022-04-28 08:35:51,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {18267#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); {18267#true} is VALID [2022-04-28 08:35:51,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {18267#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18267#true} is VALID [2022-04-28 08:35:51,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {18267#true} ~skip~0 := 0; {18267#true} is VALID [2022-04-28 08:35:51,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {18267#true} assume !false; {18267#true} is VALID [2022-04-28 08:35:51,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {18267#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); {18267#true} is VALID [2022-04-28 08:35:51,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {18267#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-28 08:35:51,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {18267#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-28 08:35:51,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {18267#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-28 08:35:51,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {18267#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-28 08:35:51,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {18267#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-28 08:35:51,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {18267#true} assume 4368 == #t~mem54;havoc #t~mem54; {18267#true} is VALID [2022-04-28 08:35:51,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {18267#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; {18267#true} is VALID [2022-04-28 08:35:51,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {18267#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {18272#(= 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); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {18272#(= 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; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {18272#(= 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); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {18272#(= 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); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:35:51,594 INFO L290 TraceCheckUtils]: 51: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18268#false} is VALID [2022-04-28 08:35:51,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {18268#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {18268#false} is VALID [2022-04-28 08:35:51,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {18268#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,594 INFO L290 TraceCheckUtils]: 54: Hoare triple {18268#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {18268#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {18268#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); {18268#false} is VALID [2022-04-28 08:35:51,595 INFO L290 TraceCheckUtils]: 57: Hoare triple {18268#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18268#false} is VALID [2022-04-28 08:35:51,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {18268#false} ~skip~0 := 0; {18268#false} is VALID [2022-04-28 08:35:51,595 INFO L290 TraceCheckUtils]: 59: Hoare triple {18268#false} assume !false; {18268#false} is VALID [2022-04-28 08:35:51,595 INFO L290 TraceCheckUtils]: 60: Hoare triple {18268#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); {18268#false} is VALID [2022-04-28 08:35:51,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {18268#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {18268#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {18268#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {18268#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {18268#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {18268#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,596 INFO L290 TraceCheckUtils]: 67: Hoare triple {18268#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,596 INFO L290 TraceCheckUtils]: 68: Hoare triple {18268#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {18268#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {18268#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {18268#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,596 INFO L290 TraceCheckUtils]: 72: Hoare triple {18268#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,596 INFO L290 TraceCheckUtils]: 73: Hoare triple {18268#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-28 08:35:51,596 INFO L290 TraceCheckUtils]: 74: Hoare triple {18268#false} assume 4432 == #t~mem62;havoc #t~mem62; {18268#false} is VALID [2022-04-28 08:35:51,596 INFO L290 TraceCheckUtils]: 75: Hoare triple {18268#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {18268#false} is VALID [2022-04-28 08:35:51,599 INFO L290 TraceCheckUtils]: 76: Hoare triple {18268#false} assume 4 == ~blastFlag~0; {18268#false} is VALID [2022-04-28 08:35:51,599 INFO L290 TraceCheckUtils]: 77: Hoare triple {18268#false} assume !false; {18268#false} is VALID [2022-04-28 08:35:51,600 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-28 08:35:51,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:51,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523936525] [2022-04-28 08:35:51,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523936525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:51,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:51,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:35:51,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:51,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2109598304] [2022-04-28 08:35:51,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2109598304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:51,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:51,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:35:51,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714300552] [2022-04-28 08:35:51,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:51,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 08:35:51,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:51,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:51,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:51,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:35:51,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:51,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:35:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:35:51,665 INFO L87 Difference]: Start difference. First operand 396 states and 577 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:53,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:54,318 INFO L93 Difference]: Finished difference Result 687 states and 1003 transitions. [2022-04-28 08:35:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:35:54,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 08:35:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-28 08:35:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-28 08:35:54,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-28 08:35:54,628 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-28 08:35:54,640 INFO L225 Difference]: With dead ends: 687 [2022-04-28 08:35:54,640 INFO L226 Difference]: Without dead ends: 420 [2022-04-28 08:35:54,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:35:54,642 INFO L413 NwaCegarLoop]: 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-28 08:35:54,643 INFO L414 NwaCegarLoop]: 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-28 08:35:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-28 08:35:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-04-28 08:35:54,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:54,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:54,658 INFO L74 IsIncluded]: Start isIncluded. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:54,659 INFO L87 Difference]: Start difference. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:54,669 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-28 08:35:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-28 08:35:54,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:54,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:54,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-28 08:35:54,673 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-28 08:35:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:54,683 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-28 08:35:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-28 08:35:54,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:54,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:54,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:54,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 609 transitions. [2022-04-28 08:35:54,697 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 609 transitions. Word has length 78 [2022-04-28 08:35:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:54,697 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 609 transitions. [2022-04-28 08:35:54,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:54,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 420 states and 609 transitions. [2022-04-28 08:35:55,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-28 08:35:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 08:35:55,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:55,159 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:35:55,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:35:55,159 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:55,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1809534672, now seen corresponding path program 1 times [2022-04-28 08:35:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:55,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [90173983] [2022-04-28 08:35:55,160 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1809534672, now seen corresponding path program 2 times [2022-04-28 08:35:55,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:55,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44798566] [2022-04-28 08:35:55,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:55,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:55,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {21336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {21330#true} is VALID [2022-04-28 08:35:55,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {21330#true} assume true; {21330#true} is VALID [2022-04-28 08:35:55,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21330#true} {21330#true} #593#return; {21330#true} is VALID [2022-04-28 08:35:55,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {21330#true} call ULTIMATE.init(); {21336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:35:55,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {21336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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); {21330#true} is VALID [2022-04-28 08:35:55,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {21330#true} assume true; {21330#true} is VALID [2022-04-28 08:35:55,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21330#true} {21330#true} #593#return; {21330#true} is VALID [2022-04-28 08:35:55,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {21330#true} call #t~ret158 := main(); {21330#true} is VALID [2022-04-28 08:35:55,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {21330#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; {21330#true} is VALID [2022-04-28 08:35:55,331 INFO L272 TraceCheckUtils]: 6: Hoare triple {21330#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21330#true} is VALID [2022-04-28 08:35:55,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {21330#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; {21330#true} is VALID [2022-04-28 08:35:55,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {21330#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; {21330#true} is VALID [2022-04-28 08:35:55,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {21330#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21330#true} is VALID [2022-04-28 08:35:55,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-28 08:35:55,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {21330#true} assume 12292 == #t~mem49;havoc #t~mem49; {21330#true} is VALID [2022-04-28 08:35:55,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {21330#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; {21330#true} is VALID [2022-04-28 08:35:55,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {21330#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {21330#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21330#true} is VALID [2022-04-28 08:35:55,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {21330#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {21330#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {21330#true} is VALID [2022-04-28 08:35:55,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {21330#true} assume !(0 == ~tmp___4~0); {21330#true} is VALID [2022-04-28 08:35:55,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-28 08:35:55,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-28 08:35:55,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-28 08:35:55,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {21330#true} assume 4368 == #t~mem54;havoc #t~mem54; {21330#true} is VALID [2022-04-28 08:35:55,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {21330#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; {21330#true} is VALID [2022-04-28 08:35:55,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {21330#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21330#true} is VALID [2022-04-28 08:35:55,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {21330#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; {21330#true} is VALID [2022-04-28 08:35:55,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-28 08:35:55,335 INFO L290 TraceCheckUtils]: 39: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-28 08:35:55,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-28 08:35:55,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {21330#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {21330#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {21330#true} assume 4384 == #t~mem56;havoc #t~mem56; {21330#true} is VALID [2022-04-28 08:35:55,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {21330#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21330#true} is VALID [2022-04-28 08:35:55,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {21330#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21330#true} is VALID [2022-04-28 08:35:55,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {21330#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {21330#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {21330#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-28 08:35:55,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-28 08:35:55,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-28 08:35:55,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,337 INFO L290 TraceCheckUtils]: 65: Hoare triple {21330#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,337 INFO L290 TraceCheckUtils]: 66: Hoare triple {21330#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,337 INFO L290 TraceCheckUtils]: 67: Hoare triple {21330#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,337 INFO L290 TraceCheckUtils]: 68: Hoare triple {21330#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-28 08:35:55,338 INFO L290 TraceCheckUtils]: 69: Hoare triple {21330#true} assume 4400 == #t~mem58;havoc #t~mem58; {21330#true} is VALID [2022-04-28 08:35:55,338 INFO L290 TraceCheckUtils]: 70: Hoare triple {21330#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); {21330#true} is VALID [2022-04-28 08:35:55,338 INFO L290 TraceCheckUtils]: 71: Hoare triple {21330#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; {21330#true} is VALID [2022-04-28 08:35:55,338 INFO L290 TraceCheckUtils]: 72: Hoare triple {21330#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,339 INFO L290 TraceCheckUtils]: 73: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,339 INFO L290 TraceCheckUtils]: 74: Hoare triple {21335#(= 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); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,339 INFO L290 TraceCheckUtils]: 75: Hoare triple {21335#(= 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); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,340 INFO L290 TraceCheckUtils]: 76: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,340 INFO L290 TraceCheckUtils]: 77: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,340 INFO L290 TraceCheckUtils]: 78: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,341 INFO L290 TraceCheckUtils]: 79: Hoare triple {21335#(= 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); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,341 INFO L290 TraceCheckUtils]: 80: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,341 INFO L290 TraceCheckUtils]: 81: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,341 INFO L290 TraceCheckUtils]: 82: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,342 INFO L290 TraceCheckUtils]: 83: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,342 INFO L290 TraceCheckUtils]: 84: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,342 INFO L290 TraceCheckUtils]: 85: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,343 INFO L290 TraceCheckUtils]: 86: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,343 INFO L290 TraceCheckUtils]: 87: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,343 INFO L290 TraceCheckUtils]: 88: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,344 INFO L290 TraceCheckUtils]: 89: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,344 INFO L290 TraceCheckUtils]: 90: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,344 INFO L290 TraceCheckUtils]: 91: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,345 INFO L290 TraceCheckUtils]: 92: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,345 INFO L290 TraceCheckUtils]: 93: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,345 INFO L290 TraceCheckUtils]: 94: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:35:55,346 INFO L290 TraceCheckUtils]: 95: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {21331#false} is VALID [2022-04-28 08:35:55,346 INFO L290 TraceCheckUtils]: 96: Hoare triple {21331#false} assume !false; {21331#false} is VALID [2022-04-28 08:35:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 08:35:55,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:55,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44798566] [2022-04-28 08:35:55,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44798566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:55,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:55,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:35:55,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:55,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [90173983] [2022-04-28 08:35:55,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [90173983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:55,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:55,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:35:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772103665] [2022-04-28 08:35:55,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:55,348 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-28 08:35:55,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:55,348 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-28 08:35:55,409 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-28 08:35:55,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:35:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:55,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:35:55,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:35:55,411 INFO L87 Difference]: Start difference. First operand 420 states and 609 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:57,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:58,516 INFO L93 Difference]: Finished difference Result 842 states and 1230 transitions. [2022-04-28 08:35:58,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:35:58,516 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-28 08:35:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:58,517 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-28 08:35:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-28 08:35:58,520 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-28 08:35:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-28 08:35:58,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-28 08:35:58,865 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-28 08:35:58,878 INFO L225 Difference]: With dead ends: 842 [2022-04-28 08:35:58,879 INFO L226 Difference]: Without dead ends: 551 [2022-04-28 08:35:58,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:35:58,880 INFO L413 NwaCegarLoop]: 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-28 08:35:58,880 INFO L414 NwaCegarLoop]: 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-28 08:35:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-04-28 08:35:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2022-04-28 08:35:58,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:58,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:58,901 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:58,902 INFO L87 Difference]: Start difference. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:58,917 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-28 08:35:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-28 08:35:58,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:58,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:58,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-28 08:35:58,920 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-28 08:35:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:58,936 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-28 08:35:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-28 08:35:58,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:58,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:58,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:58,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 800 transitions. [2022-04-28 08:35:58,958 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 800 transitions. Word has length 97 [2022-04-28 08:35:58,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:58,958 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 800 transitions. [2022-04-28 08:35:58,959 INFO L496 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-28 08:35:58,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 800 transitions. [2022-04-28 08:35:59,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 800 edges. 800 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-28 08:35:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 08:35:59,584 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:59,584 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:35:59,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:35:59,585 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:59,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:59,585 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 1 times [2022-04-28 08:35:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:59,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [770634713] [2022-04-28 08:35:59,586 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 2 times [2022-04-28 08:35:59,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:59,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144964328] [2022-04-28 08:35:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 08:36:00,796 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 08:36:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 08:36:01,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 08:36:01,477 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 08:36:01,477 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 08:36:01,480 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 08:36:01,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:36:01,484 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 08:36:01,487 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 08:36:01,530 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 08:36:01,530 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 08:36:01,530 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-28 08:36:01,530 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 08:36:01,530 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-28 08:36:01,531 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1135-2 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1675-1 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-28 08:36:01,532 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1655 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-28 08:36:01,533 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1659-2 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1261 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1266-2 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-28 08:36:01,534 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-28 08:36:01,535 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1340-2 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1340-2 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1340 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1340 has no Hoare annotation [2022-04-28 08:36:01,536 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1624-1 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1360-2 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-28 08:36:01,537 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-28 08:36:01,538 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-28 08:36:01,539 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-28 08:36:01,540 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1453-2 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 08:36:01,541 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1512-1 has no Hoare annotation [2022-04-28 08:36:01,542 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1542-1 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-28 08:36:01,543 WARN L170 areAnnotationChecker]: L1255 has no Hoare annotation [2022-04-28 08:36:01,544 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-28 08:36:01,545 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-28 08:36:01,545 WARN L170 areAnnotationChecker]: L1558-2 has no Hoare annotation [2022-04-28 08:36:01,545 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-28 08:36:01,545 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-28 08:36:01,545 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-28 08:36:01,545 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-28 08:36:01,545 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-28 08:36:01,545 WARN L170 areAnnotationChecker]: L1570-2 has no Hoare annotation [2022-04-28 08:36:01,545 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-28 08:36:01,545 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-28 08:36:01,545 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 08:36:01,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 08:36:01 BoogieIcfgContainer [2022-04-28 08:36:01,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 08:36:01,549 INFO L158 Benchmark]: Toolchain (without parser) took 159603.48ms. Allocated memory was 195.0MB in the beginning and 348.1MB in the end (delta: 153.1MB). Free memory was 136.8MB in the beginning and 117.7MB in the end (delta: 19.1MB). Peak memory consumption was 182.2MB. Max. memory is 8.0GB. [2022-04-28 08:36:01,549 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:36:01,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.44ms. Allocated memory was 195.0MB in the beginning and 289.4MB in the end (delta: 94.4MB). Free memory was 136.6MB in the beginning and 243.2MB in the end (delta: -106.6MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-04-28 08:36:01,550 INFO L158 Benchmark]: Boogie Preprocessor took 145.84ms. Allocated memory is still 289.4MB. Free memory was 243.2MB in the beginning and 233.8MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 08:36:01,550 INFO L158 Benchmark]: RCFGBuilder took 2134.39ms. Allocated memory is still 289.4MB. Free memory was 233.8MB in the beginning and 228.3MB in the end (delta: 5.5MB). Peak memory consumption was 77.8MB. Max. memory is 8.0GB. [2022-04-28 08:36:01,573 INFO L158 Benchmark]: TraceAbstraction took 156606.70ms. Allocated memory was 289.4MB in the beginning and 348.1MB in the end (delta: 58.7MB). Free memory was 227.8MB in the beginning and 117.7MB in the end (delta: 110.1MB). Peak memory consumption was 178.8MB. Max. memory is 8.0GB. [2022-04-28 08:36:01,574 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 710.44ms. Allocated memory was 195.0MB in the beginning and 289.4MB in the end (delta: 94.4MB). Free memory was 136.6MB in the beginning and 243.2MB in the end (delta: -106.6MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 145.84ms. Allocated memory is still 289.4MB. Free memory was 243.2MB in the beginning and 233.8MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2134.39ms. Allocated memory is still 289.4MB. Free memory was 233.8MB in the beginning and 228.3MB in the end (delta: 5.5MB). Peak memory consumption was 77.8MB. Max. memory is 8.0GB. * TraceAbstraction took 156606.70ms. Allocated memory was 289.4MB in the beginning and 348.1MB in the end (delta: 58.7MB). Free memory was 227.8MB in the beginning and 117.7MB in the end (delta: 110.1MB). Peak memory consumption was 178.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1665]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1360. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) [L1271] EXPR s->version [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 [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 [L1346] COND FALSE !(ret <= 0) [L1351] s->hit [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 [L1356] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND TRUE s->state == 4400 [L1360] EXPR s->s3 [L1360] EXPR (s->s3)->tmp.new_cipher [L1360] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 [L1369] COND FALSE !(ret <= 0) [L1375] s->state = 4416 [L1376] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 [L1393] COND FALSE !(! tmp___6) [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 [L1665] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 156.5s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 37.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 754 SdHoareTripleChecker+Valid, 25.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 754 mSDsluCounter, 4674 SdHoareTripleChecker+Invalid, 25.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2487 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3549 IncrementalHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 2187 mSDtfsCounter, 3549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 378 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-28 08:36:01,595 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...