/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.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:31:43,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:31:43,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:31:43,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:31:43,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:31:43,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:31:43,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:31:43,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:31:43,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:31:43,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:31:43,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:31:43,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:31:43,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:31:43,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:31:43,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:31:43,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:31:43,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:31:43,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:31:43,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:31:43,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:31:43,286 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:31:43,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:31:43,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:31:43,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:31:43,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:31:43,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:31:43,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:31:43,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:31:43,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:31:43,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:31:43,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:31:43,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:31:43,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:31:43,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:31:43,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:31:43,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:31:43,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:31:43,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:31:43,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:31:43,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:31:43,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:31:43,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:31:43,297 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:31:43,302 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:31:43,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:31:43,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:31:43,303 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:31:43,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:31:43,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:31:43,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:31:43,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:31:43,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:31:43,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:31:43,304 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:31:43,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:31:43,305 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:31:43,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:31:43,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:31:43,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:31:43,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:31:43,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:31:43,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:31:43,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:31:43,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:31:43,305 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:31:43,305 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:31:43,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:31:43,306 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:31:43,306 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:31:43,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:31:43,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:31:43,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:31:43,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:31:43,500 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:31:43,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-04-08 08:31:43,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab6eca5e/1d25904780ff43cb8577ee78766e4e41/FLAG541f2d13e [2022-04-08 08:31:43,960 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:31:43,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-04-08 08:31:43,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab6eca5e/1d25904780ff43cb8577ee78766e4e41/FLAG541f2d13e [2022-04-08 08:31:44,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab6eca5e/1d25904780ff43cb8577ee78766e4e41 [2022-04-08 08:31:44,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:31:44,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:31:44,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:31:44,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:31:44,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:31:44,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:31:44" (1/1) ... [2022-04-08 08:31:44,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bbfd630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:44, skipping insertion in model container [2022-04-08 08:31:44,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:31:44" (1/1) ... [2022-04-08 08:31:44,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:31:44,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:31:44,668 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.01.i.cil-2.c[65520,65533] [2022-04-08 08:31:44,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:31:44,687 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:31:44,774 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.01.i.cil-2.c[65520,65533] [2022-04-08 08:31:44,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:31:44,814 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:31:44,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:44 WrapperNode [2022-04-08 08:31:44,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:31:44,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:31:44,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:31:44,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:31:44,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:44" (1/1) ... [2022-04-08 08:31:44,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:44" (1/1) ... [2022-04-08 08:31:44,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:44" (1/1) ... [2022-04-08 08:31:44,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:44" (1/1) ... [2022-04-08 08:31:44,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:44" (1/1) ... [2022-04-08 08:31:44,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:44" (1/1) ... [2022-04-08 08:31:44,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:44" (1/1) ... [2022-04-08 08:31:44,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:31:44,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:31:44,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:31:44,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:31:44,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:44" (1/1) ... [2022-04-08 08:31:44,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:31:44,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:31:44,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:31:44,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:31:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:31:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:31:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:31:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-08 08:31:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-08 08:31:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:31:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-08 08:31:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:31:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:31:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:31:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:31:44,994 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:31:44,994 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:31:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:31:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:31:45,154 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:31:45,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:31:46,327 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:31:46,714 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-08 08:31:46,715 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-08 08:31:46,724 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:31:46,730 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:31:46,730 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:31:46,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:31:46 BoogieIcfgContainer [2022-04-08 08:31:46,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:31:46,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:31:46,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:31:46,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:31:46,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:31:44" (1/3) ... [2022-04-08 08:31:46,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685bc489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:31:46, skipping insertion in model container [2022-04-08 08:31:46,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:44" (2/3) ... [2022-04-08 08:31:46,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685bc489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:31:46, skipping insertion in model container [2022-04-08 08:31:46,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:31:46" (3/3) ... [2022-04-08 08:31:46,736 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-04-08 08:31:46,739 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:31:46,740 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:31:46,766 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:31:46,770 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:31:46,770 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:31:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:31:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:31:46,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:31:46,790 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:31:46,790 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:31:46,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:31:46,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 1 times [2022-04-08 08:31:46,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:46,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1095831399] [2022-04-08 08:31:46,806 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:31:46,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 2 times [2022-04-08 08:31:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:31:46,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162659185] [2022-04-08 08:31:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:31:46,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:31:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:31:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:47,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#(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); {143#true} is VALID [2022-04-08 08:31:47,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-08 08:31:47,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-08 08:31:47,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:31:47,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#(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); {143#true} is VALID [2022-04-08 08:31:47,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-08 08:31:47,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-08 08:31:47,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-08 08:31:47,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#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; {143#true} is VALID [2022-04-08 08:31:47,199 INFO L272 TraceCheckUtils]: 6: Hoare triple {143#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {143#true} is VALID [2022-04-08 08:31:47,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:47,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:47,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:47,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(= 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)))); {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:47,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:47,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {149#(= 12292 |ssl3_connect_#t~mem43|)} is VALID [2022-04-08 08:31:47,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#(= 12292 |ssl3_connect_#t~mem43|)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {144#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {144#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {144#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {144#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {144#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {144#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {144#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {144#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {144#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {144#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {144#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {144#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:47,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {144#false} assume 4432 == #t~mem56;havoc #t~mem56; {144#false} is VALID [2022-04-08 08:31:47,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {144#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {144#false} is VALID [2022-04-08 08:31:47,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {144#false} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-08 08:31:47,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-08 08:31:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:31:47,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:31:47,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162659185] [2022-04-08 08:31:47,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162659185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:47,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:47,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:31:47,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:31:47,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1095831399] [2022-04-08 08:31:47,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1095831399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:47,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:47,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:31:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624518218] [2022-04-08 08:31:47,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:31:47,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:31:47,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:31:47,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:47,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:47,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:31:47,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:47,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:31:47,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:31:47,283 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:49,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:50,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:50,376 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2022-04-08 08:31:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:31:50,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:31:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:31:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-08 08:31:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-08 08:31:50,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 444 transitions. [2022-04-08 08:31:50,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:50,707 INFO L225 Difference]: With dead ends: 271 [2022-04-08 08:31:50,707 INFO L226 Difference]: Without dead ends: 124 [2022-04-08 08:31:50,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:31:50,725 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:31:50,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 558 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:31:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-08 08:31:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-04-08 08:31:50,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:31:50,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:50,762 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:50,763 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:50,779 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-08 08:31:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-08 08:31:50,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:50,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:50,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 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 124 states. [2022-04-08 08:31:50,781 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 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 124 states. [2022-04-08 08:31:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:50,790 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-08 08:31:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-08 08:31:50,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:50,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:50,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:31:50,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:31:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2022-04-08 08:31:50,800 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 30 [2022-04-08 08:31:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:31:50,800 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2022-04-08 08:31:50,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:50,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 180 transitions. [2022-04-08 08:31:50,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2022-04-08 08:31:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 08:31:50,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:31:50,930 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:31:50,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:31:50,930 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:31:50,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:31:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1834539841, now seen corresponding path program 1 times [2022-04-08 08:31:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:50,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [198210613] [2022-04-08 08:31:50,931 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:31:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1834539841, now seen corresponding path program 2 times [2022-04-08 08:31:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:31:50,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355851721] [2022-04-08 08:31:50,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:31:50,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:31:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:31:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:51,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {1197#(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); {1191#true} is VALID [2022-04-08 08:31:51,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-08 08:31:51,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1191#true} {1191#true} #591#return; {1191#true} is VALID [2022-04-08 08:31:51,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1197#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:31:51,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#(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); {1191#true} is VALID [2022-04-08 08:31:51,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-08 08:31:51,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #591#return; {1191#true} is VALID [2022-04-08 08:31:51,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret159 := main(); {1191#true} is VALID [2022-04-08 08:31:51,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#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; {1191#true} is VALID [2022-04-08 08:31:51,098 INFO L272 TraceCheckUtils]: 6: Hoare triple {1191#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1191#true} is VALID [2022-04-08 08:31:51,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {1196#(= 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)))); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem43;havoc #t~mem43; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {1196#(= 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~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem56;havoc #t~mem56; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:51,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1192#false} is VALID [2022-04-08 08:31:51,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-08 08:31:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:31:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:31:51,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355851721] [2022-04-08 08:31:51,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355851721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:51,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:51,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:31:51,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:31:51,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [198210613] [2022-04-08 08:31:51,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [198210613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:51,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:51,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:31:51,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708673647] [2022-04-08 08:31:51,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:31:51,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 08:31:51,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:31:51,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:51,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:51,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:31:51,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:31:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:31:51,170 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:53,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:53,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:53,741 INFO L93 Difference]: Finished difference Result 333 states and 496 transitions. [2022-04-08 08:31:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:31:53,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 08:31:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:31:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-08 08:31:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-08 08:31:53,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-08 08:31:54,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:54,067 INFO L225 Difference]: With dead ends: 333 [2022-04-08 08:31:54,067 INFO L226 Difference]: Without dead ends: 226 [2022-04-08 08:31:54,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:31:54,069 INFO L913 BasicCegarLoop]: 168 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:31:54,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 323 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:31:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-08 08:31:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-04-08 08:31:54,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:31:54,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:54,081 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:54,081 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:54,088 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-08 08:31:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-08 08:31:54,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:54,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:54,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 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 226 states. [2022-04-08 08:31:54,090 INFO L87 Difference]: Start difference. First operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 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 226 states. [2022-04-08 08:31:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:54,096 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-08 08:31:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-08 08:31:54,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:54,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:54,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:31:54,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:31:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 330 transitions. [2022-04-08 08:31:54,104 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 330 transitions. Word has length 45 [2022-04-08 08:31:54,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:31:54,104 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 330 transitions. [2022-04-08 08:31:54,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:54,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 330 transitions. [2022-04-08 08:31:54,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-08 08:31:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 08:31:54,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:31:54,322 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:31:54,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:31:54,323 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:31:54,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:31:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash 943673003, now seen corresponding path program 1 times [2022-04-08 08:31:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:54,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [935519013] [2022-04-08 08:31:54,324 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:31:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash 943673003, now seen corresponding path program 2 times [2022-04-08 08:31:54,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:31:54,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758706564] [2022-04-08 08:31:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:31:54,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:31:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:54,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:31:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:54,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {2777#(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); {2770#true} is VALID [2022-04-08 08:31:54,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {2770#true} assume true; {2770#true} is VALID [2022-04-08 08:31:54,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2770#true} {2770#true} #591#return; {2770#true} is VALID [2022-04-08 08:31:54,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {2770#true} call ULTIMATE.init(); {2777#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:31:54,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#(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); {2770#true} is VALID [2022-04-08 08:31:54,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {2770#true} assume true; {2770#true} is VALID [2022-04-08 08:31:54,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2770#true} {2770#true} #591#return; {2770#true} is VALID [2022-04-08 08:31:54,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {2770#true} call #t~ret159 := main(); {2770#true} is VALID [2022-04-08 08:31:54,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {2770#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; {2770#true} is VALID [2022-04-08 08:31:54,512 INFO L272 TraceCheckUtils]: 6: Hoare triple {2770#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2770#true} is VALID [2022-04-08 08:31:54,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {2770#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {2770#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {2770#true} is VALID [2022-04-08 08:31:54,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {2770#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {2770#true} is VALID [2022-04-08 08:31:54,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {2770#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2770#true} is VALID [2022-04-08 08:31:54,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {2770#true} assume !false; {2770#true} is VALID [2022-04-08 08:31:54,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {2770#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {2770#true} assume 12292 == #t~mem43;havoc #t~mem43; {2770#true} is VALID [2022-04-08 08:31:54,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {2770#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {2770#true} is VALID [2022-04-08 08:31:54,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {2770#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {2770#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2770#true} is VALID [2022-04-08 08:31:54,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {2770#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {2770#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {2770#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {2770#true} is VALID [2022-04-08 08:31:54,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {2770#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {2770#true} is VALID [2022-04-08 08:31:54,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {2770#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {2770#true} is VALID [2022-04-08 08:31:54,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {2770#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {2770#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {2770#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {2770#true} is VALID [2022-04-08 08:31:54,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {2770#true} ~skip~0 := 0; {2770#true} is VALID [2022-04-08 08:31:54,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {2770#true} assume !false; {2770#true} is VALID [2022-04-08 08:31:54,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {2770#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {2770#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {2770#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {2770#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {2770#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {2770#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:54,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {2770#true} assume 4368 == #t~mem48;havoc #t~mem48; {2770#true} is VALID [2022-04-08 08:31:54,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {2770#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {2770#true} is VALID [2022-04-08 08:31:54,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {2770#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2770#true} is VALID [2022-04-08 08:31:54,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {2770#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,530 INFO L290 TraceCheckUtils]: 47: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:54,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2776#(= |ssl3_connect_#t~mem50| 4384)} is VALID [2022-04-08 08:31:54,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {2776#(= |ssl3_connect_#t~mem50| 4384)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:54,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {2771#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:54,531 INFO L290 TraceCheckUtils]: 52: Hoare triple {2771#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:54,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {2771#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:54,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {2771#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:54,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {2771#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:54,531 INFO L290 TraceCheckUtils]: 56: Hoare triple {2771#false} assume 4432 == #t~mem56;havoc #t~mem56; {2771#false} is VALID [2022-04-08 08:31:54,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {2771#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {2771#false} is VALID [2022-04-08 08:31:54,532 INFO L290 TraceCheckUtils]: 58: Hoare triple {2771#false} assume 5 == ~blastFlag~0; {2771#false} is VALID [2022-04-08 08:31:54,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {2771#false} assume !false; {2771#false} is VALID [2022-04-08 08:31:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:31:54,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:31:54,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758706564] [2022-04-08 08:31:54,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758706564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:54,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:54,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:31:54,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:31:54,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [935519013] [2022-04-08 08:31:54,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [935519013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:54,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:54,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:31:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272087577] [2022-04-08 08:31:54,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:31:54,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-08 08:31:54,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:31:54,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:54,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:54,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:31:54,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:54,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:31:54,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:31:54,576 INFO L87 Difference]: Start difference. First operand 226 states and 330 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:56,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:57,550 INFO L93 Difference]: Finished difference Result 368 states and 543 transitions. [2022-04-08 08:31:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:31:57,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-08 08:31:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:31:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-08 08:31:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-08 08:31:57,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 390 transitions. [2022-04-08 08:31:57,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:57,819 INFO L225 Difference]: With dead ends: 368 [2022-04-08 08:31:57,819 INFO L226 Difference]: Without dead ends: 261 [2022-04-08 08:31:57,819 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:31:57,820 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:31:57,820 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 490 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:31:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-08 08:31:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 244. [2022-04-08 08:31:57,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:31:57,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:57,830 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:57,830 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:57,836 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-08 08:31:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-08 08:31:57,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:57,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:57,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 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 261 states. [2022-04-08 08:31:57,838 INFO L87 Difference]: Start difference. First operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 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 261 states. [2022-04-08 08:31:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:57,843 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-08 08:31:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-08 08:31:57,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:57,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:57,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:31:57,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:31:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 360 transitions. [2022-04-08 08:31:57,850 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 360 transitions. Word has length 60 [2022-04-08 08:31:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:31:57,850 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 360 transitions. [2022-04-08 08:31:57,850 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:57,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 360 transitions. [2022-04-08 08:31:58,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 360 transitions. [2022-04-08 08:31:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 08:31:58,082 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:31:58,082 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:31:58,082 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:31:58,082 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:31:58,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:31:58,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1523273022, now seen corresponding path program 3 times [2022-04-08 08:31:58,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:58,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [920777820] [2022-04-08 08:32:07,008 WARN L232 SmtUtils]: Spent 8.92s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:32:15,094 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:32:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1523273022, now seen corresponding path program 4 times [2022-04-08 08:32:15,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:32:15,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634959817] [2022-04-08 08:32:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:32:15,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:32:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:15,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:32:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:15,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {4535#(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); {4528#true} is VALID [2022-04-08 08:32:15,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {4528#true} assume true; {4528#true} is VALID [2022-04-08 08:32:15,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4528#true} {4528#true} #591#return; {4528#true} is VALID [2022-04-08 08:32:15,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {4528#true} call ULTIMATE.init(); {4535#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:32:15,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#(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); {4528#true} is VALID [2022-04-08 08:32:15,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {4528#true} assume true; {4528#true} is VALID [2022-04-08 08:32:15,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4528#true} {4528#true} #591#return; {4528#true} is VALID [2022-04-08 08:32:15,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {4528#true} call #t~ret159 := main(); {4528#true} is VALID [2022-04-08 08:32:15,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {4528#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; {4528#true} is VALID [2022-04-08 08:32:15,270 INFO L272 TraceCheckUtils]: 6: Hoare triple {4528#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4528#true} is VALID [2022-04-08 08:32:15,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {4528#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {4528#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {4528#true} is VALID [2022-04-08 08:32:15,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {4528#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {4528#true} is VALID [2022-04-08 08:32:15,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {4528#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4528#true} is VALID [2022-04-08 08:32:15,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {4528#true} assume !false; {4528#true} is VALID [2022-04-08 08:32:15,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {4528#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {4528#true} assume 12292 == #t~mem43;havoc #t~mem43; {4528#true} is VALID [2022-04-08 08:32:15,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {4528#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {4528#true} is VALID [2022-04-08 08:32:15,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {4528#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {4528#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4528#true} is VALID [2022-04-08 08:32:15,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {4528#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {4528#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {4528#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {4528#true} is VALID [2022-04-08 08:32:15,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {4528#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {4528#true} is VALID [2022-04-08 08:32:15,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {4528#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {4528#true} is VALID [2022-04-08 08:32:15,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {4528#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {4528#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {4528#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4528#true} is VALID [2022-04-08 08:32:15,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {4528#true} ~skip~0 := 0; {4528#true} is VALID [2022-04-08 08:32:15,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {4528#true} assume !false; {4528#true} is VALID [2022-04-08 08:32:15,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {4528#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {4528#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {4528#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {4528#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {4528#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {4528#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:15,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {4528#true} assume 4368 == #t~mem48;havoc #t~mem48; {4528#true} is VALID [2022-04-08 08:32:15,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {4528#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {4528#true} is VALID [2022-04-08 08:32:15,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {4528#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4528#true} is VALID [2022-04-08 08:32:15,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {4528#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:15,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:15,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:15,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:15,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:15,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:15,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4534#(not (= 12292 |ssl3_connect_#t~mem43|))} is VALID [2022-04-08 08:32:15,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {4534#(not (= 12292 |ssl3_connect_#t~mem43|))} assume 12292 == #t~mem43;havoc #t~mem43; {4529#false} is VALID [2022-04-08 08:32:15,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {4529#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {4529#false} is VALID [2022-04-08 08:32:15,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {4529#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {4529#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4529#false} is VALID [2022-04-08 08:32:15,276 INFO L290 TraceCheckUtils]: 47: Hoare triple {4529#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,276 INFO L290 TraceCheckUtils]: 48: Hoare triple {4529#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,277 INFO L290 TraceCheckUtils]: 49: Hoare triple {4529#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {4529#false} is VALID [2022-04-08 08:32:15,277 INFO L290 TraceCheckUtils]: 50: Hoare triple {4529#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {4529#false} is VALID [2022-04-08 08:32:15,277 INFO L290 TraceCheckUtils]: 51: Hoare triple {4529#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {4529#false} is VALID [2022-04-08 08:32:15,277 INFO L290 TraceCheckUtils]: 52: Hoare triple {4529#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,277 INFO L290 TraceCheckUtils]: 53: Hoare triple {4529#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {4529#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4529#false} is VALID [2022-04-08 08:32:15,277 INFO L290 TraceCheckUtils]: 55: Hoare triple {4529#false} ~skip~0 := 0; {4529#false} is VALID [2022-04-08 08:32:15,277 INFO L290 TraceCheckUtils]: 56: Hoare triple {4529#false} assume !false; {4529#false} is VALID [2022-04-08 08:32:15,277 INFO L290 TraceCheckUtils]: 57: Hoare triple {4529#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {4529#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {4529#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,278 INFO L290 TraceCheckUtils]: 60: Hoare triple {4529#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {4529#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,278 INFO L290 TraceCheckUtils]: 62: Hoare triple {4529#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,278 INFO L290 TraceCheckUtils]: 63: Hoare triple {4529#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,278 INFO L290 TraceCheckUtils]: 64: Hoare triple {4529#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {4529#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,278 INFO L290 TraceCheckUtils]: 66: Hoare triple {4529#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,278 INFO L290 TraceCheckUtils]: 67: Hoare triple {4529#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,278 INFO L290 TraceCheckUtils]: 68: Hoare triple {4529#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,278 INFO L290 TraceCheckUtils]: 69: Hoare triple {4529#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,278 INFO L290 TraceCheckUtils]: 70: Hoare triple {4529#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:15,279 INFO L290 TraceCheckUtils]: 71: Hoare triple {4529#false} assume 4432 == #t~mem56;havoc #t~mem56; {4529#false} is VALID [2022-04-08 08:32:15,279 INFO L290 TraceCheckUtils]: 72: Hoare triple {4529#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {4529#false} is VALID [2022-04-08 08:32:15,279 INFO L290 TraceCheckUtils]: 73: Hoare triple {4529#false} assume 5 == ~blastFlag~0; {4529#false} is VALID [2022-04-08 08:32:15,279 INFO L290 TraceCheckUtils]: 74: Hoare triple {4529#false} assume !false; {4529#false} is VALID [2022-04-08 08:32:15,279 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-08 08:32:15,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:32:15,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634959817] [2022-04-08 08:32:15,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634959817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:32:15,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:32:15,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:32:15,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:32:15,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [920777820] [2022-04-08 08:32:15,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [920777820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:32:15,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:32:15,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:32:15,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218548511] [2022-04-08 08:32:15,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:32:15,280 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-08 08:32:15,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:32:15,281 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-08 08:32:15,341 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-08 08:32:15,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:32:15,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:32:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:32:15,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:32:15,342 INFO L87 Difference]: Start difference. First operand 244 states and 360 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-08 08:32:17,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:18,318 INFO L93 Difference]: Finished difference Result 655 states and 976 transitions. [2022-04-08 08:32:18,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:32:18,318 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-08 08:32:18,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:32:18,318 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-08 08:32:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 08:32:18,322 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-08 08:32:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 08:32:18,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-08 08:32:18,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:18,664 INFO L225 Difference]: With dead ends: 655 [2022-04-08 08:32:18,664 INFO L226 Difference]: Without dead ends: 427 [2022-04-08 08:32:18,665 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:32:18,665 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 113 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:32:18,665 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 302 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 381 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:32:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-08 08:32:18,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 266. [2022-04-08 08:32:18,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:32:18,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:18,682 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:18,682 INFO L87 Difference]: Start difference. First operand 427 states. Second operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:18,692 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2022-04-08 08:32:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2022-04-08 08:32:18,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:32:18,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:32:18,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 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 427 states. [2022-04-08 08:32:18,694 INFO L87 Difference]: Start difference. First operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 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 427 states. [2022-04-08 08:32:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:18,704 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2022-04-08 08:32:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2022-04-08 08:32:18,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:32:18,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:32:18,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:32:18,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:32:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 391 transitions. [2022-04-08 08:32:18,712 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 391 transitions. Word has length 75 [2022-04-08 08:32:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:32:18,712 INFO L478 AbstractCegarLoop]: Abstraction has 266 states and 391 transitions. [2022-04-08 08:32:18,713 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:18,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 266 states and 391 transitions. [2022-04-08 08:32:18,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 391 transitions. [2022-04-08 08:32:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 08:32:18,990 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:32:18,990 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:32:18,990 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:32:18,990 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:32:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:32:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1541928480, now seen corresponding path program 1 times [2022-04-08 08:32:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:32:18,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2131752596] [2022-04-08 08:32:35,442 WARN L232 SmtUtils]: Spent 11.47s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:32:44,856 WARN L232 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:32:45,628 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:32:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1541928480, now seen corresponding path program 2 times [2022-04-08 08:32:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:32:45,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95910757] [2022-04-08 08:32:45,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:32:45,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:32:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:45,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:32:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:45,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {7243#(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); {7236#true} is VALID [2022-04-08 08:32:45,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {7236#true} assume true; {7236#true} is VALID [2022-04-08 08:32:45,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7236#true} {7236#true} #591#return; {7236#true} is VALID [2022-04-08 08:32:45,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {7236#true} call ULTIMATE.init(); {7243#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:32:45,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {7243#(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); {7236#true} is VALID [2022-04-08 08:32:45,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {7236#true} assume true; {7236#true} is VALID [2022-04-08 08:32:45,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7236#true} {7236#true} #591#return; {7236#true} is VALID [2022-04-08 08:32:45,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {7236#true} call #t~ret159 := main(); {7236#true} is VALID [2022-04-08 08:32:45,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {7236#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; {7236#true} is VALID [2022-04-08 08:32:45,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {7236#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7236#true} is VALID [2022-04-08 08:32:45,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {7236#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {7236#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {7236#true} is VALID [2022-04-08 08:32:45,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {7236#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {7236#true} is VALID [2022-04-08 08:32:45,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {7236#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7236#true} is VALID [2022-04-08 08:32:45,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {7236#true} assume !false; {7236#true} is VALID [2022-04-08 08:32:45,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {7236#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {7236#true} assume 12292 == #t~mem43;havoc #t~mem43; {7236#true} is VALID [2022-04-08 08:32:45,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {7236#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {7236#true} is VALID [2022-04-08 08:32:45,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {7236#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {7236#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7236#true} is VALID [2022-04-08 08:32:45,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {7236#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {7236#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {7236#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {7236#true} is VALID [2022-04-08 08:32:45,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {7236#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {7236#true} is VALID [2022-04-08 08:32:45,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {7236#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {7236#true} is VALID [2022-04-08 08:32:45,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {7236#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {7236#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {7236#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7236#true} is VALID [2022-04-08 08:32:45,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {7236#true} ~skip~0 := 0; {7236#true} is VALID [2022-04-08 08:32:45,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {7236#true} assume !false; {7236#true} is VALID [2022-04-08 08:32:45,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {7236#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {7236#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {7236#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {7236#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {7236#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {7236#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:45,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {7236#true} assume 4368 == #t~mem48;havoc #t~mem48; {7236#true} is VALID [2022-04-08 08:32:45,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {7236#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {7236#true} is VALID [2022-04-08 08:32:45,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {7236#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7236#true} is VALID [2022-04-08 08:32:45,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {7236#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:45,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:45,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:45,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:45,842 INFO L290 TraceCheckUtils]: 40: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:45,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:45,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:45,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7242#(not (= |ssl3_connect_#t~mem44| 16384))} is VALID [2022-04-08 08:32:45,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {7242#(not (= |ssl3_connect_#t~mem44| 16384))} assume 16384 == #t~mem44;havoc #t~mem44; {7237#false} is VALID [2022-04-08 08:32:45,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {7237#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {7237#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7237#false} is VALID [2022-04-08 08:32:45,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {7237#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,844 INFO L290 TraceCheckUtils]: 48: Hoare triple {7237#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {7237#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {7237#false} is VALID [2022-04-08 08:32:45,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {7237#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {7237#false} is VALID [2022-04-08 08:32:45,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {7237#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {7237#false} is VALID [2022-04-08 08:32:45,844 INFO L290 TraceCheckUtils]: 52: Hoare triple {7237#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,844 INFO L290 TraceCheckUtils]: 53: Hoare triple {7237#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,844 INFO L290 TraceCheckUtils]: 54: Hoare triple {7237#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 55: Hoare triple {7237#false} ~skip~0 := 0; {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 56: Hoare triple {7237#false} assume !false; {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 57: Hoare triple {7237#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 58: Hoare triple {7237#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 59: Hoare triple {7237#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {7237#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {7237#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {7237#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 63: Hoare triple {7237#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 64: Hoare triple {7237#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {7237#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 66: Hoare triple {7237#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,845 INFO L290 TraceCheckUtils]: 67: Hoare triple {7237#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,846 INFO L290 TraceCheckUtils]: 68: Hoare triple {7237#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,846 INFO L290 TraceCheckUtils]: 69: Hoare triple {7237#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,846 INFO L290 TraceCheckUtils]: 70: Hoare triple {7237#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:45,846 INFO L290 TraceCheckUtils]: 71: Hoare triple {7237#false} assume 4432 == #t~mem56;havoc #t~mem56; {7237#false} is VALID [2022-04-08 08:32:45,846 INFO L290 TraceCheckUtils]: 72: Hoare triple {7237#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {7237#false} is VALID [2022-04-08 08:32:45,846 INFO L290 TraceCheckUtils]: 73: Hoare triple {7237#false} assume 5 == ~blastFlag~0; {7237#false} is VALID [2022-04-08 08:32:45,846 INFO L290 TraceCheckUtils]: 74: Hoare triple {7237#false} assume !false; {7237#false} is VALID [2022-04-08 08:32:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:32:45,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:32:45,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95910757] [2022-04-08 08:32:45,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95910757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:32:45,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:32:45,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:32:45,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:32:45,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2131752596] [2022-04-08 08:32:45,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2131752596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:32:45,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:32:45,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:32:45,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101867906] [2022-04-08 08:32:45,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:32:45,851 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-08 08:32:45,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:32:45,851 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-08 08:32:45,943 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-08 08:32:45,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:32:45,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:32:45,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:32:45,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:32:45,944 INFO L87 Difference]: Start difference. First operand 266 states and 391 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-08 08:32:47,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:48,926 INFO L93 Difference]: Finished difference Result 678 states and 1005 transitions. [2022-04-08 08:32:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:32:48,926 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-08 08:32:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:32:48,927 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-08 08:32:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-08 08:32:48,929 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-08 08:32:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-08 08:32:48,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-08 08:32:49,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:49,269 INFO L225 Difference]: With dead ends: 678 [2022-04-08 08:32:49,270 INFO L226 Difference]: Without dead ends: 428 [2022-04-08 08:32:49,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:32:49,271 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 120 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:32:49,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:32:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-04-08 08:32:49,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 268. [2022-04-08 08:32:49,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:32:49,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:49,293 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:49,294 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:49,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:49,316 INFO L93 Difference]: Finished difference Result 428 states and 631 transitions. [2022-04-08 08:32:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2022-04-08 08:32:49,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:32:49,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:32:49,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 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 428 states. [2022-04-08 08:32:49,318 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 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 428 states. [2022-04-08 08:32:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:49,327 INFO L93 Difference]: Finished difference Result 428 states and 631 transitions. [2022-04-08 08:32:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2022-04-08 08:32:49,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:32:49,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:32:49,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:32:49,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:32:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 392 transitions. [2022-04-08 08:32:49,333 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 392 transitions. Word has length 75 [2022-04-08 08:32:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:32:49,333 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 392 transitions. [2022-04-08 08:32:49,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:49,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 392 transitions. [2022-04-08 08:32:49,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 392 transitions. [2022-04-08 08:32:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 08:32:49,622 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:32:49,622 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 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-08 08:32:49,622 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:32:49,623 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:32:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:32:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1572013375, now seen corresponding path program 1 times [2022-04-08 08:32:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:32:49,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1376549290] [2022-04-08 08:33:05,641 WARN L232 SmtUtils]: Spent 10.40s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:33:14,486 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:33:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1572013375, now seen corresponding path program 2 times [2022-04-08 08:33:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:33:14,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252088788] [2022-04-08 08:33:14,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:33:14,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:33:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:14,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:33:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:14,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {10003#(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); {9996#true} is VALID [2022-04-08 08:33:14,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-04-08 08:33:14,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9996#true} {9996#true} #591#return; {9996#true} is VALID [2022-04-08 08:33:14,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {9996#true} call ULTIMATE.init(); {10003#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:33:14,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {10003#(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); {9996#true} is VALID [2022-04-08 08:33:14,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-04-08 08:33:14,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9996#true} {9996#true} #591#return; {9996#true} is VALID [2022-04-08 08:33:14,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {9996#true} call #t~ret159 := main(); {9996#true} is VALID [2022-04-08 08:33:14,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {9996#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; {9996#true} is VALID [2022-04-08 08:33:14,675 INFO L272 TraceCheckUtils]: 6: Hoare triple {9996#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9996#true} is VALID [2022-04-08 08:33:14,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {9996#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {9996#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {9996#true} is VALID [2022-04-08 08:33:14,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {9996#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {9996#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {9996#true} assume !false; {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {9996#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {9996#true} assume 12292 == #t~mem43;havoc #t~mem43; {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {9996#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {9996#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {9996#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {9996#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {9996#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {9996#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {9996#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {9996#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {9996#true} is VALID [2022-04-08 08:33:14,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {9996#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {9996#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {9996#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {9996#true} ~skip~0 := 0; {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {9996#true} assume !false; {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {9996#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {9996#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {9996#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {9996#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {9996#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {9996#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {9996#true} assume 4368 == #t~mem48;havoc #t~mem48; {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {9996#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {9996#true} is VALID [2022-04-08 08:33:14,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {9996#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9996#true} is VALID [2022-04-08 08:33:14,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {9996#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:14,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:14,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:14,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:14,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:14,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:14,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:14,681 INFO L290 TraceCheckUtils]: 43: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:14,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {10002#(= |ssl3_connect_#t~mem45| 4384)} is VALID [2022-04-08 08:33:14,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {10002#(= |ssl3_connect_#t~mem45| 4384)} assume 4096 == #t~mem45;havoc #t~mem45; {9997#false} is VALID [2022-04-08 08:33:14,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {9997#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,686 INFO L290 TraceCheckUtils]: 47: Hoare triple {9997#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9997#false} is VALID [2022-04-08 08:33:14,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {9997#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {9997#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,686 INFO L290 TraceCheckUtils]: 50: Hoare triple {9997#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {9997#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {9997#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {9997#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {9997#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 55: Hoare triple {9997#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {9997#false} ~skip~0 := 0; {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {9997#false} assume !false; {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {9997#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {9997#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {9997#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {9997#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 62: Hoare triple {9997#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {9997#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,688 INFO L290 TraceCheckUtils]: 64: Hoare triple {9997#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {9997#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {9997#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,688 INFO L290 TraceCheckUtils]: 67: Hoare triple {9997#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {9997#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {9997#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {9997#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,688 INFO L290 TraceCheckUtils]: 71: Hoare triple {9997#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:14,688 INFO L290 TraceCheckUtils]: 72: Hoare triple {9997#false} assume 4432 == #t~mem56;havoc #t~mem56; {9997#false} is VALID [2022-04-08 08:33:14,690 INFO L290 TraceCheckUtils]: 73: Hoare triple {9997#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {9997#false} is VALID [2022-04-08 08:33:14,690 INFO L290 TraceCheckUtils]: 74: Hoare triple {9997#false} assume 5 == ~blastFlag~0; {9997#false} is VALID [2022-04-08 08:33:14,690 INFO L290 TraceCheckUtils]: 75: Hoare triple {9997#false} assume !false; {9997#false} is VALID [2022-04-08 08:33:14,691 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-08 08:33:14,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:33:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252088788] [2022-04-08 08:33:14,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252088788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:14,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:14,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:33:14,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:33:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1376549290] [2022-04-08 08:33:14,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1376549290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:14,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:14,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:33:14,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780581041] [2022-04-08 08:33:14,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:33:14,692 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-08 08:33:14,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:33:14,692 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-08 08:33:14,750 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-08 08:33:14,750 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:33:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:14,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:33:14,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:33:14,751 INFO L87 Difference]: Start difference. First operand 268 states and 392 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-08 08:33:16,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:17,662 INFO L93 Difference]: Finished difference Result 421 states and 618 transitions. [2022-04-08 08:33:17,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:33:17,662 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-08 08:33:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:33:17,662 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-08 08:33:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-08 08:33:17,665 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-08 08:33:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-08 08:33:17,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-08 08:33:17,920 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-08 08:33:17,923 INFO L225 Difference]: With dead ends: 421 [2022-04-08 08:33:17,923 INFO L226 Difference]: Without dead ends: 284 [2022-04-08 08:33:17,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:33:17,924 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:33:17,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:33:17,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-08 08:33:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-08 08:33:17,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:33:17,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:17,934 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:17,934 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:17,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:17,939 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2022-04-08 08:33:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2022-04-08 08:33:17,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:17,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:17,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 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 284 states. [2022-04-08 08:33:17,940 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 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 284 states. [2022-04-08 08:33:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:17,944 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2022-04-08 08:33:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2022-04-08 08:33:17,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:17,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:17,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:33:17,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:33:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 391 transitions. [2022-04-08 08:33:17,950 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 391 transitions. Word has length 76 [2022-04-08 08:33:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:33:17,950 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 391 transitions. [2022-04-08 08:33:17,950 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:17,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 391 transitions. [2022-04-08 08:33:18,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 391 transitions. [2022-04-08 08:33:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 08:33:18,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:33:18,230 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 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-08 08:33:18,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:33:18,230 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:33:18,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:33:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1073962757, now seen corresponding path program 1 times [2022-04-08 08:33:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:18,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1636230852] [2022-04-08 08:33:30,373 WARN L232 SmtUtils]: Spent 6.99s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:33:38,513 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:33:38,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1073962757, now seen corresponding path program 2 times [2022-04-08 08:33:38,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:33:38,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666593650] [2022-04-08 08:33:38,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:33:38,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:33:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:33:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:38,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {11961#(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); {11954#true} is VALID [2022-04-08 08:33:38,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {11954#true} assume true; {11954#true} is VALID [2022-04-08 08:33:38,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11954#true} {11954#true} #591#return; {11954#true} is VALID [2022-04-08 08:33:38,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {11954#true} call ULTIMATE.init(); {11961#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:33:38,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {11961#(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); {11954#true} is VALID [2022-04-08 08:33:38,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {11954#true} assume true; {11954#true} is VALID [2022-04-08 08:33:38,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11954#true} {11954#true} #591#return; {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {11954#true} call #t~ret159 := main(); {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {11954#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; {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L272 TraceCheckUtils]: 6: Hoare triple {11954#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {11954#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {11954#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {11954#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {11954#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {11954#true} assume !false; {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {11954#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {11954#true} assume 12292 == #t~mem43;havoc #t~mem43; {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {11954#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {11954#true} is VALID [2022-04-08 08:33:38,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {11954#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {11954#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {11954#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {11954#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {11954#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {11954#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {11954#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {11954#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {11954#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {11954#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {11954#true} ~skip~0 := 0; {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {11954#true} assume !false; {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {11954#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {11954#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {11954#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {11954#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {11954#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {11954#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:38,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {11954#true} assume 4368 == #t~mem48;havoc #t~mem48; {11954#true} is VALID [2022-04-08 08:33:38,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {11954#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {11954#true} is VALID [2022-04-08 08:33:38,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {11954#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11954#true} is VALID [2022-04-08 08:33:38,656 INFO L290 TraceCheckUtils]: 36: Hoare triple {11954#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:38,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:38,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:38,657 INFO L290 TraceCheckUtils]: 39: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:38,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:38,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:38,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:38,658 INFO L290 TraceCheckUtils]: 43: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:38,659 INFO L290 TraceCheckUtils]: 44: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:38,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11960#(= |ssl3_connect_#t~mem46| 4384)} is VALID [2022-04-08 08:33:38,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {11960#(= |ssl3_connect_#t~mem46| 4384)} assume 20480 == #t~mem46;havoc #t~mem46; {11955#false} is VALID [2022-04-08 08:33:38,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {11955#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {11955#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 49: Hoare triple {11955#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {11955#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {11955#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 52: Hoare triple {11955#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {11955#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {11955#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 55: Hoare triple {11955#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {11955#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {11955#false} ~skip~0 := 0; {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {11955#false} assume !false; {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {11955#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {11955#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {11955#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {11955#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {11955#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {11955#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {11955#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 66: Hoare triple {11955#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 67: Hoare triple {11955#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {11955#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {11955#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 70: Hoare triple {11955#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 71: Hoare triple {11955#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 72: Hoare triple {11955#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 73: Hoare triple {11955#false} assume 4432 == #t~mem56;havoc #t~mem56; {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 74: Hoare triple {11955#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {11955#false} is VALID [2022-04-08 08:33:38,661 INFO L290 TraceCheckUtils]: 75: Hoare triple {11955#false} assume 5 == ~blastFlag~0; {11955#false} is VALID [2022-04-08 08:33:38,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {11955#false} assume !false; {11955#false} is VALID [2022-04-08 08:33:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:33:38,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:33:38,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666593650] [2022-04-08 08:33:38,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666593650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:38,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:38,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:33:38,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:33:38,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1636230852] [2022-04-08 08:33:38,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1636230852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:38,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:38,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:33:38,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564869712] [2022-04-08 08:33:38,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:33:38,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-08 08:33:38,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:33:38,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:38,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:38,720 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:33:38,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:38,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:33:38,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:33:38,721 INFO L87 Difference]: Start difference. First operand 268 states and 391 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:40,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:41,615 INFO L93 Difference]: Finished difference Result 421 states and 616 transitions. [2022-04-08 08:33:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:33:41,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-08 08:33:41,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:33:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-08 08:33:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-08 08:33:41,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 385 transitions. [2022-04-08 08:33:41,864 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-08 08:33:41,868 INFO L225 Difference]: With dead ends: 421 [2022-04-08 08:33:41,868 INFO L226 Difference]: Without dead ends: 284 [2022-04-08 08:33:41,869 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:33:41,869 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 484 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-08 08:33:41,869 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 484 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:33:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-08 08:33:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-08 08:33:41,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:33:41,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:41,878 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:41,878 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:41,883 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2022-04-08 08:33:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 411 transitions. [2022-04-08 08:33:41,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:41,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:41,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 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 284 states. [2022-04-08 08:33:41,885 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 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 284 states. [2022-04-08 08:33:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:41,920 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2022-04-08 08:33:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 411 transitions. [2022-04-08 08:33:41,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:41,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:41,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:33:41,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:33:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 390 transitions. [2022-04-08 08:33:41,927 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 390 transitions. Word has length 77 [2022-04-08 08:33:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:33:41,927 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 390 transitions. [2022-04-08 08:33:41,928 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:41,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 390 transitions. [2022-04-08 08:33:42,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2022-04-08 08:33:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 08:33:42,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:33:42,208 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 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-08 08:33:42,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:33:42,208 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:33:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:33:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash 273295172, now seen corresponding path program 1 times [2022-04-08 08:33:42,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:42,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [703777036] [2022-04-08 08:33:55,960 WARN L232 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:34:03,800 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash 273295172, now seen corresponding path program 2 times [2022-04-08 08:34:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:03,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046631608] [2022-04-08 08:34:03,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:03,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:03,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {13919#(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); {13912#true} is VALID [2022-04-08 08:34:03,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {13912#true} assume true; {13912#true} is VALID [2022-04-08 08:34:03,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13912#true} {13912#true} #591#return; {13912#true} is VALID [2022-04-08 08:34:03,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {13912#true} call ULTIMATE.init(); {13919#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:34:03,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {13919#(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); {13912#true} is VALID [2022-04-08 08:34:03,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {13912#true} assume true; {13912#true} is VALID [2022-04-08 08:34:03,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13912#true} {13912#true} #591#return; {13912#true} is VALID [2022-04-08 08:34:03,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {13912#true} call #t~ret159 := main(); {13912#true} is VALID [2022-04-08 08:34:03,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {13912#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; {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L272 TraceCheckUtils]: 6: Hoare triple {13912#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {13912#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {13912#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {13912#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {13912#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {13912#true} assume !false; {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {13912#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {13912#true} assume 12292 == #t~mem43;havoc #t~mem43; {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {13912#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {13912#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {13912#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {13912#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {13912#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {13912#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {13912#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {13912#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {13912#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {13912#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {13912#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {13912#true} ~skip~0 := 0; {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {13912#true} assume !false; {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {13912#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {13912#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {13912#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {13912#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {13912#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {13912#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:03,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {13912#true} assume 4368 == #t~mem48;havoc #t~mem48; {13912#true} is VALID [2022-04-08 08:34:03,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {13912#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {13912#true} is VALID [2022-04-08 08:34:03,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {13912#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13912#true} is VALID [2022-04-08 08:34:03,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {13912#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:03,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:03,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:03,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:03,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:03,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:03,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:03,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:03,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:03,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:03,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13918#(= |ssl3_connect_#t~mem47| 4384)} is VALID [2022-04-08 08:34:03,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {13918#(= |ssl3_connect_#t~mem47| 4384)} assume 4099 == #t~mem47;havoc #t~mem47; {13913#false} is VALID [2022-04-08 08:34:03,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {13913#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {13913#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13913#false} is VALID [2022-04-08 08:34:03,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {13913#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {13913#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 52: Hoare triple {13913#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {13913#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {13913#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {13913#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {13913#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {13913#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 58: Hoare triple {13913#false} ~skip~0 := 0; {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 59: Hoare triple {13913#false} assume !false; {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 60: Hoare triple {13913#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 61: Hoare triple {13913#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {13913#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {13913#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,947 INFO L290 TraceCheckUtils]: 64: Hoare triple {13913#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 65: Hoare triple {13913#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {13913#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 67: Hoare triple {13913#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 68: Hoare triple {13913#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 69: Hoare triple {13913#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {13913#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 71: Hoare triple {13913#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 72: Hoare triple {13913#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 73: Hoare triple {13913#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 74: Hoare triple {13913#false} assume 4432 == #t~mem56;havoc #t~mem56; {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 75: Hoare triple {13913#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 76: Hoare triple {13913#false} assume 5 == ~blastFlag~0; {13913#false} is VALID [2022-04-08 08:34:03,948 INFO L290 TraceCheckUtils]: 77: Hoare triple {13913#false} assume !false; {13913#false} is VALID [2022-04-08 08:34:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:34:03,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:03,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046631608] [2022-04-08 08:34:03,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046631608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:03,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:03,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:03,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:03,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [703777036] [2022-04-08 08:34:03,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [703777036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:03,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:03,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960054342] [2022-04-08 08:34:03,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:03,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 08:34:03,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:03,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 08:34:04,006 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-08 08:34:04,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:34:04,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:04,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:34:04,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:34:04,007 INFO L87 Difference]: Start difference. First operand 268 states and 390 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 08:34:06,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:06,831 INFO L93 Difference]: Finished difference Result 412 states and 603 transitions. [2022-04-08 08:34:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:34:06,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 08:34:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 08:34:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-08 08:34:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 08:34:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-08 08:34:06,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 373 transitions. [2022-04-08 08:34:07,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:07,096 INFO L225 Difference]: With dead ends: 412 [2022-04-08 08:34:07,096 INFO L226 Difference]: Without dead ends: 275 [2022-04-08 08:34:07,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:34:07,097 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:07,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 470 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:34:07,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-08 08:34:07,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-04-08 08:34:07,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:07,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:07,111 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:07,112 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:07,118 INFO L93 Difference]: Finished difference Result 275 states and 399 transitions. [2022-04-08 08:34:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2022-04-08 08:34:07,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:07,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:07,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 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 275 states. [2022-04-08 08:34:07,120 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 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 275 states. [2022-04-08 08:34:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:07,124 INFO L93 Difference]: Finished difference Result 275 states and 399 transitions. [2022-04-08 08:34:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2022-04-08 08:34:07,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:07,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:07,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:07,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 389 transitions. [2022-04-08 08:34:07,130 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 389 transitions. Word has length 78 [2022-04-08 08:34:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:07,130 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 389 transitions. [2022-04-08 08:34:07,130 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-08 08:34:07,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 389 transitions. [2022-04-08 08:34:07,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 389 transitions. [2022-04-08 08:34:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 08:34:07,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:07,432 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:34:07,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:34:07,432 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:07,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash 369392995, now seen corresponding path program 1 times [2022-04-08 08:34:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:07,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [828203917] [2022-04-08 08:34:07,433 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash 369392995, now seen corresponding path program 2 times [2022-04-08 08:34:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:07,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727426677] [2022-04-08 08:34:07,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:07,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:07,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:07,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {15840#(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); {15834#true} is VALID [2022-04-08 08:34:07,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {15834#true} assume true; {15834#true} is VALID [2022-04-08 08:34:07,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15834#true} {15834#true} #591#return; {15834#true} is VALID [2022-04-08 08:34:07,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {15834#true} call ULTIMATE.init(); {15840#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:34:07,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {15840#(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); {15834#true} is VALID [2022-04-08 08:34:07,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {15834#true} assume true; {15834#true} is VALID [2022-04-08 08:34:07,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15834#true} {15834#true} #591#return; {15834#true} is VALID [2022-04-08 08:34:07,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {15834#true} call #t~ret159 := main(); {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {15834#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; {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L272 TraceCheckUtils]: 6: Hoare triple {15834#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {15834#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {15834#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {15834#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {15834#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {15834#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {15834#true} assume 12292 == #t~mem43;havoc #t~mem43; {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {15834#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {15834#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {15834#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {15834#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {15834#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {15834#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {15834#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {15834#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {15834#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {15834#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {15834#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {15834#true} ~skip~0 := 0; {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {15834#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {15834#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {15834#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {15834#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {15834#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {15834#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {15834#true} assume 4368 == #t~mem48;havoc #t~mem48; {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {15834#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {15834#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {15834#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {15834#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {15834#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {15834#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {15834#true} ~skip~0 := 0; {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {15834#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {15834#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {15834#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {15834#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {15834#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {15834#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {15834#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {15834#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:07,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {15834#true} assume 4384 == #t~mem50;havoc #t~mem50; {15834#true} is VALID [2022-04-08 08:34:07,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {15834#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {15834#true} is VALID [2022-04-08 08:34:07,601 INFO L290 TraceCheckUtils]: 52: Hoare triple {15834#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,604 INFO L290 TraceCheckUtils]: 60: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,605 INFO L290 TraceCheckUtils]: 61: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,605 INFO L290 TraceCheckUtils]: 62: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,605 INFO L290 TraceCheckUtils]: 63: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,606 INFO L290 TraceCheckUtils]: 65: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,606 INFO L290 TraceCheckUtils]: 66: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,606 INFO L290 TraceCheckUtils]: 67: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,606 INFO L290 TraceCheckUtils]: 68: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,607 INFO L290 TraceCheckUtils]: 69: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,611 INFO L290 TraceCheckUtils]: 70: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,611 INFO L290 TraceCheckUtils]: 71: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,612 INFO L290 TraceCheckUtils]: 72: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,612 INFO L290 TraceCheckUtils]: 73: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,612 INFO L290 TraceCheckUtils]: 74: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem56;havoc #t~mem56; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,612 INFO L290 TraceCheckUtils]: 75: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:07,613 INFO L290 TraceCheckUtils]: 76: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15835#false} is VALID [2022-04-08 08:34:07,613 INFO L290 TraceCheckUtils]: 77: Hoare triple {15835#false} assume !false; {15835#false} is VALID [2022-04-08 08:34:07,613 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-08 08:34:07,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:07,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727426677] [2022-04-08 08:34:07,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727426677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:07,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:07,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:07,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:07,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [828203917] [2022-04-08 08:34:07,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [828203917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:07,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:07,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:07,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57773234] [2022-04-08 08:34:07,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:07,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 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-08 08:34:07,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:07,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:07,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:07,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:34:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:07,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:34:07,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:07,667 INFO L87 Difference]: Start difference. First operand 268 states and 389 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:09,684 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:10,584 INFO L93 Difference]: Finished difference Result 539 states and 791 transitions. [2022-04-08 08:34:10,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:34:10,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 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-08 08:34:10,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-08 08:34:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-08 08:34:10,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-08 08:34:10,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:10,934 INFO L225 Difference]: With dead ends: 539 [2022-04-08 08:34:10,934 INFO L226 Difference]: Without dead ends: 402 [2022-04-08 08:34:10,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:10,936 INFO L913 BasicCegarLoop]: 319 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:10,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:34:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-04-08 08:34:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2022-04-08 08:34:10,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:10,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:10,949 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:10,949 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:10,957 INFO L93 Difference]: Finished difference Result 402 states and 583 transitions. [2022-04-08 08:34:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-08 08:34:10,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:10,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:10,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 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 402 states. [2022-04-08 08:34:10,959 INFO L87 Difference]: Start difference. First operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 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 402 states. [2022-04-08 08:34:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:10,966 INFO L93 Difference]: Finished difference Result 402 states and 583 transitions. [2022-04-08 08:34:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-08 08:34:10,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:10,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:10,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:10,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 583 transitions. [2022-04-08 08:34:10,976 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 583 transitions. Word has length 78 [2022-04-08 08:34:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:10,976 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 583 transitions. [2022-04-08 08:34:10,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:10,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 402 states and 583 transitions. [2022-04-08 08:34:11,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-08 08:34:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 08:34:11,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:11,427 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:34:11,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:34:11,427 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash 431432609, now seen corresponding path program 1 times [2022-04-08 08:34:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:11,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [843604988] [2022-04-08 08:34:11,435 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 431432609, now seen corresponding path program 2 times [2022-04-08 08:34:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:11,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839929202] [2022-04-08 08:34:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:11,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:11,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {18535#(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); {18529#true} is VALID [2022-04-08 08:34:11,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {18529#true} assume true; {18529#true} is VALID [2022-04-08 08:34:11,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18529#true} {18529#true} #591#return; {18529#true} is VALID [2022-04-08 08:34:11,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {18529#true} call ULTIMATE.init(); {18535#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:34:11,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {18535#(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); {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {18529#true} assume true; {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18529#true} {18529#true} #591#return; {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {18529#true} call #t~ret159 := main(); {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {18529#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; {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L272 TraceCheckUtils]: 6: Hoare triple {18529#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {18529#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {18529#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {18529#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {18529#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {18529#true} assume !false; {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {18529#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {18529#true} assume 12292 == #t~mem43;havoc #t~mem43; {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {18529#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {18529#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {18529#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {18529#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {18529#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {18529#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {18529#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {18529#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {18529#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {18529#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {18529#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {18529#true} ~skip~0 := 0; {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {18529#true} assume !false; {18529#true} is VALID [2022-04-08 08:34:11,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {18529#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {18529#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {18529#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {18529#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {18529#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {18529#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:11,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {18529#true} assume 4368 == #t~mem48;havoc #t~mem48; {18529#true} is VALID [2022-04-08 08:34:11,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {18529#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {18529#true} is VALID [2022-04-08 08:34:11,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {18529#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {18534#(= 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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,564 INFO L290 TraceCheckUtils]: 42: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,564 INFO L290 TraceCheckUtils]: 43: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,565 INFO L290 TraceCheckUtils]: 47: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,566 INFO L290 TraceCheckUtils]: 49: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem50;havoc #t~mem50; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,566 INFO L290 TraceCheckUtils]: 51: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {18530#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {18530#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 55: Hoare triple {18530#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {18530#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {18530#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {18530#false} ~skip~0 := 0; {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 60: Hoare triple {18530#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {18530#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 62: Hoare triple {18530#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 63: Hoare triple {18530#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,567 INFO L290 TraceCheckUtils]: 64: Hoare triple {18530#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 65: Hoare triple {18530#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 66: Hoare triple {18530#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 67: Hoare triple {18530#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {18530#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {18530#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 70: Hoare triple {18530#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 71: Hoare triple {18530#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 72: Hoare triple {18530#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 73: Hoare triple {18530#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 74: Hoare triple {18530#false} assume 4432 == #t~mem56;havoc #t~mem56; {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 75: Hoare triple {18530#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {18530#false} assume 5 == ~blastFlag~0; {18530#false} is VALID [2022-04-08 08:34:11,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2022-04-08 08:34:11,569 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-08 08:34:11,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:11,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839929202] [2022-04-08 08:34:11,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839929202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:11,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:11,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:11,570 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:11,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [843604988] [2022-04-08 08:34:11,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [843604988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:11,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:11,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:11,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403531011] [2022-04-08 08:34:11,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:11,571 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-08 08:34:11,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:11,571 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-08 08:34:11,619 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-08 08:34:11,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:34:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:11,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:34:11,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:11,620 INFO L87 Difference]: Start difference. First operand 402 states and 583 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-08 08:34:13,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:14,234 INFO L93 Difference]: Finished difference Result 697 states and 1013 transitions. [2022-04-08 08:34:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:34:14,234 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-08 08:34:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:14,234 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-08 08:34:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-08 08:34:14,236 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-08 08:34:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-08 08:34:14,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 371 transitions. [2022-04-08 08:34:14,479 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-08 08:34:14,487 INFO L225 Difference]: With dead ends: 697 [2022-04-08 08:34:14,487 INFO L226 Difference]: Without dead ends: 426 [2022-04-08 08:34:14,488 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:14,488 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 15 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:14,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 363 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:34:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-04-08 08:34:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-04-08 08:34:14,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:14,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 426 states. Second operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:14,523 INFO L74 IsIncluded]: Start isIncluded. First operand 426 states. Second operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:14,523 INFO L87 Difference]: Start difference. First operand 426 states. Second operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:14,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:14,531 INFO L93 Difference]: Finished difference Result 426 states and 615 transitions. [2022-04-08 08:34:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-08 08:34:14,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:14,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:14,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 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 426 states. [2022-04-08 08:34:14,533 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 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 426 states. [2022-04-08 08:34:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:14,542 INFO L93 Difference]: Finished difference Result 426 states and 615 transitions. [2022-04-08 08:34:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-08 08:34:14,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:14,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:14,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:14,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 615 transitions. [2022-04-08 08:34:14,552 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 615 transitions. Word has length 78 [2022-04-08 08:34:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:14,553 INFO L478 AbstractCegarLoop]: Abstraction has 426 states and 615 transitions. [2022-04-08 08:34:14,553 INFO L479 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-08 08:34:14,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 615 transitions. [2022-04-08 08:34:14,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:14,997 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-08 08:34:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 08:34:14,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:14,998 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:34:14,998 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:34:14,998 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:14,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1609163299, now seen corresponding path program 1 times [2022-04-08 08:34:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:14,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [50096545] [2022-04-08 08:34:14,999 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1609163299, now seen corresponding path program 2 times [2022-04-08 08:34:15,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:15,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324182797] [2022-04-08 08:34:15,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:15,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:15,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:15,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {21642#(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); {21636#true} is VALID [2022-04-08 08:34:15,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-08 08:34:15,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21636#true} {21636#true} #591#return; {21636#true} is VALID [2022-04-08 08:34:15,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {21636#true} call ULTIMATE.init(); {21642#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:34:15,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {21642#(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); {21636#true} is VALID [2022-04-08 08:34:15,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-08 08:34:15,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21636#true} {21636#true} #591#return; {21636#true} is VALID [2022-04-08 08:34:15,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {21636#true} call #t~ret159 := main(); {21636#true} is VALID [2022-04-08 08:34:15,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {21636#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; {21636#true} is VALID [2022-04-08 08:34:15,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {21636#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21636#true} is VALID [2022-04-08 08:34:15,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {21636#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {21636#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {21636#true} is VALID [2022-04-08 08:34:15,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {21636#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {21636#true} is VALID [2022-04-08 08:34:15,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {21636#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {21636#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {21636#true} assume 12292 == #t~mem43;havoc #t~mem43; {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {21636#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {21636#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {21636#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {21636#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {21636#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {21636#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {21636#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {21636#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {21636#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {21636#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {21636#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {21636#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {21636#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {21636#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {21636#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {21636#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {21636#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {21636#true} assume 4368 == #t~mem48;havoc #t~mem48; {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {21636#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {21636#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {21636#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {21636#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {21636#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {21636#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {21636#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {21636#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {21636#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {21636#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {21636#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {21636#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {21636#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {21636#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {21636#true} assume 4384 == #t~mem50;havoc #t~mem50; {21636#true} is VALID [2022-04-08 08:34:15,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {21636#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {21636#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {21636#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {21636#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {21636#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {21636#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {21636#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {21636#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {21636#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {21636#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {21636#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {21636#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,164 INFO L290 TraceCheckUtils]: 65: Hoare triple {21636#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,164 INFO L290 TraceCheckUtils]: 66: Hoare triple {21636#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,164 INFO L290 TraceCheckUtils]: 67: Hoare triple {21636#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,164 INFO L290 TraceCheckUtils]: 68: Hoare triple {21636#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,164 INFO L290 TraceCheckUtils]: 69: Hoare triple {21636#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,164 INFO L290 TraceCheckUtils]: 70: Hoare triple {21636#true} assume 4400 == #t~mem52;havoc #t~mem52; {21636#true} is VALID [2022-04-08 08:34:15,164 INFO L290 TraceCheckUtils]: 71: Hoare triple {21636#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {21636#true} is VALID [2022-04-08 08:34:15,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {21636#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {21636#true} is VALID [2022-04-08 08:34:15,168 INFO L290 TraceCheckUtils]: 73: Hoare triple {21636#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,169 INFO L290 TraceCheckUtils]: 74: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,169 INFO L290 TraceCheckUtils]: 75: Hoare triple {21641#(= 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); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,169 INFO L290 TraceCheckUtils]: 76: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,169 INFO L290 TraceCheckUtils]: 77: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,170 INFO L290 TraceCheckUtils]: 78: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,170 INFO L290 TraceCheckUtils]: 79: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,170 INFO L290 TraceCheckUtils]: 80: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,170 INFO L290 TraceCheckUtils]: 81: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,171 INFO L290 TraceCheckUtils]: 82: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,171 INFO L290 TraceCheckUtils]: 83: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,171 INFO L290 TraceCheckUtils]: 84: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,171 INFO L290 TraceCheckUtils]: 85: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,172 INFO L290 TraceCheckUtils]: 86: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,172 INFO L290 TraceCheckUtils]: 87: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,172 INFO L290 TraceCheckUtils]: 88: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,172 INFO L290 TraceCheckUtils]: 89: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,173 INFO L290 TraceCheckUtils]: 90: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,173 INFO L290 TraceCheckUtils]: 91: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,173 INFO L290 TraceCheckUtils]: 92: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,177 INFO L290 TraceCheckUtils]: 93: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,178 INFO L290 TraceCheckUtils]: 94: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem56;havoc #t~mem56; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,178 INFO L290 TraceCheckUtils]: 95: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:15,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {21637#false} is VALID [2022-04-08 08:34:15,178 INFO L290 TraceCheckUtils]: 97: Hoare triple {21637#false} assume !false; {21637#false} is VALID [2022-04-08 08:34:15,179 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-08 08:34:15,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:15,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324182797] [2022-04-08 08:34:15,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324182797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:15,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:15,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:15,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:15,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [50096545] [2022-04-08 08:34:15,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [50096545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:15,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:15,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848135734] [2022-04-08 08:34:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:15,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-08 08:34:15,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:15,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:15,234 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-08 08:34:15,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:34:15,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:15,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:34:15,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:15,235 INFO L87 Difference]: Start difference. First operand 426 states and 615 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:17,252 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:18,158 INFO L93 Difference]: Finished difference Result 854 states and 1242 transitions. [2022-04-08 08:34:18,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:34:18,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-08 08:34:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-08 08:34:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-08 08:34:18,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 494 transitions. [2022-04-08 08:34:18,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:18,505 INFO L225 Difference]: With dead ends: 854 [2022-04-08 08:34:18,505 INFO L226 Difference]: Without dead ends: 559 [2022-04-08 08:34:18,506 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:18,506 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:18,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:34:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-04-08 08:34:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2022-04-08 08:34:18,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:18,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 559 states. Second operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:18,520 INFO L74 IsIncluded]: Start isIncluded. First operand 559 states. Second operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:18,521 INFO L87 Difference]: Start difference. First operand 559 states. Second operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:18,532 INFO L93 Difference]: Finished difference Result 559 states and 808 transitions. [2022-04-08 08:34:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-08 08:34:18,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:18,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:18,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 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 559 states. [2022-04-08 08:34:18,535 INFO L87 Difference]: Start difference. First operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 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 559 states. [2022-04-08 08:34:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:18,546 INFO L93 Difference]: Finished difference Result 559 states and 808 transitions. [2022-04-08 08:34:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-08 08:34:18,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:18,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:18,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:18,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 808 transitions. [2022-04-08 08:34:18,563 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 808 transitions. Word has length 98 [2022-04-08 08:34:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:18,564 INFO L478 AbstractCegarLoop]: Abstraction has 559 states and 808 transitions. [2022-04-08 08:34:18,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:18,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 559 states and 808 transitions. [2022-04-08 08:34:19,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 808 edges. 808 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-08 08:34:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 08:34:19,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:19,132 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:34:19,132 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:34:19,133 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:19,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 1 times [2022-04-08 08:34:19,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:19,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713044060] [2022-04-08 08:34:19,133 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 2 times [2022-04-08 08:34:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:19,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510442901] [2022-04-08 08:34:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:19,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:19,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {25595#(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); {25589#true} is VALID [2022-04-08 08:34:19,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-04-08 08:34:19,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25589#true} {25589#true} #591#return; {25589#true} is VALID [2022-04-08 08:34:19,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {25589#true} call ULTIMATE.init(); {25595#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:34:19,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {25595#(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); {25589#true} is VALID [2022-04-08 08:34:19,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-04-08 08:34:19,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25589#true} {25589#true} #591#return; {25589#true} is VALID [2022-04-08 08:34:19,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {25589#true} call #t~ret159 := main(); {25589#true} is VALID [2022-04-08 08:34:19,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {25589#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; {25589#true} is VALID [2022-04-08 08:34:19,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {25589#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {25589#true} is VALID [2022-04-08 08:34:19,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {25589#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {25589#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {25589#true} is VALID [2022-04-08 08:34:19,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {25589#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {25589#true} is VALID [2022-04-08 08:34:19,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {25589#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25589#true} is VALID [2022-04-08 08:34:19,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-08 08:34:19,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {25589#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {25589#true} assume 12292 == #t~mem43;havoc #t~mem43; {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {25589#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {25589#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {25589#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {25589#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {25589#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {25589#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {25589#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {25589#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {25589#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {25589#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-08 08:34:19,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {25589#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {25589#true} assume 4368 == #t~mem48;havoc #t~mem48; {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {25589#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {25589#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {25589#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {25589#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {25589#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {25589#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {25589#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {25589#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {25589#true} assume 4384 == #t~mem50;havoc #t~mem50; {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 51: Hoare triple {25589#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {25589#true} is VALID [2022-04-08 08:34:19,294 INFO L290 TraceCheckUtils]: 52: Hoare triple {25589#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {25589#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {25589#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {25589#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 56: Hoare triple {25589#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 58: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 59: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {25589#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 61: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 62: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 63: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 64: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 65: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,295 INFO L290 TraceCheckUtils]: 66: Hoare triple {25589#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {25589#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {25589#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {25589#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {25589#true} assume 4400 == #t~mem52;havoc #t~mem52; {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 71: Hoare triple {25589#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 72: Hoare triple {25589#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 73: Hoare triple {25589#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 74: Hoare triple {25589#true} assume !(~ret~0 <= 0); {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 75: Hoare triple {25589#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 76: Hoare triple {25589#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 77: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 78: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-08 08:34:19,296 INFO L290 TraceCheckUtils]: 79: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {25589#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 81: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 83: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 84: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 85: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 86: Hoare triple {25589#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 87: Hoare triple {25589#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 88: Hoare triple {25589#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 89: Hoare triple {25589#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 90: Hoare triple {25589#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 91: Hoare triple {25589#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:19,297 INFO L290 TraceCheckUtils]: 92: Hoare triple {25589#true} assume 4416 == #t~mem54;havoc #t~mem54; {25589#true} is VALID [2022-04-08 08:34:19,298 INFO L290 TraceCheckUtils]: 93: Hoare triple {25589#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {25589#true} is VALID [2022-04-08 08:34:19,298 INFO L290 TraceCheckUtils]: 94: Hoare triple {25589#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,298 INFO L290 TraceCheckUtils]: 95: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,298 INFO L290 TraceCheckUtils]: 96: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,299 INFO L290 TraceCheckUtils]: 97: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,299 INFO L290 TraceCheckUtils]: 98: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,299 INFO L290 TraceCheckUtils]: 99: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,299 INFO L290 TraceCheckUtils]: 100: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !false; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,300 INFO L290 TraceCheckUtils]: 101: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,300 INFO L290 TraceCheckUtils]: 102: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,300 INFO L290 TraceCheckUtils]: 103: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,300 INFO L290 TraceCheckUtils]: 104: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,301 INFO L290 TraceCheckUtils]: 105: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,301 INFO L290 TraceCheckUtils]: 106: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,301 INFO L290 TraceCheckUtils]: 107: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,301 INFO L290 TraceCheckUtils]: 108: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,302 INFO L290 TraceCheckUtils]: 109: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,302 INFO L290 TraceCheckUtils]: 110: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,302 INFO L290 TraceCheckUtils]: 111: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,302 INFO L290 TraceCheckUtils]: 112: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,302 INFO L290 TraceCheckUtils]: 113: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,303 INFO L290 TraceCheckUtils]: 114: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,303 INFO L290 TraceCheckUtils]: 115: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem56;havoc #t~mem56; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,303 INFO L290 TraceCheckUtils]: 116: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:19,303 INFO L290 TraceCheckUtils]: 117: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {25590#false} is VALID [2022-04-08 08:34:19,304 INFO L290 TraceCheckUtils]: 118: Hoare triple {25590#false} assume !false; {25590#false} is VALID [2022-04-08 08:34:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-08 08:34:19,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:19,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510442901] [2022-04-08 08:34:19,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510442901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:19,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:19,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:19,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:19,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [713044060] [2022-04-08 08:34:19,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [713044060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:19,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:19,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156543316] [2022-04-08 08:34:19,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:19,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-08 08:34:19,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:19,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:19,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:19,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:34:19,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:19,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:34:19,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:19,364 INFO L87 Difference]: Start difference. First operand 559 states and 808 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:21,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:22,258 INFO L93 Difference]: Finished difference Result 984 states and 1425 transitions. [2022-04-08 08:34:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:34:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-08 08:34:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2022-04-08 08:34:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2022-04-08 08:34:22,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 490 transitions. [2022-04-08 08:34:22,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:22,576 INFO L225 Difference]: With dead ends: 984 [2022-04-08 08:34:22,576 INFO L226 Difference]: Without dead ends: 556 [2022-04-08 08:34:22,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:22,577 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:22,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 478 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:34:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-04-08 08:34:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2022-04-08 08:34:22,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:22,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 556 states. Second operand has 556 states, 551 states have (on average 1.441016333938294) internal successors, (794), 551 states have internal predecessors, (794), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:22,591 INFO L74 IsIncluded]: Start isIncluded. First operand 556 states. Second operand has 556 states, 551 states have (on average 1.441016333938294) internal successors, (794), 551 states have internal predecessors, (794), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:22,591 INFO L87 Difference]: Start difference. First operand 556 states. Second operand has 556 states, 551 states have (on average 1.441016333938294) internal successors, (794), 551 states have internal predecessors, (794), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:22,601 INFO L93 Difference]: Finished difference Result 556 states and 798 transitions. [2022-04-08 08:34:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 798 transitions. [2022-04-08 08:34:22,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:22,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:22,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 556 states, 551 states have (on average 1.441016333938294) internal successors, (794), 551 states have internal predecessors, (794), 3 states have call successors, (3), 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 556 states. [2022-04-08 08:34:22,603 INFO L87 Difference]: Start difference. First operand has 556 states, 551 states have (on average 1.441016333938294) internal successors, (794), 551 states have internal predecessors, (794), 3 states have call successors, (3), 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 556 states. [2022-04-08 08:34:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:22,614 INFO L93 Difference]: Finished difference Result 556 states and 798 transitions. [2022-04-08 08:34:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 798 transitions. [2022-04-08 08:34:22,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:22,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:22,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:22,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.441016333938294) internal successors, (794), 551 states have internal predecessors, (794), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 798 transitions. [2022-04-08 08:34:22,629 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 798 transitions. Word has length 119 [2022-04-08 08:34:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:22,629 INFO L478 AbstractCegarLoop]: Abstraction has 556 states and 798 transitions. [2022-04-08 08:34:22,630 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:22,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 556 states and 798 transitions. [2022-04-08 08:34:23,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 798 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 798 transitions. [2022-04-08 08:34:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-08 08:34:23,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:23,187 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:34:23,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:34:23,187 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:23,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash 729336437, now seen corresponding path program 1 times [2022-04-08 08:34:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:23,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [744156934] [2022-04-08 08:34:23,189 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash 729336437, now seen corresponding path program 2 times [2022-04-08 08:34:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:23,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252811881] [2022-04-08 08:34:23,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:23,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:23,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {29797#(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); {29790#true} is VALID [2022-04-08 08:34:23,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {29790#true} assume true; {29790#true} is VALID [2022-04-08 08:34:23,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29790#true} {29790#true} #591#return; {29790#true} is VALID [2022-04-08 08:34:23,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {29790#true} call ULTIMATE.init(); {29797#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:34:23,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {29797#(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); {29790#true} is VALID [2022-04-08 08:34:23,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {29790#true} assume true; {29790#true} is VALID [2022-04-08 08:34:23,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29790#true} {29790#true} #591#return; {29790#true} is VALID [2022-04-08 08:34:23,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {29790#true} call #t~ret159 := main(); {29790#true} is VALID [2022-04-08 08:34:23,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {29790#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; {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {29790#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {29790#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {29790#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {29790#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {29790#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {29790#true} assume !false; {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {29790#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {29790#true} assume 12292 == #t~mem43;havoc #t~mem43; {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {29790#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {29790#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {29790#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {29790#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {29790#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {29790#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {29790#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {29790#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {29790#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {29790#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {29790#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {29790#true} ~skip~0 := 0; {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {29790#true} assume !false; {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {29790#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {29790#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {29790#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {29790#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {29790#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {29790#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {29790#true} assume 4368 == #t~mem48;havoc #t~mem48; {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {29790#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {29790#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {29790#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {29790#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {29790#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {29790#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {29790#true} ~skip~0 := 0; {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {29790#true} assume !false; {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {29790#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {29790#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {29790#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,348 INFO L290 TraceCheckUtils]: 45: Hoare triple {29790#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {29790#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {29790#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {29790#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {29790#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {29790#true} assume 4384 == #t~mem50;havoc #t~mem50; {29790#true} is VALID [2022-04-08 08:34:23,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {29790#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {29790#true} is VALID [2022-04-08 08:34:23,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {29790#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {29790#true} is VALID [2022-04-08 08:34:23,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {29790#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {29790#true} is VALID [2022-04-08 08:34:23,350 INFO L290 TraceCheckUtils]: 54: Hoare triple {29790#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,350 INFO L290 TraceCheckUtils]: 55: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,350 INFO L290 TraceCheckUtils]: 56: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,351 INFO L290 TraceCheckUtils]: 58: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,352 INFO L290 TraceCheckUtils]: 61: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,352 INFO L290 TraceCheckUtils]: 62: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,353 INFO L290 TraceCheckUtils]: 66: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,353 INFO L290 TraceCheckUtils]: 67: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,353 INFO L290 TraceCheckUtils]: 68: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:23,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {29795#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29796#(not (= |ssl3_connect_#t~mem52| 4400))} is VALID [2022-04-08 08:34:23,354 INFO L290 TraceCheckUtils]: 70: Hoare triple {29796#(not (= |ssl3_connect_#t~mem52| 4400))} assume 4400 == #t~mem52;havoc #t~mem52; {29791#false} is VALID [2022-04-08 08:34:23,354 INFO L290 TraceCheckUtils]: 71: Hoare triple {29791#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,354 INFO L290 TraceCheckUtils]: 72: Hoare triple {29791#false} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {29791#false} is VALID [2022-04-08 08:34:23,354 INFO L290 TraceCheckUtils]: 73: Hoare triple {29791#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {29791#false} is VALID [2022-04-08 08:34:23,354 INFO L290 TraceCheckUtils]: 74: Hoare triple {29791#false} assume !(~ret~0 <= 0); {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 75: Hoare triple {29791#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {29791#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 77: Hoare triple {29791#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 78: Hoare triple {29791#false} ~skip~0 := 0; {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 79: Hoare triple {29791#false} assume !false; {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 80: Hoare triple {29791#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 81: Hoare triple {29791#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 82: Hoare triple {29791#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 83: Hoare triple {29791#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 84: Hoare triple {29791#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 85: Hoare triple {29791#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 86: Hoare triple {29791#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 87: Hoare triple {29791#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,355 INFO L290 TraceCheckUtils]: 88: Hoare triple {29791#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 89: Hoare triple {29791#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 90: Hoare triple {29791#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 91: Hoare triple {29791#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 92: Hoare triple {29791#false} assume 4416 == #t~mem54;havoc #t~mem54; {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 93: Hoare triple {29791#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 94: Hoare triple {29791#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 95: Hoare triple {29791#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 96: Hoare triple {29791#false} assume !(0 == ~tmp___6~0); {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 97: Hoare triple {29791#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 98: Hoare triple {29791#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 99: Hoare triple {29791#false} ~skip~0 := 0; {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 100: Hoare triple {29791#false} assume !false; {29791#false} is VALID [2022-04-08 08:34:23,356 INFO L290 TraceCheckUtils]: 101: Hoare triple {29791#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 102: Hoare triple {29791#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 103: Hoare triple {29791#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 104: Hoare triple {29791#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 105: Hoare triple {29791#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 106: Hoare triple {29791#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 107: Hoare triple {29791#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 108: Hoare triple {29791#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 109: Hoare triple {29791#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 110: Hoare triple {29791#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 111: Hoare triple {29791#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 112: Hoare triple {29791#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 113: Hoare triple {29791#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,357 INFO L290 TraceCheckUtils]: 114: Hoare triple {29791#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,358 INFO L290 TraceCheckUtils]: 115: Hoare triple {29791#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,358 INFO L290 TraceCheckUtils]: 116: Hoare triple {29791#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29791#false} is VALID [2022-04-08 08:34:23,358 INFO L290 TraceCheckUtils]: 117: Hoare triple {29791#false} assume 4448 == #t~mem58;havoc #t~mem58; {29791#false} is VALID [2022-04-08 08:34:23,358 INFO L290 TraceCheckUtils]: 118: Hoare triple {29791#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {29791#false} is VALID [2022-04-08 08:34:23,369 INFO L290 TraceCheckUtils]: 119: Hoare triple {29791#false} assume 4 == ~blastFlag~0; {29791#false} is VALID [2022-04-08 08:34:23,369 INFO L290 TraceCheckUtils]: 120: Hoare triple {29791#false} assume !false; {29791#false} is VALID [2022-04-08 08:34:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-08 08:34:23,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:23,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252811881] [2022-04-08 08:34:23,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252811881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:23,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:23,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:23,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:23,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [744156934] [2022-04-08 08:34:23,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [744156934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:23,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:23,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:23,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573252683] [2022-04-08 08:34:23,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:23,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-08 08:34:23,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:23,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:23,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:23,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:34:23,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:23,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:34:23,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:34:23,434 INFO L87 Difference]: Start difference. First operand 556 states and 798 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:25,454 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:26,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:26,396 INFO L93 Difference]: Finished difference Result 1463 states and 2109 transitions. [2022-04-08 08:34:26,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:34:26,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-08 08:34:26,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-08 08:34:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-08 08:34:26,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-08 08:34:26,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:26,747 INFO L225 Difference]: With dead ends: 1463 [2022-04-08 08:34:26,748 INFO L226 Difference]: Without dead ends: 923 [2022-04-08 08:34:26,748 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:34:26,749 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 111 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:26,749 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 282 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:34:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-04-08 08:34:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 640. [2022-04-08 08:34:26,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:26,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 923 states. Second operand has 640 states, 635 states have (on average 1.458267716535433) internal successors, (926), 635 states have internal predecessors, (926), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:26,777 INFO L74 IsIncluded]: Start isIncluded. First operand 923 states. Second operand has 640 states, 635 states have (on average 1.458267716535433) internal successors, (926), 635 states have internal predecessors, (926), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:26,777 INFO L87 Difference]: Start difference. First operand 923 states. Second operand has 640 states, 635 states have (on average 1.458267716535433) internal successors, (926), 635 states have internal predecessors, (926), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:26,803 INFO L93 Difference]: Finished difference Result 923 states and 1327 transitions. [2022-04-08 08:34:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1327 transitions. [2022-04-08 08:34:26,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:26,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:26,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 640 states, 635 states have (on average 1.458267716535433) internal successors, (926), 635 states have internal predecessors, (926), 3 states have call successors, (3), 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 923 states. [2022-04-08 08:34:26,805 INFO L87 Difference]: Start difference. First operand has 640 states, 635 states have (on average 1.458267716535433) internal successors, (926), 635 states have internal predecessors, (926), 3 states have call successors, (3), 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 923 states. [2022-04-08 08:34:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:26,832 INFO L93 Difference]: Finished difference Result 923 states and 1327 transitions. [2022-04-08 08:34:26,832 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1327 transitions. [2022-04-08 08:34:26,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:26,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:26,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:26,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 635 states have (on average 1.458267716535433) internal successors, (926), 635 states have internal predecessors, (926), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 930 transitions. [2022-04-08 08:34:26,851 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 930 transitions. Word has length 121 [2022-04-08 08:34:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:26,852 INFO L478 AbstractCegarLoop]: Abstraction has 640 states and 930 transitions. [2022-04-08 08:34:26,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:26,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 640 states and 930 transitions. [2022-04-08 08:34:27,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 930 edges. 930 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 930 transitions. [2022-04-08 08:34:27,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-08 08:34:27,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:27,572 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:34:27,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:34:27,573 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:27,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash -486817289, now seen corresponding path program 1 times [2022-04-08 08:34:27,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:27,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1512924853] [2022-04-08 08:34:27,573 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash -486817289, now seen corresponding path program 2 times [2022-04-08 08:34:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:27,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493651418] [2022-04-08 08:34:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:27,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {35861#(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); {35854#true} is VALID [2022-04-08 08:34:27,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {35854#true} assume true; {35854#true} is VALID [2022-04-08 08:34:27,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35854#true} {35854#true} #591#return; {35854#true} is VALID [2022-04-08 08:34:27,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {35854#true} call ULTIMATE.init(); {35861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:34:27,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {35861#(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); {35854#true} is VALID [2022-04-08 08:34:27,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {35854#true} assume true; {35854#true} is VALID [2022-04-08 08:34:27,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35854#true} {35854#true} #591#return; {35854#true} is VALID [2022-04-08 08:34:27,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {35854#true} call #t~ret159 := main(); {35854#true} is VALID [2022-04-08 08:34:27,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {35854#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; {35854#true} is VALID [2022-04-08 08:34:27,749 INFO L272 TraceCheckUtils]: 6: Hoare triple {35854#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {35854#true} is VALID [2022-04-08 08:34:27,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {35854#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {35854#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {35854#true} is VALID [2022-04-08 08:34:27,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {35854#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {35854#true} is VALID [2022-04-08 08:34:27,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {35854#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35854#true} is VALID [2022-04-08 08:34:27,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {35854#true} assume !false; {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {35854#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {35854#true} assume 12292 == #t~mem43;havoc #t~mem43; {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {35854#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {35854#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {35854#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {35854#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {35854#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {35854#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {35854#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {35854#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {35854#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {35854#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {35854#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {35854#true} ~skip~0 := 0; {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {35854#true} assume !false; {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {35854#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {35854#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {35854#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {35854#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {35854#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {35854#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {35854#true} assume 4368 == #t~mem48;havoc #t~mem48; {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {35854#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {35854#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {35854#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {35854#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {35854#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {35854#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {35854#true} ~skip~0 := 0; {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {35854#true} assume !false; {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {35854#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {35854#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {35854#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {35854#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {35854#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 47: Hoare triple {35854#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {35854#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 49: Hoare triple {35854#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {35854#true} assume 4384 == #t~mem50;havoc #t~mem50; {35854#true} is VALID [2022-04-08 08:34:27,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {35854#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 52: Hoare triple {35854#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 53: Hoare triple {35854#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 54: Hoare triple {35854#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 55: Hoare triple {35854#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {35854#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {35854#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {35854#true} ~skip~0 := 0; {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {35854#true} assume !false; {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {35854#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {35854#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {35854#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {35854#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,753 INFO L290 TraceCheckUtils]: 64: Hoare triple {35854#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {35854#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 66: Hoare triple {35854#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 67: Hoare triple {35854#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 68: Hoare triple {35854#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 69: Hoare triple {35854#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 70: Hoare triple {35854#true} assume 4400 == #t~mem52;havoc #t~mem52; {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 71: Hoare triple {35854#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {35854#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {35854#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {35854#true} assume !(~ret~0 <= 0); {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {35854#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 76: Hoare triple {35854#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 77: Hoare triple {35854#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {35854#true} is VALID [2022-04-08 08:34:27,754 INFO L290 TraceCheckUtils]: 78: Hoare triple {35854#true} ~skip~0 := 0; {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 79: Hoare triple {35854#true} assume !false; {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 80: Hoare triple {35854#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 81: Hoare triple {35854#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 82: Hoare triple {35854#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 83: Hoare triple {35854#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {35854#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {35854#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {35854#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 87: Hoare triple {35854#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 88: Hoare triple {35854#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 89: Hoare triple {35854#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 90: Hoare triple {35854#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,755 INFO L290 TraceCheckUtils]: 91: Hoare triple {35854#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35854#true} is VALID [2022-04-08 08:34:27,756 INFO L290 TraceCheckUtils]: 92: Hoare triple {35854#true} assume 4416 == #t~mem54;havoc #t~mem54; {35854#true} is VALID [2022-04-08 08:34:27,756 INFO L290 TraceCheckUtils]: 93: Hoare triple {35854#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {35854#true} is VALID [2022-04-08 08:34:27,756 INFO L290 TraceCheckUtils]: 94: Hoare triple {35854#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {35854#true} is VALID [2022-04-08 08:34:27,757 INFO L290 TraceCheckUtils]: 95: Hoare triple {35854#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,757 INFO L290 TraceCheckUtils]: 96: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,757 INFO L290 TraceCheckUtils]: 97: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,758 INFO L290 TraceCheckUtils]: 98: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,758 INFO L290 TraceCheckUtils]: 99: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,758 INFO L290 TraceCheckUtils]: 100: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,758 INFO L290 TraceCheckUtils]: 101: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,759 INFO L290 TraceCheckUtils]: 102: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,759 INFO L290 TraceCheckUtils]: 103: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,759 INFO L290 TraceCheckUtils]: 104: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,760 INFO L290 TraceCheckUtils]: 105: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,760 INFO L290 TraceCheckUtils]: 106: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,760 INFO L290 TraceCheckUtils]: 107: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,761 INFO L290 TraceCheckUtils]: 108: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,761 INFO L290 TraceCheckUtils]: 109: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,761 INFO L290 TraceCheckUtils]: 110: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,762 INFO L290 TraceCheckUtils]: 111: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,762 INFO L290 TraceCheckUtils]: 112: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,762 INFO L290 TraceCheckUtils]: 113: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,762 INFO L290 TraceCheckUtils]: 114: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,763 INFO L290 TraceCheckUtils]: 115: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:27,763 INFO L290 TraceCheckUtils]: 116: Hoare triple {35859#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35860#(not (= |ssl3_connect_#t~mem58| 4448))} is VALID [2022-04-08 08:34:27,763 INFO L290 TraceCheckUtils]: 117: Hoare triple {35860#(not (= |ssl3_connect_#t~mem58| 4448))} assume 4448 == #t~mem58;havoc #t~mem58; {35855#false} is VALID [2022-04-08 08:34:27,763 INFO L290 TraceCheckUtils]: 118: Hoare triple {35855#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {35855#false} is VALID [2022-04-08 08:34:27,764 INFO L290 TraceCheckUtils]: 119: Hoare triple {35855#false} assume 4 == ~blastFlag~0; {35855#false} is VALID [2022-04-08 08:34:27,764 INFO L290 TraceCheckUtils]: 120: Hoare triple {35855#false} assume !false; {35855#false} is VALID [2022-04-08 08:34:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-08 08:34:27,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:27,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493651418] [2022-04-08 08:34:27,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493651418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:27,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:27,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:27,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:27,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1512924853] [2022-04-08 08:34:27,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1512924853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:27,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:27,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:27,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178538330] [2022-04-08 08:34:27,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:27,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-08 08:34:27,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:27,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:27,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:27,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:34:27,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:27,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:34:27,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:34:27,821 INFO L87 Difference]: Start difference. First operand 640 states and 930 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:29,855 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:30,888 INFO L93 Difference]: Finished difference Result 1659 states and 2429 transitions. [2022-04-08 08:34:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:34:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-08 08:34:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:34:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:34:30,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 08:34:31,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:31,271 INFO L225 Difference]: With dead ends: 1659 [2022-04-08 08:34:31,271 INFO L226 Difference]: Without dead ends: 1035 [2022-04-08 08:34:31,272 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:34:31,272 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 104 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:31,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 280 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:34:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2022-04-08 08:34:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 776. [2022-04-08 08:34:31,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:31,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1035 states. Second operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,303 INFO L74 IsIncluded]: Start isIncluded. First operand 1035 states. Second operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,304 INFO L87 Difference]: Start difference. First operand 1035 states. Second operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:31,336 INFO L93 Difference]: Finished difference Result 1035 states and 1515 transitions. [2022-04-08 08:34:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1515 transitions. [2022-04-08 08:34:31,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:31,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:31,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 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 1035 states. [2022-04-08 08:34:31,339 INFO L87 Difference]: Start difference. First operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 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 1035 states. [2022-04-08 08:34:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:31,372 INFO L93 Difference]: Finished difference Result 1035 states and 1515 transitions. [2022-04-08 08:34:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1515 transitions. [2022-04-08 08:34:31,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:31,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:31,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:31,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1166 transitions. [2022-04-08 08:34:31,416 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1166 transitions. Word has length 121 [2022-04-08 08:34:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:31,416 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 1166 transitions. [2022-04-08 08:34:31,417 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 776 states and 1166 transitions. [2022-04-08 08:34:32,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1166 edges. 1166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1166 transitions. [2022-04-08 08:34:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 08:34:32,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:32,453 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:34:32,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:34:32,453 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:32,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:32,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2084056150, now seen corresponding path program 1 times [2022-04-08 08:34:32,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:32,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1234880103] [2022-04-08 08:34:32,454 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:32,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2084056150, now seen corresponding path program 2 times [2022-04-08 08:34:32,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:32,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650103645] [2022-04-08 08:34:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:32,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:32,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {42813#(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); {42806#true} is VALID [2022-04-08 08:34:32,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {42806#true} assume true; {42806#true} is VALID [2022-04-08 08:34:32,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42806#true} {42806#true} #591#return; {42806#true} is VALID [2022-04-08 08:34:32,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {42806#true} call ULTIMATE.init(); {42813#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:34:32,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {42813#(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); {42806#true} is VALID [2022-04-08 08:34:32,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {42806#true} assume true; {42806#true} is VALID [2022-04-08 08:34:32,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42806#true} {42806#true} #591#return; {42806#true} is VALID [2022-04-08 08:34:32,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {42806#true} call #t~ret159 := main(); {42806#true} is VALID [2022-04-08 08:34:32,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {42806#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; {42806#true} is VALID [2022-04-08 08:34:32,613 INFO L272 TraceCheckUtils]: 6: Hoare triple {42806#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {42806#true} is VALID [2022-04-08 08:34:32,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {42806#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {42806#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {42806#true} is VALID [2022-04-08 08:34:32,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {42806#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {42806#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {42806#true} assume !false; {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {42806#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {42806#true} assume 12292 == #t~mem43;havoc #t~mem43; {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {42806#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {42806#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {42806#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {42806#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {42806#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {42806#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {42806#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {42806#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {42806#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {42806#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {42806#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42806#true} is VALID [2022-04-08 08:34:32,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {42806#true} ~skip~0 := 0; {42806#true} is VALID [2022-04-08 08:34:32,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {42806#true} assume !false; {42806#true} is VALID [2022-04-08 08:34:32,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {42806#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {42806#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {42806#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {42806#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {42806#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {42806#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {42806#true} assume 4368 == #t~mem48;havoc #t~mem48; {42806#true} is VALID [2022-04-08 08:34:32,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {42806#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {42806#true} is VALID [2022-04-08 08:34:32,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {42806#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42806#true} is VALID [2022-04-08 08:34:32,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {42806#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~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {42806#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {42806#true} is VALID [2022-04-08 08:34:32,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {42806#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {42806#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42806#true} is VALID [2022-04-08 08:34:32,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {42806#true} ~skip~0 := 0; {42806#true} is VALID [2022-04-08 08:34:32,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {42806#true} assume !false; {42806#true} is VALID [2022-04-08 08:34:32,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {42806#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {42806#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {42806#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {42806#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {42806#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {42806#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {42806#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {42806#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {42806#true} assume 4384 == #t~mem50;havoc #t~mem50; {42806#true} is VALID [2022-04-08 08:34:32,632 INFO L290 TraceCheckUtils]: 51: Hoare triple {42806#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {42806#true} is VALID [2022-04-08 08:34:32,632 INFO L290 TraceCheckUtils]: 52: Hoare triple {42806#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42806#true} is VALID [2022-04-08 08:34:32,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {42806#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {42806#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {42806#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {42806#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {42806#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42806#true} is VALID [2022-04-08 08:34:32,633 INFO L290 TraceCheckUtils]: 58: Hoare triple {42806#true} ~skip~0 := 0; {42806#true} is VALID [2022-04-08 08:34:32,633 INFO L290 TraceCheckUtils]: 59: Hoare triple {42806#true} assume !false; {42806#true} is VALID [2022-04-08 08:34:32,633 INFO L290 TraceCheckUtils]: 60: Hoare triple {42806#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,633 INFO L290 TraceCheckUtils]: 61: Hoare triple {42806#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,633 INFO L290 TraceCheckUtils]: 62: Hoare triple {42806#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,634 INFO L290 TraceCheckUtils]: 63: Hoare triple {42806#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,634 INFO L290 TraceCheckUtils]: 64: Hoare triple {42806#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,634 INFO L290 TraceCheckUtils]: 65: Hoare triple {42806#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,634 INFO L290 TraceCheckUtils]: 66: Hoare triple {42806#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,634 INFO L290 TraceCheckUtils]: 67: Hoare triple {42806#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,634 INFO L290 TraceCheckUtils]: 68: Hoare triple {42806#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,634 INFO L290 TraceCheckUtils]: 69: Hoare triple {42806#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,634 INFO L290 TraceCheckUtils]: 70: Hoare triple {42806#true} assume 4400 == #t~mem52;havoc #t~mem52; {42806#true} is VALID [2022-04-08 08:34:32,634 INFO L290 TraceCheckUtils]: 71: Hoare triple {42806#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,635 INFO L290 TraceCheckUtils]: 72: Hoare triple {42806#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {42806#true} is VALID [2022-04-08 08:34:32,635 INFO L290 TraceCheckUtils]: 73: Hoare triple {42806#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {42806#true} is VALID [2022-04-08 08:34:32,635 INFO L290 TraceCheckUtils]: 74: Hoare triple {42806#true} assume !(~ret~0 <= 0); {42806#true} is VALID [2022-04-08 08:34:32,635 INFO L290 TraceCheckUtils]: 75: Hoare triple {42806#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,635 INFO L290 TraceCheckUtils]: 76: Hoare triple {42806#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,635 INFO L290 TraceCheckUtils]: 77: Hoare triple {42806#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42806#true} is VALID [2022-04-08 08:34:32,635 INFO L290 TraceCheckUtils]: 78: Hoare triple {42806#true} ~skip~0 := 0; {42806#true} is VALID [2022-04-08 08:34:32,635 INFO L290 TraceCheckUtils]: 79: Hoare triple {42806#true} assume !false; {42806#true} is VALID [2022-04-08 08:34:32,635 INFO L290 TraceCheckUtils]: 80: Hoare triple {42806#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,635 INFO L290 TraceCheckUtils]: 81: Hoare triple {42806#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,636 INFO L290 TraceCheckUtils]: 82: Hoare triple {42806#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,636 INFO L290 TraceCheckUtils]: 83: Hoare triple {42806#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,636 INFO L290 TraceCheckUtils]: 84: Hoare triple {42806#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,636 INFO L290 TraceCheckUtils]: 85: Hoare triple {42806#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,636 INFO L290 TraceCheckUtils]: 86: Hoare triple {42806#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,636 INFO L290 TraceCheckUtils]: 87: Hoare triple {42806#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,636 INFO L290 TraceCheckUtils]: 88: Hoare triple {42806#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,636 INFO L290 TraceCheckUtils]: 89: Hoare triple {42806#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,636 INFO L290 TraceCheckUtils]: 90: Hoare triple {42806#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,637 INFO L290 TraceCheckUtils]: 91: Hoare triple {42806#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42806#true} is VALID [2022-04-08 08:34:32,637 INFO L290 TraceCheckUtils]: 92: Hoare triple {42806#true} assume 4416 == #t~mem54;havoc #t~mem54; {42806#true} is VALID [2022-04-08 08:34:32,637 INFO L290 TraceCheckUtils]: 93: Hoare triple {42806#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {42806#true} is VALID [2022-04-08 08:34:32,637 INFO L290 TraceCheckUtils]: 94: Hoare triple {42806#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {42806#true} is VALID [2022-04-08 08:34:32,638 INFO L290 TraceCheckUtils]: 95: Hoare triple {42806#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,639 INFO L290 TraceCheckUtils]: 96: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,639 INFO L290 TraceCheckUtils]: 97: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,639 INFO L290 TraceCheckUtils]: 98: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,640 INFO L290 TraceCheckUtils]: 99: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,640 INFO L290 TraceCheckUtils]: 100: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,640 INFO L290 TraceCheckUtils]: 101: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,640 INFO L290 TraceCheckUtils]: 102: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,641 INFO L290 TraceCheckUtils]: 103: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,641 INFO L290 TraceCheckUtils]: 104: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,641 INFO L290 TraceCheckUtils]: 105: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,642 INFO L290 TraceCheckUtils]: 106: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,642 INFO L290 TraceCheckUtils]: 107: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,642 INFO L290 TraceCheckUtils]: 108: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,643 INFO L290 TraceCheckUtils]: 109: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,643 INFO L290 TraceCheckUtils]: 110: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,643 INFO L290 TraceCheckUtils]: 111: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,644 INFO L290 TraceCheckUtils]: 112: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,644 INFO L290 TraceCheckUtils]: 113: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,644 INFO L290 TraceCheckUtils]: 114: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,644 INFO L290 TraceCheckUtils]: 115: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,645 INFO L290 TraceCheckUtils]: 116: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:32,645 INFO L290 TraceCheckUtils]: 117: Hoare triple {42811#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42812#(not (= 4449 |ssl3_connect_#t~mem59|))} is VALID [2022-04-08 08:34:32,646 INFO L290 TraceCheckUtils]: 118: Hoare triple {42812#(not (= 4449 |ssl3_connect_#t~mem59|))} assume 4449 == #t~mem59;havoc #t~mem59; {42807#false} is VALID [2022-04-08 08:34:32,646 INFO L290 TraceCheckUtils]: 119: Hoare triple {42807#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {42807#false} is VALID [2022-04-08 08:34:32,646 INFO L290 TraceCheckUtils]: 120: Hoare triple {42807#false} assume 4 == ~blastFlag~0; {42807#false} is VALID [2022-04-08 08:34:32,646 INFO L290 TraceCheckUtils]: 121: Hoare triple {42807#false} assume !false; {42807#false} is VALID [2022-04-08 08:34:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-08 08:34:32,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:32,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650103645] [2022-04-08 08:34:32,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650103645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:32,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:32,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:32,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:32,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1234880103] [2022-04-08 08:34:32,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1234880103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:32,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:32,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:32,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837579378] [2022-04-08 08:34:32,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:32,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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 122 [2022-04-08 08:34:32,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:32,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:32,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:32,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:34:32,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:32,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:34:32,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:34:32,713 INFO L87 Difference]: Start difference. First operand 776 states and 1166 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:34,734 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:35,953 INFO L93 Difference]: Finished difference Result 1819 states and 2709 transitions. [2022-04-08 08:34:35,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:34:35,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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 122 [2022-04-08 08:34:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:34:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:34:35,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 08:34:36,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:36,364 INFO L225 Difference]: With dead ends: 1819 [2022-04-08 08:34:36,364 INFO L226 Difference]: Without dead ends: 1059 [2022-04-08 08:34:36,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:34:36,366 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 103 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:36,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 280 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:34:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2022-04-08 08:34:36,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 804. [2022-04-08 08:34:36,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:36,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1059 states. Second operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:36,418 INFO L74 IsIncluded]: Start isIncluded. First operand 1059 states. Second operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:36,419 INFO L87 Difference]: Start difference. First operand 1059 states. Second operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:36,488 INFO L93 Difference]: Finished difference Result 1059 states and 1559 transitions. [2022-04-08 08:34:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1559 transitions. [2022-04-08 08:34:36,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:36,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:36,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 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 1059 states. [2022-04-08 08:34:36,491 INFO L87 Difference]: Start difference. First operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 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 1059 states. [2022-04-08 08:34:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:36,545 INFO L93 Difference]: Finished difference Result 1059 states and 1559 transitions. [2022-04-08 08:34:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1559 transitions. [2022-04-08 08:34:36,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:36,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:36,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:36,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1218 transitions. [2022-04-08 08:34:36,593 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1218 transitions. Word has length 122 [2022-04-08 08:34:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:36,594 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 1218 transitions. [2022-04-08 08:34:36,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:36,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 804 states and 1218 transitions. [2022-04-08 08:34:37,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1218 edges. 1218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1218 transitions. [2022-04-08 08:34:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-08 08:34:37,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:37,739 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:34:37,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:34:37,739 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:37,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 1 times [2022-04-08 08:34:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:37,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715166447] [2022-04-08 08:34:37,740 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 2 times [2022-04-08 08:34:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:37,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735098828] [2022-04-08 08:34:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:34:38,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:34:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:34:38,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:34:38,839 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 08:34:38,839 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 08:34:38,842 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 08:34:38,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:34:38,845 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 08:34:38,847 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 08:34:38,885 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 08:34:38,885 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 08:34:38,885 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-08 08:34:38,885 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 08:34:38,885 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 08:34:38,885 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-08 08:34:38,885 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 08:34:38,885 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-08 08:34:38,885 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-08 08:34:38,885 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-08 08:34:38,885 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1136-2 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1136 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1136 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-08 08:34:38,886 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1678-1 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-08 08:34:38,887 WARN L170 areAnnotationChecker]: L1658 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1154 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1662 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1662 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1662-2 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1157 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1159 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1159 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1162 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1162 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1267 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1267 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1267-2 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-08 08:34:38,888 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1281 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1281 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1279-2 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1313 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1313 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1292 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1292 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1313-2 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1313-2 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1299 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1299 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1325 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1325 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-08 08:34:38,889 WARN L170 areAnnotationChecker]: L1591 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1344 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1344 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1353 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1353 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1627-1 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1344-2 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1353-2 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1357 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1357 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-08 08:34:38,890 WARN L170 areAnnotationChecker]: L1357-2 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1357-2 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1374 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1374 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1631 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1631 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1629-2 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1629-2 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1374-2 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1374-2 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1397 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1397 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1402 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1402 has no Hoare annotation [2022-04-08 08:34:38,891 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1210 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1210 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1423-2 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-08 08:34:38,892 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1452-2 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1463 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1463 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1483 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1483 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1483-2 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-08 08:34:38,893 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1489 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1489 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1515 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1515 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1513-1 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-08 08:34:38,894 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1535 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1535 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1535-2 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-08 08:34:38,895 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1544-2 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1561 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1561 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1561-2 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1566 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1566 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1566-2 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1573 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1573 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1573-2 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-08 08:34:38,896 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-08 08:34:38,896 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-08 08:34:38,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 08:34:38 BoogieIcfgContainer [2022-04-08 08:34:38,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 08:34:38,900 INFO L158 Benchmark]: Toolchain (without parser) took 174581.15ms. Allocated memory was 198.2MB in the beginning and 369.1MB in the end (delta: 170.9MB). Free memory was 142.0MB in the beginning and 208.0MB in the end (delta: -66.0MB). Peak memory consumption was 199.9MB. Max. memory is 8.0GB. [2022-04-08 08:34:38,904 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:34:38,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.60ms. Allocated memory was 198.2MB in the beginning and 305.1MB in the end (delta: 107.0MB). Free memory was 141.9MB in the beginning and 257.6MB in the end (delta: -115.7MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-04-08 08:34:38,904 INFO L158 Benchmark]: Boogie Preprocessor took 112.26ms. Allocated memory is still 305.1MB. Free memory was 257.6MB in the beginning and 248.1MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 08:34:38,904 INFO L158 Benchmark]: RCFGBuilder took 1803.52ms. Allocated memory is still 305.1MB. Free memory was 248.1MB in the beginning and 210.2MB in the end (delta: 38.0MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB. [2022-04-08 08:34:38,904 INFO L158 Benchmark]: TraceAbstraction took 172166.71ms. Allocated memory was 305.1MB in the beginning and 369.1MB in the end (delta: 64.0MB). Free memory was 209.7MB in the beginning and 208.0MB in the end (delta: 1.7MB). Peak memory consumption was 161.0MB. Max. memory is 8.0GB. [2022-04-08 08:34:38,904 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 491.60ms. Allocated memory was 198.2MB in the beginning and 305.1MB in the end (delta: 107.0MB). Free memory was 141.9MB in the beginning and 257.6MB in the end (delta: -115.7MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 112.26ms. Allocated memory is still 305.1MB. Free memory was 257.6MB in the beginning and 248.1MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1803.52ms. Allocated memory is still 305.1MB. Free memory was 248.1MB in the beginning and 210.2MB in the end (delta: 38.0MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB. * TraceAbstraction took 172166.71ms. Allocated memory was 305.1MB in the beginning and 369.1MB in the end (delta: 64.0MB). Free memory was 209.7MB in the beginning and 208.0MB in the end (delta: 1.7MB). Peak memory consumption was 161.0MB. 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: 1668]: 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 1353. 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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [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 ; [L1116] int tmp___4 ; [L1117] int tmp___5 ; [L1118] int tmp___6 ; [L1119] int tmp___7 ; [L1120] int tmp___8 ; [L1121] long tmp___9 ; [L1123] int blastFlag ; [L1126] blastFlag = 0 [L1127] s->hit=__VERIFIER_nondet_int () [L1128] s->state = 12292 [L1129] tmp = __VERIFIER_nondet_int() [L1130] cb = (void (*)())((void *)0) [L1131] ret = -1 [L1132] skip = 0 [L1133] EXPR s->info_callback [L1133] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1134] EXPR s->info_callback [L1134] cb = s->info_callback [L1142] EXPR s->in_handshake [L1142] s->in_handshake += 1 [L1143] COND FALSE !(tmp___1 & 12288) [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND TRUE s->state == 12292 [L1259] s->new_session = 1 [L1260] s->state = 4096 [L1261] EXPR s->ctx [L1261] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1261] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1266] s->server = 0 [L1267] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) [L1272] EXPR s->version [L1272] COND FALSE !((s->version & 65280) != 768) [L1278] s->type = 4096 [L1279] EXPR s->init_buf [L1279] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1291] tmp___4 = __VERIFIER_nondet_int() [L1292] COND FALSE !(! tmp___4) [L1298] tmp___5 = __VERIFIER_nondet_int() [L1299] COND FALSE !(! tmp___5) [L1305] s->state = 4368 [L1306] EXPR s->ctx [L1306] EXPR (s->ctx)->stats.sess_connect [L1306] (s->ctx)->stats.sess_connect += 1 [L1307] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND TRUE s->state == 4368 [L1311] s->shutdown = 0 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 0 [L1314] blastFlag = 1 [L1318] COND FALSE !(ret <= 0) [L1323] s->state = 4384 [L1324] s->init_num = 0 [L1325] EXPR s->bbio [L1325] EXPR s->wbio [L1325] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND TRUE s->state == 4384 [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 1 [L1335] blastFlag = 2 [L1339] COND FALSE !(ret <= 0) [L1344] s->hit [L1344] COND FALSE !(s->hit) [L1347] s->state = 4400 [L1349] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND TRUE s->state == 4400 [L1353] EXPR s->s3 [L1353] EXPR (s->s3)->tmp.new_cipher [L1353] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1353] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 2 [L1358] blastFlag = 3 [L1362] COND FALSE !(ret <= 0) [L1368] s->state = 4416 [L1369] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state [L1189] COND TRUE s->state == 4416 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND TRUE blastFlag == 3 [L1375] blastFlag = 4 [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4432 [L1385] s->init_num = 0 [L1386] tmp___6 = __VERIFIER_nondet_int() [L1387] COND FALSE !(! tmp___6) [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state [L1195] COND TRUE s->state == 4432 [L1396] ret = __VERIFIER_nondet_int() [L1397] COND FALSE !(blastFlag == 5) [L1402] COND FALSE !(ret <= 0) [L1407] s->state = 4448 [L1408] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state [L1195] COND FALSE !(s->state == 4432) [L1198] EXPR s->state [L1198] COND FALSE !(s->state == 4433) [L1201] EXPR s->state [L1201] COND TRUE s->state == 4448 [L1412] ret = __VERIFIER_nondet_int() [L1413] COND TRUE blastFlag == 4 [L1668] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 172.1s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 48.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 1199 SdHoareTripleChecker+Valid, 34.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1199 mSDsluCounter, 6045 SdHoareTripleChecker+Invalid, 34.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3227 mSDsCounter, 285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5060 IncrementalHoareTripleChecker+Invalid, 5360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 285 mSolverCounterUnsat, 2818 mSDtfsCounter, 5060 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804occurred in iteration=15, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 1175 StatesRemovedByMinimization, 10 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-08 08:34:38,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...