/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-e106359-m [2022-04-15 11:31:12,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:31:12,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:31:13,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:31:13,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:31:13,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:31:13,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:31:13,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:31:13,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:31:13,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:31:13,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:31:13,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:31:13,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:31:13,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:31:13,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:31:13,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:31:13,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:31:13,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:31:13,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:31:13,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:31:13,070 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:31:13,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:31:13,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:31:13,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:31:13,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:31:13,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:31:13,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:31:13,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:31:13,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:31:13,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:31:13,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:31:13,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:31:13,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:31:13,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:31:13,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:31:13,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:31:13,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:31:13,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:31:13,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:31:13,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:31:13,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:31:13,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:31:13,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:31:13,115 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:31:13,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:31:13,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:31:13,117 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:31:13,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:31:13,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:31:13,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:31:13,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:31:13,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:31:13,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:31:13,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:31:13,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:31:13,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:31:13,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:31:13,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:31:13,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:31:13,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:31:13,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:31:13,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:31:13,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:31:13,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:31:13,120 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:31:13,121 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:31:13,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:31:13,121 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:31:13,121 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:31:13,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:31:13,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:31:13,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:31:13,356 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:31:13,357 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:31:13,358 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-15 11:31:13,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17d5ed50/7c259761d7d94b3eb6dadc8351e0ced9/FLAG2917062c6 [2022-04-15 11:31:13,902 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:31:13,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-04-15 11:31:13,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17d5ed50/7c259761d7d94b3eb6dadc8351e0ced9/FLAG2917062c6 [2022-04-15 11:31:14,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17d5ed50/7c259761d7d94b3eb6dadc8351e0ced9 [2022-04-15 11:31:14,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:31:14,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:31:14,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:31:14,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:31:14,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:31:14,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:31:14" (1/1) ... [2022-04-15 11:31:14,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d9712e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:14, skipping insertion in model container [2022-04-15 11:31:14,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:31:14" (1/1) ... [2022-04-15 11:31:14,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:31:14,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:31:14,919 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-15 11:31:14,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:31:14,953 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:31:15,070 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-15 11:31:15,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:31:15,089 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:31:15,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:15 WrapperNode [2022-04-15 11:31:15,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:31:15,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:31:15,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:31:15,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:31:15,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:15" (1/1) ... [2022-04-15 11:31:15,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:15" (1/1) ... [2022-04-15 11:31:15,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:15" (1/1) ... [2022-04-15 11:31:15,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:15" (1/1) ... [2022-04-15 11:31:15,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:15" (1/1) ... [2022-04-15 11:31:15,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:15" (1/1) ... [2022-04-15 11:31:15,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:15" (1/1) ... [2022-04-15 11:31:15,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:31:15,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:31:15,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:31:15,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:31:15,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:15" (1/1) ... [2022-04-15 11:31:15,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:31:15,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:31:15,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:31:15,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:31:15,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:31:15,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:31:15,288 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:31:15,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 11:31:15,288 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 11:31:15,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:31:15,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 11:31:15,288 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:31:15,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:31:15,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:31:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:31:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:31:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:31:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:31:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:31:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:31:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:31:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:31:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:31:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:31:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 11:31:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:31:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 11:31:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 11:31:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:31:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:31:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:31:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:31:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:31:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:31:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:31:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:31:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:31:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:31:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:31:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:31:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:31:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:31:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:31:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:31:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:31:15,479 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:31:15,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:31:16,983 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:31:17,452 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 11:31:17,452 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 11:31:17,474 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:31:17,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:31:17,484 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:31:17,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:31:17 BoogieIcfgContainer [2022-04-15 11:31:17,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:31:17,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:31:17,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:31:17,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:31:17,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:31:14" (1/3) ... [2022-04-15 11:31:17,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c6b37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:31:17, skipping insertion in model container [2022-04-15 11:31:17,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:15" (2/3) ... [2022-04-15 11:31:17,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c6b37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:31:17, skipping insertion in model container [2022-04-15 11:31:17,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:31:17" (3/3) ... [2022-04-15 11:31:17,493 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-04-15 11:31:17,498 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:31:17,498 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:31:17,534 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:31:17,541 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:31:17,551 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:31:17,575 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-15 11:31:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:31:17,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:17,589 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:17,589 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:17,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:17,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 1 times [2022-04-15 11:31:17,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:17,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1657334182] [2022-04-15 11:31:17,614 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:31:17,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 2 times [2022-04-15 11:31:17,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:17,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226523496] [2022-04-15 11:31:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:17,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:18,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:18,287 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-15 11:31:18,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-15 11:31:18,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-15 11:31:18,290 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-15 11:31:18,291 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-15 11:31:18,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-15 11:31:18,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-15 11:31:18,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-15 11:31:18,296 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-15 11:31:18,297 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-15 11:31:18,300 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-15 11:31:18,301 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-15 11:31:18,302 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-15 11:31:18,303 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-15 11:31:18,303 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-15 11:31:18,306 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-15 11:31:18,306 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-15 11:31:18,307 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-15 11:31:18,307 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-15 11:31:18,307 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-15 11:31:18,307 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-15 11:31:18,308 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-15 11:31:18,308 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-15 11:31:18,308 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-15 11:31:18,309 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-15 11:31:18,309 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-15 11:31:18,310 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-15 11:31:18,310 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-15 11:31:18,310 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-15 11:31:18,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {144#false} assume 4432 == #t~mem56;havoc #t~mem56; {144#false} is VALID [2022-04-15 11:31:18,311 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-15 11:31:18,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {144#false} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-15 11:31:18,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-15 11:31:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:31:18,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:18,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226523496] [2022-04-15 11:31:18,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226523496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:18,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:18,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:18,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:18,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1657334182] [2022-04-15 11:31:18,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1657334182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:18,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:18,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925004588] [2022-04-15 11:31:18,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:18,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:31:18,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:18,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:18,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:18,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:31:18,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:31:18,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:31:18,400 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-15 11:31:20,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:21,833 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2022-04-15 11:31:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:31:21,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:31:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-15 11:31:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-15 11:31:21,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 444 transitions. [2022-04-15 11:31:22,231 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-15 11:31:22,243 INFO L225 Difference]: With dead ends: 271 [2022-04-15 11:31:22,243 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 11:31:22,246 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:31:22,249 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:22,249 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.4s Time] [2022-04-15 11:31:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 11:31:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-04-15 11:31:22,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:22,283 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-15 11:31:22,284 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-15 11:31:22,285 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-15 11:31:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:22,291 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-15 11:31:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-15 11:31:22,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:22,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:22,293 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-15 11:31:22,293 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-15 11:31:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:22,299 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-15 11:31:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-15 11:31:22,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:22,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:22,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:22,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:22,308 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-15 11:31:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2022-04-15 11:31:22,316 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 30 [2022-04-15 11:31:22,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:22,316 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2022-04-15 11:31:22,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:22,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 180 transitions. [2022-04-15 11:31:22,466 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-15 11:31:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2022-04-15 11:31:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 11:31:22,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:22,468 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-15 11:31:22,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:31:22,468 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:22,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1834539841, now seen corresponding path program 1 times [2022-04-15 11:31:22,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:22,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993910723] [2022-04-15 11:31:22,470 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:31:22,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1834539841, now seen corresponding path program 2 times [2022-04-15 11:31:22,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:22,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107475078] [2022-04-15 11:31:22,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:22,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:22,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:22,716 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-15 11:31:22,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-15 11:31:22,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1191#true} {1191#true} #591#return; {1191#true} is VALID [2022-04-15 11:31:22,718 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-15 11:31:22,718 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-15 11:31:22,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-15 11:31:22,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #591#return; {1191#true} is VALID [2022-04-15 11:31:22,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret159 := main(); {1191#true} is VALID [2022-04-15 11:31:22,719 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-15 11:31:22,719 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-15 11:31:22,720 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-15 11:31:22,720 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-15 11:31:22,720 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-15 11:31:22,721 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-15 11:31:22,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:22,722 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-15 11:31:22,722 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-15 11:31:22,725 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-15 11:31:22,725 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-15 11:31:22,726 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-15 11:31:22,727 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-15 11:31:22,728 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-15 11:31:22,728 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-15 11:31:22,728 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-15 11:31:22,729 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-15 11:31:22,729 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-15 11:31:22,730 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-15 11:31:22,730 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-15 11:31:22,731 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-15 11:31:22,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:22,731 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-15 11:31:22,732 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-15 11:31:22,732 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-15 11:31:22,732 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-15 11:31:22,733 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-15 11:31:22,733 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-15 11:31:22,734 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-15 11:31:22,734 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-15 11:31:22,734 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-15 11:31:22,735 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-15 11:31:22,735 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-15 11:31:22,736 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-15 11:31:22,736 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-15 11:31:22,736 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-15 11:31:22,737 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-15 11:31:22,737 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-15 11:31:22,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1192#false} is VALID [2022-04-15 11:31:22,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-15 11:31:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:31:22,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:22,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107475078] [2022-04-15 11:31:22,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107475078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:22,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:22,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:31:22,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:22,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993910723] [2022-04-15 11:31:22,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993910723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:22,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:22,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:31:22,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541466711] [2022-04-15 11:31:22,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:22,740 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-15 11:31:22,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:22,741 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-15 11:31:22,805 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-15 11:31:22,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:31:22,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:22,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:31:22,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:31:22,806 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-15 11:31:24,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:25,635 INFO L93 Difference]: Finished difference Result 333 states and 496 transitions. [2022-04-15 11:31:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:31:25,635 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-15 11:31:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:25,636 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-15 11:31:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-15 11:31:25,641 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-15 11:31:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-15 11:31:25,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-15 11:31:26,045 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-15 11:31:26,052 INFO L225 Difference]: With dead ends: 333 [2022-04-15 11:31:26,052 INFO L226 Difference]: Without dead ends: 226 [2022-04-15 11:31:26,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:31:26,054 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-15 11:31:26,054 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-15 11:31:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-15 11:31:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-04-15 11:31:26,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:26,083 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-15 11:31:26,088 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-15 11:31:26,088 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-15 11:31:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:26,098 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-15 11:31:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-15 11:31:26,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:26,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:26,099 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-15 11:31:26,100 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-15 11:31:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:26,109 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-15 11:31:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-15 11:31:26,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:26,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:26,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:26,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:26,111 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-15 11:31:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 330 transitions. [2022-04-15 11:31:26,121 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 330 transitions. Word has length 45 [2022-04-15 11:31:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:26,121 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 330 transitions. [2022-04-15 11:31:26,122 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-15 11:31:26,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 330 transitions. [2022-04-15 11:31:26,376 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-15 11:31:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-15 11:31:26,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 11:31:26,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:26,378 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-15 11:31:26,378 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:31:26,378 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:26,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:26,379 INFO L85 PathProgramCache]: Analyzing trace with hash 943673003, now seen corresponding path program 1 times [2022-04-15 11:31:26,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:26,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [193682066] [2022-04-15 11:31:26,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:31:26,380 INFO L85 PathProgramCache]: Analyzing trace with hash 943673003, now seen corresponding path program 2 times [2022-04-15 11:31:26,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:26,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552636060] [2022-04-15 11:31:26,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:26,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:26,670 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-15 11:31:26,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {2770#true} assume true; {2770#true} is VALID [2022-04-15 11:31:26,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2770#true} {2770#true} #591#return; {2770#true} is VALID [2022-04-15 11:31:26,672 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-15 11:31:26,672 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-15 11:31:26,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {2770#true} assume true; {2770#true} is VALID [2022-04-15 11:31:26,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2770#true} {2770#true} #591#return; {2770#true} is VALID [2022-04-15 11:31:26,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {2770#true} call #t~ret159 := main(); {2770#true} is VALID [2022-04-15 11:31:26,673 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-15 11:31:26,673 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-15 11:31:26,673 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-15 11:31:26,673 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-15 11:31:26,673 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-15 11:31:26,673 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-15 11:31:26,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {2770#true} assume !false; {2770#true} is VALID [2022-04-15 11:31:26,674 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-15 11:31:26,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {2770#true} assume 12292 == #t~mem43;havoc #t~mem43; {2770#true} is VALID [2022-04-15 11:31:26,674 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-15 11:31:26,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {2770#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2770#true} is VALID [2022-04-15 11:31:26,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {2770#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2770#true} is VALID [2022-04-15 11:31:26,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {2770#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {2770#true} is VALID [2022-04-15 11:31:26,674 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-15 11:31:26,675 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-15 11:31:26,675 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-15 11:31:26,675 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-15 11:31:26,675 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-15 11:31:26,675 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-15 11:31:26,675 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-15 11:31:26,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {2770#true} ~skip~0 := 0; {2770#true} is VALID [2022-04-15 11:31:26,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {2770#true} assume !false; {2770#true} is VALID [2022-04-15 11:31:26,676 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-15 11:31:26,676 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-15 11:31:26,676 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-15 11:31:26,676 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-15 11:31:26,676 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-15 11:31:26,677 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-15 11:31:26,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {2770#true} assume 4368 == #t~mem48;havoc #t~mem48; {2770#true} is VALID [2022-04-15 11:31:26,677 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-15 11:31:26,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {2770#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2770#true} is VALID [2022-04-15 11:31:26,679 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-15 11:31:26,679 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-15 11:31:26,680 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-15 11:31:26,691 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-15 11:31:26,692 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-15 11:31:26,693 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-15 11:31:26,693 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-15 11:31:26,694 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-15 11:31:26,694 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-15 11:31:26,694 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-15 11:31:26,695 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-15 11:31:26,695 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-15 11:31:26,696 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-15 11:31:26,696 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-15 11:31:26,697 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-15 11:31:26,697 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-15 11:31:26,697 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-15 11:31:26,697 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-15 11:31:26,697 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-15 11:31:26,697 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-15 11:31:26,697 INFO L290 TraceCheckUtils]: 56: Hoare triple {2771#false} assume 4432 == #t~mem56;havoc #t~mem56; {2771#false} is VALID [2022-04-15 11:31:26,697 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-15 11:31:26,697 INFO L290 TraceCheckUtils]: 58: Hoare triple {2771#false} assume 5 == ~blastFlag~0; {2771#false} is VALID [2022-04-15 11:31:26,698 INFO L290 TraceCheckUtils]: 59: Hoare triple {2771#false} assume !false; {2771#false} is VALID [2022-04-15 11:31:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:31:26,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:26,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552636060] [2022-04-15 11:31:26,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552636060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:26,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:26,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:26,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:26,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [193682066] [2022-04-15 11:31:26,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [193682066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:26,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:26,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:26,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658445899] [2022-04-15 11:31:26,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:26,700 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-15 11:31:26,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:26,701 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-15 11:31:26,762 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-15 11:31:26,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:31:26,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:26,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:31:26,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:31:26,764 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-15 11:31:28,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:30,018 INFO L93 Difference]: Finished difference Result 368 states and 543 transitions. [2022-04-15 11:31:30,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:31:30,018 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-15 11:31:30,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:30,019 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-15 11:31:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-15 11:31:30,023 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-15 11:31:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-15 11:31:30,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 390 transitions. [2022-04-15 11:31:30,296 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-15 11:31:30,302 INFO L225 Difference]: With dead ends: 368 [2022-04-15 11:31:30,302 INFO L226 Difference]: Without dead ends: 261 [2022-04-15 11:31:30,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:31:30,304 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:30,304 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.4s Time] [2022-04-15 11:31:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-15 11:31:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 244. [2022-04-15 11:31:30,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:30,319 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-15 11:31:30,320 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-15 11:31:30,321 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-15 11:31:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:30,328 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-15 11:31:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-15 11:31:30,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:30,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:30,330 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-15 11:31:30,330 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-15 11:31:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:30,338 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-15 11:31:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-15 11:31:30,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:30,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:30,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:30,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:30,340 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-15 11:31:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 360 transitions. [2022-04-15 11:31:30,347 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 360 transitions. Word has length 60 [2022-04-15 11:31:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:30,348 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 360 transitions. [2022-04-15 11:31:30,348 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-15 11:31:30,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 360 transitions. [2022-04-15 11:31:30,612 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-15 11:31:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 360 transitions. [2022-04-15 11:31:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 11:31:30,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:30,613 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-15 11:31:30,614 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:31:30,614 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:30,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:30,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1523273022, now seen corresponding path program 3 times [2022-04-15 11:31:30,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:30,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [672008045] [2022-04-15 11:31:41,578 WARN L232 SmtUtils]: Spent 10.96s 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-15 11:31:50,343 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:31:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1523273022, now seen corresponding path program 4 times [2022-04-15 11:31:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:50,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378177130] [2022-04-15 11:31:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:50,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:50,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:50,611 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-15 11:31:50,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {4528#true} assume true; {4528#true} is VALID [2022-04-15 11:31:50,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4528#true} {4528#true} #591#return; {4528#true} is VALID [2022-04-15 11:31:50,612 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-15 11:31:50,612 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-15 11:31:50,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {4528#true} assume true; {4528#true} is VALID [2022-04-15 11:31:50,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4528#true} {4528#true} #591#return; {4528#true} is VALID [2022-04-15 11:31:50,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {4528#true} call #t~ret159 := main(); {4528#true} is VALID [2022-04-15 11:31:50,613 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-15 11:31:50,613 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-15 11:31:50,613 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-15 11:31:50,613 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-15 11:31:50,613 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-15 11:31:50,613 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-15 11:31:50,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {4528#true} assume !false; {4528#true} is VALID [2022-04-15 11:31:50,614 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-15 11:31:50,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {4528#true} assume 12292 == #t~mem43;havoc #t~mem43; {4528#true} is VALID [2022-04-15 11:31:50,614 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-15 11:31:50,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {4528#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4528#true} is VALID [2022-04-15 11:31:50,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {4528#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4528#true} is VALID [2022-04-15 11:31:50,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {4528#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4528#true} is VALID [2022-04-15 11:31:50,614 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-15 11:31:50,614 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-15 11:31:50,615 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-15 11:31:50,615 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-15 11:31:50,616 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-15 11:31:50,616 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-15 11:31:50,616 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-15 11:31:50,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {4528#true} ~skip~0 := 0; {4528#true} is VALID [2022-04-15 11:31:50,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {4528#true} assume !false; {4528#true} is VALID [2022-04-15 11:31:50,616 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-15 11:31:50,618 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-15 11:31:50,618 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-15 11:31:50,618 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-15 11:31:50,619 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-15 11:31:50,619 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-15 11:31:50,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {4528#true} assume 4368 == #t~mem48;havoc #t~mem48; {4528#true} is VALID [2022-04-15 11:31:50,621 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-15 11:31:50,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {4528#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4528#true} is VALID [2022-04-15 11:31:50,623 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-15 11:31:50,624 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-15 11:31:50,624 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-15 11:31:50,624 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-15 11:31:50,625 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-15 11:31:50,625 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-15 11:31:50,626 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-15 11:31:50,626 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-15 11:31:50,626 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-15 11:31:50,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {4529#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4529#false} is VALID [2022-04-15 11:31:50,626 INFO L290 TraceCheckUtils]: 46: Hoare triple {4529#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4529#false} is VALID [2022-04-15 11:31:50,626 INFO L290 TraceCheckUtils]: 47: Hoare triple {4529#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4529#false} is VALID [2022-04-15 11:31:50,627 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-15 11:31:50,627 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-15 11:31:50,627 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-15 11:31:50,627 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-15 11:31:50,627 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-15 11:31:50,627 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-15 11:31:50,630 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-15 11:31:50,631 INFO L290 TraceCheckUtils]: 55: Hoare triple {4529#false} ~skip~0 := 0; {4529#false} is VALID [2022-04-15 11:31:50,631 INFO L290 TraceCheckUtils]: 56: Hoare triple {4529#false} assume !false; {4529#false} is VALID [2022-04-15 11:31:50,631 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-15 11:31:50,631 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-15 11:31:50,631 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-15 11:31:50,631 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-15 11:31:50,631 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-15 11:31:50,631 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-15 11:31:50,632 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-15 11:31:50,632 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-15 11:31:50,632 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-15 11:31:50,632 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-15 11:31:50,632 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-15 11:31:50,632 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-15 11:31:50,632 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-15 11:31:50,632 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-15 11:31:50,632 INFO L290 TraceCheckUtils]: 71: Hoare triple {4529#false} assume 4432 == #t~mem56;havoc #t~mem56; {4529#false} is VALID [2022-04-15 11:31:50,633 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-15 11:31:50,633 INFO L290 TraceCheckUtils]: 73: Hoare triple {4529#false} assume 5 == ~blastFlag~0; {4529#false} is VALID [2022-04-15 11:31:50,633 INFO L290 TraceCheckUtils]: 74: Hoare triple {4529#false} assume !false; {4529#false} is VALID [2022-04-15 11:31:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:31:50,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:50,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378177130] [2022-04-15 11:31:50,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378177130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:50,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:50,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:50,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:50,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [672008045] [2022-04-15 11:31:50,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [672008045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:50,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:50,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95169905] [2022-04-15 11:31:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:50,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 11:31:50,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:50,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:50,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:50,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:31:50,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:50,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:31:50,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:31:50,711 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-15 11:31:52,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:53,845 INFO L93 Difference]: Finished difference Result 655 states and 976 transitions. [2022-04-15 11:31:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:31:53,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 11:31:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-15 11:31:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-15 11:31:53,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-15 11:31:54,200 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-15 11:31:54,213 INFO L225 Difference]: With dead ends: 655 [2022-04-15 11:31:54,214 INFO L226 Difference]: Without dead ends: 427 [2022-04-15 11:31:54,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:31:54,216 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-15 11:31:54,216 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-15 11:31:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-15 11:31:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 266. [2022-04-15 11:31:54,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:54,238 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-15 11:31:54,238 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-15 11:31:54,239 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-15 11:31:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:54,252 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2022-04-15 11:31:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2022-04-15 11:31:54,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:54,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:54,254 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-15 11:31:54,254 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-15 11:31:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:54,271 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2022-04-15 11:31:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2022-04-15 11:31:54,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:54,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:54,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:54,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:54,272 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-15 11:31:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 391 transitions. [2022-04-15 11:31:54,280 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 391 transitions. Word has length 75 [2022-04-15 11:31:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:54,280 INFO L478 AbstractCegarLoop]: Abstraction has 266 states and 391 transitions. [2022-04-15 11:31:54,281 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:54,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 266 states and 391 transitions. [2022-04-15 11:31:54,615 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-15 11:31:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 391 transitions. [2022-04-15 11:31:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 11:31:54,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:54,616 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-15 11:31:54,616 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:31:54,616 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1541928480, now seen corresponding path program 1 times [2022-04-15 11:31:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:54,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [24567286] [2022-04-15 11:32:08,496 WARN L232 SmtUtils]: Spent 8.60s 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-15 11:32:17,548 WARN L232 SmtUtils]: Spent 5.31s 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-15 11:32:18,332 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:32:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1541928480, now seen corresponding path program 2 times [2022-04-15 11:32:18,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:18,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707938457] [2022-04-15 11:32:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:18,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:18,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:18,548 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-15 11:32:18,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {7236#true} assume true; {7236#true} is VALID [2022-04-15 11:32:18,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7236#true} {7236#true} #591#return; {7236#true} is VALID [2022-04-15 11:32:18,549 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-15 11:32:18,549 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-15 11:32:18,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {7236#true} assume true; {7236#true} is VALID [2022-04-15 11:32:18,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7236#true} {7236#true} #591#return; {7236#true} is VALID [2022-04-15 11:32:18,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {7236#true} call #t~ret159 := main(); {7236#true} is VALID [2022-04-15 11:32:18,550 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-15 11:32:18,550 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-15 11:32:18,550 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-15 11:32:18,550 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-15 11:32:18,550 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-15 11:32:18,550 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-15 11:32:18,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {7236#true} assume !false; {7236#true} is VALID [2022-04-15 11:32:18,551 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-15 11:32:18,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {7236#true} assume 12292 == #t~mem43;havoc #t~mem43; {7236#true} is VALID [2022-04-15 11:32:18,555 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-15 11:32:18,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {7236#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7236#true} is VALID [2022-04-15 11:32:18,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {7236#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7236#true} is VALID [2022-04-15 11:32:18,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {7236#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7236#true} is VALID [2022-04-15 11:32:18,559 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-15 11:32:18,560 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-15 11:32:18,560 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-15 11:32:18,561 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-15 11:32:18,561 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-15 11:32:18,561 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-15 11:32:18,562 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-15 11:32:18,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {7236#true} ~skip~0 := 0; {7236#true} is VALID [2022-04-15 11:32:18,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {7236#true} assume !false; {7236#true} is VALID [2022-04-15 11:32:18,563 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-15 11:32:18,563 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-15 11:32:18,563 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-15 11:32:18,563 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-15 11:32:18,563 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-15 11:32:18,563 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-15 11:32:18,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {7236#true} assume 4368 == #t~mem48;havoc #t~mem48; {7236#true} is VALID [2022-04-15 11:32:18,564 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-15 11:32:18,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {7236#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7236#true} is VALID [2022-04-15 11:32:18,566 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-15 11:32:18,566 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-15 11:32:18,567 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-15 11:32:18,567 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-15 11:32:18,567 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-15 11:32:18,568 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-15 11:32:18,568 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-15 11:32:18,569 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-15 11:32:18,569 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-15 11:32:18,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {7237#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7237#false} is VALID [2022-04-15 11:32:18,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {7237#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7237#false} is VALID [2022-04-15 11:32:18,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {7237#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7237#false} is VALID [2022-04-15 11:32:18,570 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-15 11:32:18,570 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-15 11:32:18,570 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-15 11:32:18,570 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-15 11:32:18,570 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-15 11:32:18,570 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-15 11:32:18,570 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-15 11:32:18,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {7237#false} ~skip~0 := 0; {7237#false} is VALID [2022-04-15 11:32:18,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {7237#false} assume !false; {7237#false} is VALID [2022-04-15 11:32:18,570 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-15 11:32:18,571 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-15 11:32:18,571 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-15 11:32:18,571 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-15 11:32:18,571 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-15 11:32:18,571 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-15 11:32:18,571 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-15 11:32:18,571 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-15 11:32:18,571 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-15 11:32:18,571 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-15 11:32:18,571 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-15 11:32:18,572 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-15 11:32:18,572 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-15 11:32:18,572 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-15 11:32:18,572 INFO L290 TraceCheckUtils]: 71: Hoare triple {7237#false} assume 4432 == #t~mem56;havoc #t~mem56; {7237#false} is VALID [2022-04-15 11:32:18,572 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-15 11:32:18,572 INFO L290 TraceCheckUtils]: 73: Hoare triple {7237#false} assume 5 == ~blastFlag~0; {7237#false} is VALID [2022-04-15 11:32:18,572 INFO L290 TraceCheckUtils]: 74: Hoare triple {7237#false} assume !false; {7237#false} is VALID [2022-04-15 11:32:18,574 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-15 11:32:18,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:18,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707938457] [2022-04-15 11:32:18,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707938457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:18,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:18,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:18,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:18,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [24567286] [2022-04-15 11:32:18,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [24567286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:18,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:18,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583345957] [2022-04-15 11:32:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:18,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 11:32:18,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:18,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:18,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:18,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:32:18,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:18,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:32:18,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:32:18,641 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-15 11:32:20,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:21,836 INFO L93 Difference]: Finished difference Result 678 states and 1005 transitions. [2022-04-15 11:32:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:32:21,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 11:32:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:32:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:21,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:32:21,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-15 11:32:22,241 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-15 11:32:22,256 INFO L225 Difference]: With dead ends: 678 [2022-04-15 11:32:22,256 INFO L226 Difference]: Without dead ends: 428 [2022-04-15 11:32:22,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:32:22,258 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-15 11:32:22,258 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-15 11:32:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-04-15 11:32:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 268. [2022-04-15 11:32:22,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:22,288 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-15 11:32:22,289 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-15 11:32:22,289 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-15 11:32:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:22,301 INFO L93 Difference]: Finished difference Result 428 states and 631 transitions. [2022-04-15 11:32:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2022-04-15 11:32:22,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:22,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:22,303 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-15 11:32:22,304 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-15 11:32:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:22,315 INFO L93 Difference]: Finished difference Result 428 states and 631 transitions. [2022-04-15 11:32:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2022-04-15 11:32:22,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:22,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:22,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:22,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:22,317 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-15 11:32:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 392 transitions. [2022-04-15 11:32:22,324 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 392 transitions. Word has length 75 [2022-04-15 11:32:22,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:22,324 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 392 transitions. [2022-04-15 11:32:22,324 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:22,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 392 transitions. [2022-04-15 11:32:22,695 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-15 11:32:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 392 transitions. [2022-04-15 11:32:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 11:32:22,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:22,696 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-15 11:32:22,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:32:22,697 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:22,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:22,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1572013375, now seen corresponding path program 1 times [2022-04-15 11:32:22,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:22,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [500071071] [2022-04-15 11:32:38,643 WARN L232 SmtUtils]: Spent 10.03s 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-15 11:32:47,772 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:32:47,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1572013375, now seen corresponding path program 2 times [2022-04-15 11:32:47,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:47,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615282242] [2022-04-15 11:32:47,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,966 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-15 11:32:47,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-04-15 11:32:47,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9996#true} {9996#true} #591#return; {9996#true} is VALID [2022-04-15 11:32:47,967 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-15 11:32:47,967 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-15 11:32:47,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-04-15 11:32:47,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9996#true} {9996#true} #591#return; {9996#true} is VALID [2022-04-15 11:32:47,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {9996#true} call #t~ret159 := main(); {9996#true} is VALID [2022-04-15 11:32:47,967 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-15 11:32:47,967 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-15 11:32:47,968 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-15 11:32:47,968 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-15 11:32:47,968 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-15 11:32:47,968 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-15 11:32:47,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {9996#true} assume !false; {9996#true} is VALID [2022-04-15 11:32:47,968 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-15 11:32:47,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {9996#true} assume 12292 == #t~mem43;havoc #t~mem43; {9996#true} is VALID [2022-04-15 11:32:47,968 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-15 11:32:47,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {9996#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9996#true} is VALID [2022-04-15 11:32:47,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {9996#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9996#true} is VALID [2022-04-15 11:32:47,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {9996#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9996#true} is VALID [2022-04-15 11:32:47,969 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-15 11:32:47,969 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-15 11:32:47,969 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-15 11:32:47,969 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-15 11:32:47,969 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-15 11:32:47,969 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-15 11:32:47,969 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-15 11:32:47,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {9996#true} ~skip~0 := 0; {9996#true} is VALID [2022-04-15 11:32:47,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {9996#true} assume !false; {9996#true} is VALID [2022-04-15 11:32:47,969 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-15 11:32:47,970 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-15 11:32:47,970 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-15 11:32:47,970 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-15 11:32:47,970 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-15 11:32:47,970 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-15 11:32:47,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {9996#true} assume 4368 == #t~mem48;havoc #t~mem48; {9996#true} is VALID [2022-04-15 11:32:47,970 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-15 11:32:47,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {9996#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9996#true} is VALID [2022-04-15 11:32:47,971 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-15 11:32:47,972 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-15 11:32:47,972 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-15 11:32:47,973 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-15 11:32:47,973 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-15 11:32:47,974 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-15 11:32:47,974 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-15 11:32:47,974 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-15 11:32:47,975 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-15 11:32:47,975 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-15 11:32:47,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {9997#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9997#false} is VALID [2022-04-15 11:32:47,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {9997#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9997#false} is VALID [2022-04-15 11:32:47,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {9997#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9997#false} is VALID [2022-04-15 11:32:47,976 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-15 11:32:47,976 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-15 11:32:47,976 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-15 11:32:47,976 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-15 11:32:47,976 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-15 11:32:47,976 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-15 11:32:47,976 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-15 11:32:47,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {9997#false} ~skip~0 := 0; {9997#false} is VALID [2022-04-15 11:32:47,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {9997#false} assume !false; {9997#false} is VALID [2022-04-15 11:32:47,976 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-15 11:32:47,977 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-15 11:32:47,977 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-15 11:32:47,977 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-15 11:32:47,977 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-15 11:32:47,977 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-15 11:32:47,977 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-15 11:32:47,977 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-15 11:32:47,977 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-15 11:32:47,977 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-15 11:32:47,977 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-15 11:32:47,978 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-15 11:32:47,978 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-15 11:32:47,978 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-15 11:32:47,978 INFO L290 TraceCheckUtils]: 72: Hoare triple {9997#false} assume 4432 == #t~mem56;havoc #t~mem56; {9997#false} is VALID [2022-04-15 11:32:47,978 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-15 11:32:47,978 INFO L290 TraceCheckUtils]: 74: Hoare triple {9997#false} assume 5 == ~blastFlag~0; {9997#false} is VALID [2022-04-15 11:32:47,978 INFO L290 TraceCheckUtils]: 75: Hoare triple {9997#false} assume !false; {9997#false} is VALID [2022-04-15 11:32:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:32:47,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:47,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615282242] [2022-04-15 11:32:47,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615282242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:47,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:47,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:47,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:47,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [500071071] [2022-04-15 11:32:47,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [500071071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:47,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:47,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:47,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208809503] [2022-04-15 11:32:47,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:47,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 11:32:47,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:47,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:48,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:48,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:32:48,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:48,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:32:48,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:32:48,051 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-15 11:32:50,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:51,129 INFO L93 Difference]: Finished difference Result 421 states and 618 transitions. [2022-04-15 11:32:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:32:51,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 11:32:51,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-15 11:32:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-15 11:32:51,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-15 11:32:51,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:51,463 INFO L225 Difference]: With dead ends: 421 [2022-04-15 11:32:51,464 INFO L226 Difference]: Without dead ends: 284 [2022-04-15 11:32:51,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:32:51,465 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:32:51,465 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.4s Time] [2022-04-15 11:32:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-15 11:32:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-15 11:32:51,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:51,478 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-15 11:32:51,479 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-15 11:32:51,480 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-15 11:32:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:51,486 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2022-04-15 11:32:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2022-04-15 11:32:51,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:51,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:51,487 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-15 11:32:51,488 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-15 11:32:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:51,494 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2022-04-15 11:32:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2022-04-15 11:32:51,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:51,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:51,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:51,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:51,496 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-15 11:32:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 391 transitions. [2022-04-15 11:32:51,503 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 391 transitions. Word has length 76 [2022-04-15 11:32:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:51,503 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 391 transitions. [2022-04-15 11:32:51,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:51,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 391 transitions. [2022-04-15 11:32:51,835 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-15 11:32:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 391 transitions. [2022-04-15 11:32:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:32:51,836 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:51,836 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-15 11:32:51,836 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:32:51,836 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1073962757, now seen corresponding path program 1 times [2022-04-15 11:32:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:51,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1951947023] [2022-04-15 11:33:11,613 WARN L232 SmtUtils]: Spent 14.14s 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-15 11:33:20,474 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1073962757, now seen corresponding path program 2 times [2022-04-15 11:33:20,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:20,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883663601] [2022-04-15 11:33:20,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:20,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:20,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:20,656 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-15 11:33:20,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {11954#true} assume true; {11954#true} is VALID [2022-04-15 11:33:20,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11954#true} {11954#true} #591#return; {11954#true} is VALID [2022-04-15 11:33:20,657 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-15 11:33:20,658 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-15 11:33:20,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {11954#true} assume true; {11954#true} is VALID [2022-04-15 11:33:20,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11954#true} {11954#true} #591#return; {11954#true} is VALID [2022-04-15 11:33:20,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {11954#true} call #t~ret159 := main(); {11954#true} is VALID [2022-04-15 11:33:20,658 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-15 11:33:20,658 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-15 11:33:20,658 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-15 11:33:20,658 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-15 11:33:20,658 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-15 11:33:20,659 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-15 11:33:20,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {11954#true} assume !false; {11954#true} is VALID [2022-04-15 11:33:20,659 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-15 11:33:20,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {11954#true} assume 12292 == #t~mem43;havoc #t~mem43; {11954#true} is VALID [2022-04-15 11:33:20,659 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-15 11:33:20,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {11954#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11954#true} is VALID [2022-04-15 11:33:20,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {11954#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11954#true} is VALID [2022-04-15 11:33:20,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {11954#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11954#true} is VALID [2022-04-15 11:33:20,659 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-15 11:33:20,659 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-15 11:33:20,659 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-15 11:33:20,660 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-15 11:33:20,660 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-15 11:33:20,660 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-15 11:33:20,660 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-15 11:33:20,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {11954#true} ~skip~0 := 0; {11954#true} is VALID [2022-04-15 11:33:20,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {11954#true} assume !false; {11954#true} is VALID [2022-04-15 11:33:20,660 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-15 11:33:20,660 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-15 11:33:20,660 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-15 11:33:20,660 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-15 11:33:20,660 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-15 11:33:20,661 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-15 11:33:20,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {11954#true} assume 4368 == #t~mem48;havoc #t~mem48; {11954#true} is VALID [2022-04-15 11:33:20,661 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-15 11:33:20,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {11954#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11954#true} is VALID [2022-04-15 11:33:20,662 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-15 11:33:20,663 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-15 11:33:20,663 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-15 11:33:20,663 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-15 11:33:20,664 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-15 11:33:20,664 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-15 11:33:20,665 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-15 11:33:20,665 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-15 11:33:20,665 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-15 11:33:20,666 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-15 11:33:20,666 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-15 11:33:20,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {11955#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11955#false} is VALID [2022-04-15 11:33:20,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {11955#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11955#false} is VALID [2022-04-15 11:33:20,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {11955#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11955#false} is VALID [2022-04-15 11:33:20,666 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-15 11:33:20,667 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-15 11:33:20,667 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-15 11:33:20,667 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-15 11:33:20,667 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-15 11:33:20,667 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-15 11:33:20,667 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-15 11:33:20,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {11955#false} ~skip~0 := 0; {11955#false} is VALID [2022-04-15 11:33:20,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {11955#false} assume !false; {11955#false} is VALID [2022-04-15 11:33:20,667 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-15 11:33:20,667 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-15 11:33:20,667 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-15 11:33:20,667 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-15 11:33:20,668 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-15 11:33:20,668 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-15 11:33:20,668 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-15 11:33:20,668 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-15 11:33:20,668 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-15 11:33:20,668 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-15 11:33:20,668 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-15 11:33:20,668 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-15 11:33:20,668 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-15 11:33:20,668 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-15 11:33:20,668 INFO L290 TraceCheckUtils]: 73: Hoare triple {11955#false} assume 4432 == #t~mem56;havoc #t~mem56; {11955#false} is VALID [2022-04-15 11:33:20,668 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-15 11:33:20,669 INFO L290 TraceCheckUtils]: 75: Hoare triple {11955#false} assume 5 == ~blastFlag~0; {11955#false} is VALID [2022-04-15 11:33:20,669 INFO L290 TraceCheckUtils]: 76: Hoare triple {11955#false} assume !false; {11955#false} is VALID [2022-04-15 11:33:20,669 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-15 11:33:20,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:20,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883663601] [2022-04-15 11:33:20,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883663601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:20,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:20,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:20,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:20,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1951947023] [2022-04-15 11:33:20,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1951947023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:20,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:20,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:20,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128456312] [2022-04-15 11:33:20,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:20,671 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-15 11:33:20,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:20,671 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-15 11:33:20,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:20,740 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:33:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:20,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:33:20,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:33:20,741 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-15 11:33:22,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:24,009 INFO L93 Difference]: Finished difference Result 421 states and 616 transitions. [2022-04-15 11:33:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:33:24,010 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-15 11:33:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:24,010 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-15 11:33:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-15 11:33:24,013 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-15 11:33:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-15 11:33:24,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 385 transitions. [2022-04-15 11:33:24,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:24,344 INFO L225 Difference]: With dead ends: 421 [2022-04-15 11:33:24,345 INFO L226 Difference]: Without dead ends: 284 [2022-04-15 11:33:24,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:33:24,347 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:24,348 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.4s Time] [2022-04-15 11:33:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-15 11:33:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-15 11:33:24,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:24,362 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-15 11:33:24,363 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-15 11:33:24,364 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-15 11:33:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:24,370 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2022-04-15 11:33:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 411 transitions. [2022-04-15 11:33:24,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:24,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:24,371 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-15 11:33:24,372 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-15 11:33:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:24,379 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2022-04-15 11:33:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 411 transitions. [2022-04-15 11:33:24,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:24,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:24,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:24,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:24,381 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-15 11:33:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 390 transitions. [2022-04-15 11:33:24,388 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 390 transitions. Word has length 77 [2022-04-15 11:33:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:24,388 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 390 transitions. [2022-04-15 11:33:24,388 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-15 11:33:24,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 390 transitions. [2022-04-15 11:33:24,718 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-15 11:33:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2022-04-15 11:33:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 11:33:24,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:24,720 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-15 11:33:24,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:33:24,720 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash 273295172, now seen corresponding path program 1 times [2022-04-15 11:33:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:24,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [937754937] [2022-04-15 11:33:42,497 WARN L232 SmtUtils]: Spent 12.00s 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-15 11:33:53,082 WARN L232 SmtUtils]: Spent 6.73s 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-15 11:33:53,911 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash 273295172, now seen corresponding path program 2 times [2022-04-15 11:33:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:53,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397613497] [2022-04-15 11:33:53,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:54,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:54,102 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-15 11:33:54,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {13912#true} assume true; {13912#true} is VALID [2022-04-15 11:33:54,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13912#true} {13912#true} #591#return; {13912#true} is VALID [2022-04-15 11:33:54,103 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-15 11:33:54,103 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-15 11:33:54,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {13912#true} assume true; {13912#true} is VALID [2022-04-15 11:33:54,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13912#true} {13912#true} #591#return; {13912#true} is VALID [2022-04-15 11:33:54,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {13912#true} call #t~ret159 := main(); {13912#true} is VALID [2022-04-15 11:33:54,103 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-15 11:33:54,103 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-15 11:33:54,103 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-15 11:33:54,104 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-15 11:33:54,104 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-15 11:33:54,104 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-15 11:33:54,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {13912#true} assume !false; {13912#true} is VALID [2022-04-15 11:33:54,104 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-15 11:33:54,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {13912#true} assume 12292 == #t~mem43;havoc #t~mem43; {13912#true} is VALID [2022-04-15 11:33:54,104 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-15 11:33:54,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {13912#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13912#true} is VALID [2022-04-15 11:33:54,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {13912#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13912#true} is VALID [2022-04-15 11:33:54,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {13912#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {13912#true} is VALID [2022-04-15 11:33:54,104 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-15 11:33:54,104 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-15 11:33:54,105 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-15 11:33:54,105 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-15 11:33:54,105 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-15 11:33:54,105 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-15 11:33:54,105 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-15 11:33:54,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {13912#true} ~skip~0 := 0; {13912#true} is VALID [2022-04-15 11:33:54,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {13912#true} assume !false; {13912#true} is VALID [2022-04-15 11:33:54,105 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-15 11:33:54,105 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-15 11:33:54,105 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-15 11:33:54,105 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-15 11:33:54,105 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-15 11:33:54,105 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-15 11:33:54,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {13912#true} assume 4368 == #t~mem48;havoc #t~mem48; {13912#true} is VALID [2022-04-15 11:33:54,106 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-15 11:33:54,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {13912#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13912#true} is VALID [2022-04-15 11:33:54,107 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-15 11:33:54,108 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-15 11:33:54,108 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-15 11:33:54,108 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-15 11:33:54,109 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-15 11:33:54,109 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-15 11:33:54,109 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-15 11:33:54,110 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-15 11:33:54,110 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-15 11:33:54,111 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-15 11:33:54,111 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-15 11:33:54,111 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-15 11:33:54,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {13913#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13913#false} is VALID [2022-04-15 11:33:54,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {13913#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13913#false} is VALID [2022-04-15 11:33:54,112 INFO L290 TraceCheckUtils]: 50: Hoare triple {13913#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {13913#false} is VALID [2022-04-15 11:33:54,112 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-15 11:33:54,112 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-15 11:33:54,112 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-15 11:33:54,112 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-15 11:33:54,112 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-15 11:33:54,112 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-15 11:33:54,112 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-15 11:33:54,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {13913#false} ~skip~0 := 0; {13913#false} is VALID [2022-04-15 11:33:54,112 INFO L290 TraceCheckUtils]: 59: Hoare triple {13913#false} assume !false; {13913#false} is VALID [2022-04-15 11:33:54,112 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,113 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-15 11:33:54,114 INFO L290 TraceCheckUtils]: 74: Hoare triple {13913#false} assume 4432 == #t~mem56;havoc #t~mem56; {13913#false} is VALID [2022-04-15 11:33:54,114 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-15 11:33:54,114 INFO L290 TraceCheckUtils]: 76: Hoare triple {13913#false} assume 5 == ~blastFlag~0; {13913#false} is VALID [2022-04-15 11:33:54,114 INFO L290 TraceCheckUtils]: 77: Hoare triple {13913#false} assume !false; {13913#false} is VALID [2022-04-15 11:33:54,114 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-15 11:33:54,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:54,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397613497] [2022-04-15 11:33:54,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397613497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:54,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:54,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:54,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:54,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [937754937] [2022-04-15 11:33:54,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [937754937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:54,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:54,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236629189] [2022-04-15 11:33:54,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:54,116 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-15 11:33:54,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:54,116 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-15 11:33:54,186 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-15 11:33:54,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:33:54,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:33:54,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:33:54,187 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-15 11:33:56,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:57,225 INFO L93 Difference]: Finished difference Result 412 states and 603 transitions. [2022-04-15 11:33:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:33:57,225 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-15 11:33:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:57,226 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-15 11:33:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-15 11:33:57,228 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-15 11:33:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-15 11:33:57,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 373 transitions. [2022-04-15 11:33:57,537 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-15 11:33:57,542 INFO L225 Difference]: With dead ends: 412 [2022-04-15 11:33:57,542 INFO L226 Difference]: Without dead ends: 275 [2022-04-15 11:33:57,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:33:57,543 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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-15 11:33:57,544 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-15 11:33:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-15 11:33:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-04-15 11:33:57,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:57,555 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-15 11:33:57,555 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-15 11:33:57,556 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-15 11:33:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:57,562 INFO L93 Difference]: Finished difference Result 275 states and 399 transitions. [2022-04-15 11:33:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2022-04-15 11:33:57,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:57,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:57,564 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-15 11:33:57,564 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-15 11:33:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:57,570 INFO L93 Difference]: Finished difference Result 275 states and 399 transitions. [2022-04-15 11:33:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2022-04-15 11:33:57,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:57,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:57,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:57,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:57,571 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-15 11:33:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 389 transitions. [2022-04-15 11:33:57,577 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 389 transitions. Word has length 78 [2022-04-15 11:33:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:57,578 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 389 transitions. [2022-04-15 11:33:57,578 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-15 11:33:57,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 389 transitions. [2022-04-15 11:33:57,905 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-15 11:33:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 389 transitions. [2022-04-15 11:33:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 11:33:57,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:57,906 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-15 11:33:57,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:33:57,906 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:57,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:57,906 INFO L85 PathProgramCache]: Analyzing trace with hash 369392995, now seen corresponding path program 1 times [2022-04-15 11:33:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:57,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236249675] [2022-04-15 11:33:57,907 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:57,907 INFO L85 PathProgramCache]: Analyzing trace with hash 369392995, now seen corresponding path program 2 times [2022-04-15 11:33:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:57,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440980748] [2022-04-15 11:33:57,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,097 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-15 11:33:58,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {15834#true} assume true; {15834#true} is VALID [2022-04-15 11:33:58,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15834#true} {15834#true} #591#return; {15834#true} is VALID [2022-04-15 11:33:58,098 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-15 11:33:58,098 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-15 11:33:58,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {15834#true} assume true; {15834#true} is VALID [2022-04-15 11:33:58,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15834#true} {15834#true} #591#return; {15834#true} is VALID [2022-04-15 11:33:58,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {15834#true} call #t~ret159 := main(); {15834#true} is VALID [2022-04-15 11:33:58,099 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-15 11:33:58,099 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-15 11:33:58,099 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-15 11:33:58,099 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-15 11:33:58,099 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-15 11:33:58,099 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-15 11:33:58,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-15 11:33:58,099 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-15 11:33:58,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {15834#true} assume 12292 == #t~mem43;havoc #t~mem43; {15834#true} is VALID [2022-04-15 11:33:58,100 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-15 11:33:58,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {15834#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15834#true} is VALID [2022-04-15 11:33:58,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {15834#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15834#true} is VALID [2022-04-15 11:33:58,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {15834#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {15834#true} is VALID [2022-04-15 11:33:58,100 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-15 11:33:58,100 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-15 11:33:58,100 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-15 11:33:58,100 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-15 11:33:58,100 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-15 11:33:58,100 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-15 11:33:58,100 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-15 11:33:58,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {15834#true} ~skip~0 := 0; {15834#true} is VALID [2022-04-15 11:33:58,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-15 11:33:58,101 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-15 11:33:58,101 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-15 11:33:58,101 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-15 11:33:58,101 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-15 11:33:58,101 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-15 11:33:58,101 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-15 11:33:58,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {15834#true} assume 4368 == #t~mem48;havoc #t~mem48; {15834#true} is VALID [2022-04-15 11:33:58,101 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-15 11:33:58,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {15834#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15834#true} is VALID [2022-04-15 11:33:58,101 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-15 11:33:58,101 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-15 11:33:58,101 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-15 11:33:58,102 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-15 11:33:58,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {15834#true} ~skip~0 := 0; {15834#true} is VALID [2022-04-15 11:33:58,102 INFO L290 TraceCheckUtils]: 41: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-15 11:33:58,102 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-15 11:33:58,102 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-15 11:33:58,102 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-15 11:33:58,102 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-15 11:33:58,102 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-15 11:33:58,102 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-15 11:33:58,102 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-15 11:33:58,102 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-15 11:33:58,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {15834#true} assume 4384 == #t~mem50;havoc #t~mem50; {15834#true} is VALID [2022-04-15 11:33:58,103 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-15 11:33:58,103 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-15 11:33:58,105 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-15 11:33:58,105 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-15 11:33:58,105 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-15 11:33:58,105 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-15 11:33:58,106 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-15 11:33:58,106 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-15 11:33:58,106 INFO L290 TraceCheckUtils]: 59: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:33:58,107 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-15 11:33:58,107 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-15 11:33:58,107 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-15 11:33:58,108 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-15 11:33:58,108 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-15 11:33:58,108 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-15 11:33:58,109 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-15 11:33:58,109 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-15 11:33:58,109 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-15 11:33:58,109 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-15 11:33:58,110 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-15 11:33:58,110 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-15 11:33:58,110 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-15 11:33:58,111 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-15 11:33:58,111 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-15 11:33:58,111 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-15 11:33:58,112 INFO L290 TraceCheckUtils]: 76: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15835#false} is VALID [2022-04-15 11:33:58,112 INFO L290 TraceCheckUtils]: 77: Hoare triple {15835#false} assume !false; {15835#false} is VALID [2022-04-15 11:33:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 11:33:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:58,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440980748] [2022-04-15 11:33:58,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440980748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:58,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:58,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:33:58,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:58,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236249675] [2022-04-15 11:33:58,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236249675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:58,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:58,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:33:58,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796347042] [2022-04-15 11:33:58,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:58,114 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-15 11:33:58,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:58,114 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-15 11:33:58,180 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-15 11:33:58,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:33:58,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:58,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:33:58,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:33:58,181 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-15 11:34:00,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:01,267 INFO L93 Difference]: Finished difference Result 539 states and 791 transitions. [2022-04-15 11:34:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:01,268 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-15 11:34:01,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:01,268 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-15 11:34:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-15 11:34:01,272 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-15 11:34:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-15 11:34:01,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-15 11:34:01,688 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-15 11:34:01,699 INFO L225 Difference]: With dead ends: 539 [2022-04-15 11:34:01,699 INFO L226 Difference]: Without dead ends: 402 [2022-04-15 11:34:01,700 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:01,702 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-15 11:34:01,702 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-15 11:34:01,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-04-15 11:34:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2022-04-15 11:34:01,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:01,717 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-15 11:34:01,718 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-15 11:34:01,718 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-15 11:34:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:01,728 INFO L93 Difference]: Finished difference Result 402 states and 583 transitions. [2022-04-15 11:34:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-15 11:34:01,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:01,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:01,730 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-15 11:34:01,731 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-15 11:34:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:01,742 INFO L93 Difference]: Finished difference Result 402 states and 583 transitions. [2022-04-15 11:34:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-15 11:34:01,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:01,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:01,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:01,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:01,744 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-15 11:34:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 583 transitions. [2022-04-15 11:34:01,756 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 583 transitions. Word has length 78 [2022-04-15 11:34:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:01,756 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 583 transitions. [2022-04-15 11:34:01,757 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-15 11:34:01,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 402 states and 583 transitions. [2022-04-15 11:34:02,218 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-15 11:34:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-15 11:34:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 11:34:02,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:02,220 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-15 11:34:02,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:34:02,220 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:02,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:02,221 INFO L85 PathProgramCache]: Analyzing trace with hash 431432609, now seen corresponding path program 1 times [2022-04-15 11:34:02,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:02,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [520577179] [2022-04-15 11:34:02,221 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:02,221 INFO L85 PathProgramCache]: Analyzing trace with hash 431432609, now seen corresponding path program 2 times [2022-04-15 11:34:02,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:02,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26952377] [2022-04-15 11:34:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:02,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:02,379 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-15 11:34:02,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {18529#true} assume true; {18529#true} is VALID [2022-04-15 11:34:02,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18529#true} {18529#true} #591#return; {18529#true} is VALID [2022-04-15 11:34:02,381 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-15 11:34:02,381 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-15 11:34:02,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {18529#true} assume true; {18529#true} is VALID [2022-04-15 11:34:02,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18529#true} {18529#true} #591#return; {18529#true} is VALID [2022-04-15 11:34:02,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {18529#true} call #t~ret159 := main(); {18529#true} is VALID [2022-04-15 11:34:02,381 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-15 11:34:02,381 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-15 11:34:02,381 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-15 11:34:02,381 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-15 11:34:02,381 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-15 11:34:02,382 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-15 11:34:02,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {18529#true} assume !false; {18529#true} is VALID [2022-04-15 11:34:02,382 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-15 11:34:02,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {18529#true} assume 12292 == #t~mem43;havoc #t~mem43; {18529#true} is VALID [2022-04-15 11:34:02,382 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-15 11:34:02,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {18529#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18529#true} is VALID [2022-04-15 11:34:02,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {18529#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18529#true} is VALID [2022-04-15 11:34:02,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {18529#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {18529#true} is VALID [2022-04-15 11:34:02,382 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-15 11:34:02,382 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-15 11:34:02,382 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-15 11:34:02,383 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-15 11:34:02,383 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-15 11:34:02,383 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-15 11:34:02,383 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-15 11:34:02,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {18529#true} ~skip~0 := 0; {18529#true} is VALID [2022-04-15 11:34:02,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {18529#true} assume !false; {18529#true} is VALID [2022-04-15 11:34:02,383 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-15 11:34:02,383 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-15 11:34:02,383 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-15 11:34:02,383 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-15 11:34:02,383 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-15 11:34:02,383 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-15 11:34:02,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {18529#true} assume 4368 == #t~mem48;havoc #t~mem48; {18529#true} is VALID [2022-04-15 11:34:02,384 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-15 11:34:02,384 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-15 11:34:02,384 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-15 11:34:02,385 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-15 11:34:02,385 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-15 11:34:02,385 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-15 11:34:02,386 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-15 11:34:02,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:02,386 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-15 11:34:02,386 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-15 11:34:02,387 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-15 11:34:02,387 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-15 11:34:02,387 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-15 11:34:02,388 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-15 11:34:02,388 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-15 11:34:02,388 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-15 11:34:02,389 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-15 11:34:02,389 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-15 11:34:02,389 INFO L290 TraceCheckUtils]: 52: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18530#false} is VALID [2022-04-15 11:34:02,389 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-15 11:34:02,390 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-15 11:34:02,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {18530#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18530#false} is VALID [2022-04-15 11:34:02,390 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-15 11:34:02,390 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-15 11:34:02,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {18530#false} ~skip~0 := 0; {18530#false} is VALID [2022-04-15 11:34:02,390 INFO L290 TraceCheckUtils]: 59: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2022-04-15 11:34:02,390 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-15 11:34:02,390 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-15 11:34:02,390 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-15 11:34:02,390 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-15 11:34:02,390 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-15 11:34:02,390 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-15 11:34:02,390 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-15 11:34:02,391 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-15 11:34:02,391 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-15 11:34:02,391 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-15 11:34:02,391 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-15 11:34:02,391 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-15 11:34:02,391 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-15 11:34:02,391 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-15 11:34:02,391 INFO L290 TraceCheckUtils]: 74: Hoare triple {18530#false} assume 4432 == #t~mem56;havoc #t~mem56; {18530#false} is VALID [2022-04-15 11:34:02,391 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-15 11:34:02,391 INFO L290 TraceCheckUtils]: 76: Hoare triple {18530#false} assume 5 == ~blastFlag~0; {18530#false} is VALID [2022-04-15 11:34:02,391 INFO L290 TraceCheckUtils]: 77: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2022-04-15 11:34:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:34:02,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:02,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26952377] [2022-04-15 11:34:02,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26952377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:02,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:02,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:02,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:02,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [520577179] [2022-04-15 11:34:02,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [520577179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:02,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:02,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:02,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096352653] [2022-04-15 11:34:02,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:02,393 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-15 11:34:02,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:02,394 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-15 11:34:02,463 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-15 11:34:02,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:02,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:02,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:02,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:02,464 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-15 11:34:04,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:05,096 INFO L93 Difference]: Finished difference Result 697 states and 1013 transitions. [2022-04-15 11:34:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:05,096 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-15 11:34:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:05,097 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-15 11:34:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-15 11:34:05,099 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-15 11:34:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-15 11:34:05,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 371 transitions. [2022-04-15 11:34:05,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:05,431 INFO L225 Difference]: With dead ends: 697 [2022-04-15 11:34:05,431 INFO L226 Difference]: Without dead ends: 426 [2022-04-15 11:34:05,432 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:05,433 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-15 11:34:05,434 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-15 11:34:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-04-15 11:34:05,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-04-15 11:34:05,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:05,449 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-15 11:34:05,450 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-15 11:34:05,451 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-15 11:34:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:05,462 INFO L93 Difference]: Finished difference Result 426 states and 615 transitions. [2022-04-15 11:34:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-15 11:34:05,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:05,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:05,464 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-15 11:34:05,465 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-15 11:34:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:05,476 INFO L93 Difference]: Finished difference Result 426 states and 615 transitions. [2022-04-15 11:34:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-15 11:34:05,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:05,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:05,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:05,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:05,478 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-15 11:34:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 615 transitions. [2022-04-15 11:34:05,492 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 615 transitions. Word has length 78 [2022-04-15 11:34:05,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:05,492 INFO L478 AbstractCegarLoop]: Abstraction has 426 states and 615 transitions. [2022-04-15 11:34:05,493 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-15 11:34:05,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 615 transitions. [2022-04-15 11:34:05,999 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-15 11:34:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-15 11:34:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 11:34:06,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:06,001 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-15 11:34:06,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:34:06,001 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:06,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1609163299, now seen corresponding path program 1 times [2022-04-15 11:34:06,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:06,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [982488593] [2022-04-15 11:34:06,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:06,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1609163299, now seen corresponding path program 2 times [2022-04-15 11:34:06,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:06,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379000468] [2022-04-15 11:34:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:06,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:06,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:06,210 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-15 11:34:06,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-15 11:34:06,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21636#true} {21636#true} #591#return; {21636#true} is VALID [2022-04-15 11:34:06,211 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-15 11:34:06,211 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-15 11:34:06,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-15 11:34:06,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21636#true} {21636#true} #591#return; {21636#true} is VALID [2022-04-15 11:34:06,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {21636#true} call #t~ret159 := main(); {21636#true} is VALID [2022-04-15 11:34:06,211 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-15 11:34:06,212 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-15 11:34:06,212 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-15 11:34:06,212 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-15 11:34:06,212 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-15 11:34:06,212 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-15 11:34:06,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-15 11:34:06,212 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-15 11:34:06,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {21636#true} assume 12292 == #t~mem43;havoc #t~mem43; {21636#true} is VALID [2022-04-15 11:34:06,212 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-15 11:34:06,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {21636#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21636#true} is VALID [2022-04-15 11:34:06,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {21636#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21636#true} is VALID [2022-04-15 11:34:06,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {21636#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {21636#true} is VALID [2022-04-15 11:34:06,212 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-15 11:34:06,213 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-15 11:34:06,213 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-15 11:34:06,213 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-15 11:34:06,213 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-15 11:34:06,213 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-15 11:34:06,213 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-15 11:34:06,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-15 11:34:06,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-15 11:34:06,213 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-15 11:34:06,213 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-15 11:34:06,213 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-15 11:34:06,213 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-15 11:34:06,213 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-15 11:34:06,214 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-15 11:34:06,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {21636#true} assume 4368 == #t~mem48;havoc #t~mem48; {21636#true} is VALID [2022-04-15 11:34:06,214 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-15 11:34:06,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {21636#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21636#true} is VALID [2022-04-15 11:34:06,214 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-15 11:34:06,214 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-15 11:34:06,214 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-15 11:34:06,214 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-15 11:34:06,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-15 11:34:06,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-15 11:34:06,214 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-15 11:34:06,215 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-15 11:34:06,215 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-15 11:34:06,215 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-15 11:34:06,215 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-15 11:34:06,215 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-15 11:34:06,215 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-15 11:34:06,215 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-15 11:34:06,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {21636#true} assume 4384 == #t~mem50;havoc #t~mem50; {21636#true} is VALID [2022-04-15 11:34:06,215 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-15 11:34:06,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {21636#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21636#true} is VALID [2022-04-15 11:34:06,215 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-15 11:34:06,215 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-15 11:34:06,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {21636#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21636#true} is VALID [2022-04-15 11:34:06,216 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-15 11:34:06,216 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-15 11:34:06,216 INFO L290 TraceCheckUtils]: 58: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-15 11:34:06,216 INFO L290 TraceCheckUtils]: 59: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-15 11:34:06,216 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-15 11:34:06,216 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-15 11:34:06,216 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-15 11:34:06,216 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-15 11:34:06,216 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-15 11:34:06,216 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-15 11:34:06,216 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-15 11:34:06,216 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-15 11:34:06,217 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-15 11:34:06,217 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-15 11:34:06,217 INFO L290 TraceCheckUtils]: 70: Hoare triple {21636#true} assume 4400 == #t~mem52;havoc #t~mem52; {21636#true} is VALID [2022-04-15 11:34:06,217 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-15 11:34:06,217 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-15 11:34:06,218 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-15 11:34:06,218 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-15 11:34:06,218 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-15 11:34:06,219 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-15 11:34:06,219 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-15 11:34:06,219 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-15 11:34:06,220 INFO L290 TraceCheckUtils]: 79: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:06,220 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-15 11:34:06,220 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-15 11:34:06,221 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-15 11:34:06,221 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-15 11:34:06,221 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-15 11:34:06,221 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-15 11:34:06,222 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-15 11:34:06,222 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-15 11:34:06,222 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-15 11:34:06,223 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-15 11:34:06,223 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-15 11:34:06,223 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-15 11:34:06,223 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-15 11:34:06,224 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-15 11:34:06,224 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-15 11:34:06,224 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-15 11:34:06,225 INFO L290 TraceCheckUtils]: 96: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {21637#false} is VALID [2022-04-15 11:34:06,225 INFO L290 TraceCheckUtils]: 97: Hoare triple {21637#false} assume !false; {21637#false} is VALID [2022-04-15 11:34:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 11:34:06,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:06,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379000468] [2022-04-15 11:34:06,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379000468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:06,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:06,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:06,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:06,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [982488593] [2022-04-15 11:34:06,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [982488593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:06,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:06,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:06,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699343533] [2022-04-15 11:34:06,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:06,227 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-15 11:34:06,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:06,227 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-15 11:34:06,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:06,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:06,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:06,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:06,291 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-15 11:34:08,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:09,291 INFO L93 Difference]: Finished difference Result 854 states and 1242 transitions. [2022-04-15 11:34:09,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:09,291 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-15 11:34:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:09,292 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-15 11:34:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-15 11:34:09,295 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-15 11:34:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-15 11:34:09,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 494 transitions. [2022-04-15 11:34:09,707 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-15 11:34:09,724 INFO L225 Difference]: With dead ends: 854 [2022-04-15 11:34:09,725 INFO L226 Difference]: Without dead ends: 559 [2022-04-15 11:34:09,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:09,726 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-15 11:34:09,726 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-15 11:34:09,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-04-15 11:34:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2022-04-15 11:34:09,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:09,746 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-15 11:34:09,747 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-15 11:34:09,748 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-15 11:34:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:09,766 INFO L93 Difference]: Finished difference Result 559 states and 808 transitions. [2022-04-15 11:34:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-15 11:34:09,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:09,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:09,769 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-15 11:34:09,770 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-15 11:34:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:09,787 INFO L93 Difference]: Finished difference Result 559 states and 808 transitions. [2022-04-15 11:34:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-15 11:34:09,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:09,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:09,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:09,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:09,789 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-15 11:34:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 808 transitions. [2022-04-15 11:34:09,812 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 808 transitions. Word has length 98 [2022-04-15 11:34:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:09,812 INFO L478 AbstractCegarLoop]: Abstraction has 559 states and 808 transitions. [2022-04-15 11:34:09,812 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-15 11:34:09,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 559 states and 808 transitions. [2022-04-15 11:34:10,564 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-15 11:34:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-15 11:34:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 11:34:10,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:10,568 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-15 11:34:10,569 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:34:10,569 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 1 times [2022-04-15 11:34:10,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:10,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1780990580] [2022-04-15 11:34:10,570 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 2 times [2022-04-15 11:34:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:10,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505348742] [2022-04-15 11:34:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:10,759 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-15 11:34:10,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-04-15 11:34:10,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25589#true} {25589#true} #591#return; {25589#true} is VALID [2022-04-15 11:34:10,760 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-15 11:34:10,760 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-15 11:34:10,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-04-15 11:34:10,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25589#true} {25589#true} #591#return; {25589#true} is VALID [2022-04-15 11:34:10,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {25589#true} call #t~ret159 := main(); {25589#true} is VALID [2022-04-15 11:34:10,761 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-15 11:34:10,761 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-15 11:34:10,762 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-15 11:34:10,762 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-15 11:34:10,762 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-15 11:34:10,762 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-15 11:34:10,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-15 11:34:10,762 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-15 11:34:10,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {25589#true} assume 12292 == #t~mem43;havoc #t~mem43; {25589#true} is VALID [2022-04-15 11:34:10,762 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-15 11:34:10,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {25589#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {25589#true} is VALID [2022-04-15 11:34:10,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {25589#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25589#true} is VALID [2022-04-15 11:34:10,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {25589#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {25589#true} is VALID [2022-04-15 11:34:10,763 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-15 11:34:10,763 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-15 11:34:10,763 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-15 11:34:10,763 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-15 11:34:10,763 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-15 11:34:10,763 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-15 11:34:10,763 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-15 11:34:10,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-15 11:34:10,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-15 11:34:10,764 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-15 11:34:10,764 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-15 11:34:10,764 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-15 11:34:10,764 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-15 11:34:10,764 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-15 11:34:10,764 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-15 11:34:10,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {25589#true} assume 4368 == #t~mem48;havoc #t~mem48; {25589#true} is VALID [2022-04-15 11:34:10,764 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-15 11:34:10,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {25589#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25589#true} is VALID [2022-04-15 11:34:10,764 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-15 11:34:10,764 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-15 11:34:10,765 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-15 11:34:10,765 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-15 11:34:10,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-15 11:34:10,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-15 11:34:10,765 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-15 11:34:10,765 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-15 11:34:10,765 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-15 11:34:10,765 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-15 11:34:10,765 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-15 11:34:10,765 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-15 11:34:10,765 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-15 11:34:10,765 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-15 11:34:10,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {25589#true} assume 4384 == #t~mem50;havoc #t~mem50; {25589#true} is VALID [2022-04-15 11:34:10,766 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-15 11:34:10,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {25589#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25589#true} is VALID [2022-04-15 11:34:10,766 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-15 11:34:10,766 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-15 11:34:10,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {25589#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25589#true} is VALID [2022-04-15 11:34:10,766 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-15 11:34:10,766 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-15 11:34:10,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-15 11:34:10,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-15 11:34:10,766 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-15 11:34:10,766 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-15 11:34:10,767 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-15 11:34:10,767 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-15 11:34:10,767 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-15 11:34:10,767 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-15 11:34:10,767 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-15 11:34:10,767 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-15 11:34:10,767 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-15 11:34:10,767 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-15 11:34:10,767 INFO L290 TraceCheckUtils]: 70: Hoare triple {25589#true} assume 4400 == #t~mem52;havoc #t~mem52; {25589#true} is VALID [2022-04-15 11:34:10,767 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-15 11:34:10,768 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-15 11:34:10,768 INFO L290 TraceCheckUtils]: 73: Hoare triple {25589#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {25589#true} is VALID [2022-04-15 11:34:10,768 INFO L290 TraceCheckUtils]: 74: Hoare triple {25589#true} assume !(~ret~0 <= 0); {25589#true} is VALID [2022-04-15 11:34:10,768 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-15 11:34:10,768 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-15 11:34:10,768 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-15 11:34:10,768 INFO L290 TraceCheckUtils]: 78: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-15 11:34:10,768 INFO L290 TraceCheckUtils]: 79: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-15 11:34:10,768 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-15 11:34:10,768 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-15 11:34:10,768 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-15 11:34:10,769 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-15 11:34:10,769 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-15 11:34:10,769 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-15 11:34:10,769 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-15 11:34:10,769 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-15 11:34:10,769 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-15 11:34:10,769 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-15 11:34:10,769 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-15 11:34:10,769 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-15 11:34:10,769 INFO L290 TraceCheckUtils]: 92: Hoare triple {25589#true} assume 4416 == #t~mem54;havoc #t~mem54; {25589#true} is VALID [2022-04-15 11:34:10,770 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-15 11:34:10,770 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-15 11:34:10,770 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-15 11:34:10,771 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-15 11:34:10,771 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-15 11:34:10,771 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-15 11:34:10,772 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-15 11:34:10,772 INFO L290 TraceCheckUtils]: 100: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !false; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:34:10,772 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-15 11:34:10,772 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-15 11:34:10,773 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-15 11:34:10,773 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-15 11:34:10,773 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-15 11:34:10,774 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-15 11:34:10,774 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-15 11:34:10,774 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-15 11:34:10,774 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-15 11:34:10,775 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-15 11:34:10,775 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-15 11:34:10,775 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-15 11:34:10,776 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-15 11:34:10,776 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-15 11:34:10,776 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-15 11:34:10,776 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-15 11:34:10,777 INFO L290 TraceCheckUtils]: 117: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {25590#false} is VALID [2022-04-15 11:34:10,777 INFO L290 TraceCheckUtils]: 118: Hoare triple {25590#false} assume !false; {25590#false} is VALID [2022-04-15 11:34:10,777 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-15 11:34:10,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:10,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505348742] [2022-04-15 11:34:10,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505348742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:10,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:10,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:10,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:10,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1780990580] [2022-04-15 11:34:10,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1780990580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:10,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:10,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202358155] [2022-04-15 11:34:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:10,779 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-15 11:34:10,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:10,779 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-15 11:34:10,848 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-15 11:34:10,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:10,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:10,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:10,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:10,849 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-15 11:34:12,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:13,830 INFO L93 Difference]: Finished difference Result 984 states and 1425 transitions. [2022-04-15 11:34:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:13,830 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-15 11:34:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:13,830 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-15 11:34:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2022-04-15 11:34:13,833 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-15 11:34:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2022-04-15 11:34:13,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 490 transitions. [2022-04-15 11:34:14,152 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-15 11:34:14,179 INFO L225 Difference]: With dead ends: 984 [2022-04-15 11:34:14,179 INFO L226 Difference]: Without dead ends: 556 [2022-04-15 11:34:14,180 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:14,181 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-15 11:34:14,181 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-15 11:34:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-04-15 11:34:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2022-04-15 11:34:14,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:14,202 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-15 11:34:14,202 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-15 11:34:14,203 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-15 11:34:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:14,219 INFO L93 Difference]: Finished difference Result 556 states and 798 transitions. [2022-04-15 11:34:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 798 transitions. [2022-04-15 11:34:14,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:14,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:14,221 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-15 11:34:14,222 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-15 11:34:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:14,237 INFO L93 Difference]: Finished difference Result 556 states and 798 transitions. [2022-04-15 11:34:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 798 transitions. [2022-04-15 11:34:14,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:14,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:14,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:14,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:14,240 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-15 11:34:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 798 transitions. [2022-04-15 11:34:14,261 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 798 transitions. Word has length 119 [2022-04-15 11:34:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:14,261 INFO L478 AbstractCegarLoop]: Abstraction has 556 states and 798 transitions. [2022-04-15 11:34:14,261 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-15 11:34:14,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 556 states and 798 transitions. [2022-04-15 11:34:14,870 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-15 11:34:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 798 transitions. [2022-04-15 11:34:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 11:34:14,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:14,871 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-15 11:34:14,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:34:14,872 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:14,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash 729336437, now seen corresponding path program 1 times [2022-04-15 11:34:14,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:14,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [737527642] [2022-04-15 11:34:14,873 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash 729336437, now seen corresponding path program 2 times [2022-04-15 11:34:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:14,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025128805] [2022-04-15 11:34:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:15,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:15,106 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-15 11:34:15,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {29790#true} assume true; {29790#true} is VALID [2022-04-15 11:34:15,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29790#true} {29790#true} #591#return; {29790#true} is VALID [2022-04-15 11:34:15,107 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-15 11:34:15,107 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-15 11:34:15,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {29790#true} assume true; {29790#true} is VALID [2022-04-15 11:34:15,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29790#true} {29790#true} #591#return; {29790#true} is VALID [2022-04-15 11:34:15,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {29790#true} call #t~ret159 := main(); {29790#true} is VALID [2022-04-15 11:34:15,108 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-15 11:34:15,108 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-15 11:34:15,108 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-15 11:34:15,108 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-15 11:34:15,108 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-15 11:34:15,108 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-15 11:34:15,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {29790#true} assume !false; {29790#true} is VALID [2022-04-15 11:34:15,109 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-15 11:34:15,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {29790#true} assume 12292 == #t~mem43;havoc #t~mem43; {29790#true} is VALID [2022-04-15 11:34:15,109 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-15 11:34:15,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {29790#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {29790#true} is VALID [2022-04-15 11:34:15,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {29790#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {29790#true} is VALID [2022-04-15 11:34:15,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {29790#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {29790#true} is VALID [2022-04-15 11:34:15,109 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-15 11:34:15,109 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-15 11:34:15,109 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-15 11:34:15,109 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-15 11:34:15,109 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-15 11:34:15,110 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-15 11:34:15,110 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-15 11:34:15,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {29790#true} ~skip~0 := 0; {29790#true} is VALID [2022-04-15 11:34:15,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {29790#true} assume !false; {29790#true} is VALID [2022-04-15 11:34:15,110 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-15 11:34:15,110 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-15 11:34:15,110 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-15 11:34:15,110 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-15 11:34:15,110 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-15 11:34:15,110 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-15 11:34:15,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {29790#true} assume 4368 == #t~mem48;havoc #t~mem48; {29790#true} is VALID [2022-04-15 11:34:15,110 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-15 11:34:15,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {29790#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29790#true} is VALID [2022-04-15 11:34:15,111 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-15 11:34:15,111 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-15 11:34:15,111 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-15 11:34:15,111 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-15 11:34:15,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {29790#true} ~skip~0 := 0; {29790#true} is VALID [2022-04-15 11:34:15,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {29790#true} assume !false; {29790#true} is VALID [2022-04-15 11:34:15,111 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-15 11:34:15,111 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-15 11:34:15,111 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-15 11:34:15,111 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-15 11:34:15,111 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-15 11:34:15,111 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-15 11:34:15,112 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-15 11:34:15,112 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-15 11:34:15,112 INFO L290 TraceCheckUtils]: 50: Hoare triple {29790#true} assume 4384 == #t~mem50;havoc #t~mem50; {29790#true} is VALID [2022-04-15 11:34:15,112 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-15 11:34:15,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {29790#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {29790#true} is VALID [2022-04-15 11:34:15,112 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-15 11:34:15,113 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-15 11:34:15,114 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-15 11:34:15,114 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-15 11:34:15,114 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-15 11:34:15,115 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-15 11:34:15,115 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-15 11:34:15,115 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-15 11:34:15,116 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-15 11:34:15,116 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-15 11:34:15,116 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-15 11:34:15,116 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-15 11:34:15,117 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-15 11:34:15,117 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-15 11:34:15,117 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-15 11:34:15,118 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-15 11:34:15,118 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-15 11:34:15,119 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-15 11:34:15,119 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-15 11:34:15,119 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-15 11:34:15,119 INFO L290 TraceCheckUtils]: 73: Hoare triple {29791#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {29791#false} is VALID [2022-04-15 11:34:15,119 INFO L290 TraceCheckUtils]: 74: Hoare triple {29791#false} assume !(~ret~0 <= 0); {29791#false} is VALID [2022-04-15 11:34:15,119 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-15 11:34:15,119 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-15 11:34:15,119 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-15 11:34:15,119 INFO L290 TraceCheckUtils]: 78: Hoare triple {29791#false} ~skip~0 := 0; {29791#false} is VALID [2022-04-15 11:34:15,119 INFO L290 TraceCheckUtils]: 79: Hoare triple {29791#false} assume !false; {29791#false} is VALID [2022-04-15 11:34:15,119 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-15 11:34:15,119 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-15 11:34:15,120 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-15 11:34:15,120 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-15 11:34:15,120 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-15 11:34:15,120 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-15 11:34:15,120 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-15 11:34:15,120 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-15 11:34:15,120 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-15 11:34:15,120 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-15 11:34:15,120 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-15 11:34:15,120 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-15 11:34:15,120 INFO L290 TraceCheckUtils]: 92: Hoare triple {29791#false} assume 4416 == #t~mem54;havoc #t~mem54; {29791#false} is VALID [2022-04-15 11:34:15,120 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-15 11:34:15,120 INFO L290 TraceCheckUtils]: 94: Hoare triple {29791#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {29791#false} is VALID [2022-04-15 11:34:15,121 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-15 11:34:15,121 INFO L290 TraceCheckUtils]: 96: Hoare triple {29791#false} assume !(0 == ~tmp___6~0); {29791#false} is VALID [2022-04-15 11:34:15,121 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-15 11:34:15,121 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-15 11:34:15,121 INFO L290 TraceCheckUtils]: 99: Hoare triple {29791#false} ~skip~0 := 0; {29791#false} is VALID [2022-04-15 11:34:15,121 INFO L290 TraceCheckUtils]: 100: Hoare triple {29791#false} assume !false; {29791#false} is VALID [2022-04-15 11:34:15,121 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-15 11:34:15,121 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-15 11:34:15,121 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-15 11:34:15,121 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-15 11:34:15,121 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-15 11:34:15,121 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-15 11:34:15,122 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-15 11:34:15,122 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-15 11:34:15,122 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-15 11:34:15,122 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-15 11:34:15,122 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-15 11:34:15,122 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-15 11:34:15,122 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-15 11:34:15,122 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-15 11:34:15,122 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-15 11:34:15,122 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-15 11:34:15,122 INFO L290 TraceCheckUtils]: 117: Hoare triple {29791#false} assume 4448 == #t~mem58;havoc #t~mem58; {29791#false} is VALID [2022-04-15 11:34:15,123 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-15 11:34:15,123 INFO L290 TraceCheckUtils]: 119: Hoare triple {29791#false} assume 4 == ~blastFlag~0; {29791#false} is VALID [2022-04-15 11:34:15,123 INFO L290 TraceCheckUtils]: 120: Hoare triple {29791#false} assume !false; {29791#false} is VALID [2022-04-15 11:34:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-15 11:34:15,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:15,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025128805] [2022-04-15 11:34:15,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025128805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:15,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:15,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:15,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:15,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [737527642] [2022-04-15 11:34:15,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [737527642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:15,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:15,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:15,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531198892] [2022-04-15 11:34:15,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:15,125 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-15 11:34:15,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:15,125 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-15 11:34:15,206 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-15 11:34:15,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:15,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:15,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:15,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:15,207 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-15 11:34:17,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:18,303 INFO L93 Difference]: Finished difference Result 1463 states and 2109 transitions. [2022-04-15 11:34:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:18,304 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-15 11:34:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:18,304 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-15 11:34:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-15 11:34:18,306 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-15 11:34:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-15 11:34:18,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-15 11:34:18,632 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-15 11:34:18,678 INFO L225 Difference]: With dead ends: 1463 [2022-04-15 11:34:18,678 INFO L226 Difference]: Without dead ends: 923 [2022-04-15 11:34:18,679 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:18,679 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 111 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:18,680 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.4s Time] [2022-04-15 11:34:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-04-15 11:34:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 640. [2022-04-15 11:34:18,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:18,713 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-15 11:34:18,714 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-15 11:34:18,715 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-15 11:34:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:18,754 INFO L93 Difference]: Finished difference Result 923 states and 1327 transitions. [2022-04-15 11:34:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1327 transitions. [2022-04-15 11:34:18,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:18,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:18,757 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-15 11:34:18,758 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-15 11:34:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:18,798 INFO L93 Difference]: Finished difference Result 923 states and 1327 transitions. [2022-04-15 11:34:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1327 transitions. [2022-04-15 11:34:18,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:18,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:18,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:18,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:18,801 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-15 11:34:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 930 transitions. [2022-04-15 11:34:18,829 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 930 transitions. Word has length 121 [2022-04-15 11:34:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:18,829 INFO L478 AbstractCegarLoop]: Abstraction has 640 states and 930 transitions. [2022-04-15 11:34:18,830 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-15 11:34:18,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 640 states and 930 transitions. [2022-04-15 11:34:19,673 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-15 11:34:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 930 transitions. [2022-04-15 11:34:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 11:34:19,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:19,675 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-15 11:34:19,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:34:19,675 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash -486817289, now seen corresponding path program 1 times [2022-04-15 11:34:19,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:19,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1781180042] [2022-04-15 11:34:19,676 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:19,676 INFO L85 PathProgramCache]: Analyzing trace with hash -486817289, now seen corresponding path program 2 times [2022-04-15 11:34:19,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:19,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843466040] [2022-04-15 11:34:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:19,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:19,867 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-15 11:34:19,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {35854#true} assume true; {35854#true} is VALID [2022-04-15 11:34:19,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35854#true} {35854#true} #591#return; {35854#true} is VALID [2022-04-15 11:34:19,868 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-15 11:34:19,868 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-15 11:34:19,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {35854#true} assume true; {35854#true} is VALID [2022-04-15 11:34:19,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35854#true} {35854#true} #591#return; {35854#true} is VALID [2022-04-15 11:34:19,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {35854#true} call #t~ret159 := main(); {35854#true} is VALID [2022-04-15 11:34:19,869 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-15 11:34:19,869 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-15 11:34:19,869 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-15 11:34:19,869 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-15 11:34:19,869 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-15 11:34:19,869 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-15 11:34:19,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {35854#true} assume !false; {35854#true} is VALID [2022-04-15 11:34:19,869 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-15 11:34:19,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {35854#true} assume 12292 == #t~mem43;havoc #t~mem43; {35854#true} is VALID [2022-04-15 11:34:19,869 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-15 11:34:19,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {35854#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {35854#true} is VALID [2022-04-15 11:34:19,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {35854#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {35854#true} is VALID [2022-04-15 11:34:19,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {35854#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {35854#true} is VALID [2022-04-15 11:34:19,870 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-15 11:34:19,870 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-15 11:34:19,870 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-15 11:34:19,870 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-15 11:34:19,870 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-15 11:34:19,870 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-15 11:34:19,870 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-15 11:34:19,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {35854#true} ~skip~0 := 0; {35854#true} is VALID [2022-04-15 11:34:19,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {35854#true} assume !false; {35854#true} is VALID [2022-04-15 11:34:19,870 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-15 11:34:19,870 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-15 11:34:19,871 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-15 11:34:19,871 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-15 11:34:19,871 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-15 11:34:19,871 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-15 11:34:19,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {35854#true} assume 4368 == #t~mem48;havoc #t~mem48; {35854#true} is VALID [2022-04-15 11:34:19,871 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-15 11:34:19,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {35854#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35854#true} is VALID [2022-04-15 11:34:19,871 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-15 11:34:19,871 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-15 11:34:19,871 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-15 11:34:19,871 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-15 11:34:19,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {35854#true} ~skip~0 := 0; {35854#true} is VALID [2022-04-15 11:34:19,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {35854#true} assume !false; {35854#true} is VALID [2022-04-15 11:34:19,872 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-15 11:34:19,872 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-15 11:34:19,872 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-15 11:34:19,872 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-15 11:34:19,872 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-15 11:34:19,872 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-15 11:34:19,872 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-15 11:34:19,872 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-15 11:34:19,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {35854#true} assume 4384 == #t~mem50;havoc #t~mem50; {35854#true} is VALID [2022-04-15 11:34:19,872 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-15 11:34:19,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {35854#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {35854#true} is VALID [2022-04-15 11:34:19,873 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-15 11:34:19,873 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-15 11:34:19,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {35854#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {35854#true} is VALID [2022-04-15 11:34:19,873 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-15 11:34:19,873 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-15 11:34:19,873 INFO L290 TraceCheckUtils]: 58: Hoare triple {35854#true} ~skip~0 := 0; {35854#true} is VALID [2022-04-15 11:34:19,873 INFO L290 TraceCheckUtils]: 59: Hoare triple {35854#true} assume !false; {35854#true} is VALID [2022-04-15 11:34:19,873 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-15 11:34:19,873 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-15 11:34:19,873 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-15 11:34:19,873 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-15 11:34:19,873 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-15 11:34:19,874 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-15 11:34:19,874 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-15 11:34:19,874 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-15 11:34:19,874 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-15 11:34:19,874 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-15 11:34:19,874 INFO L290 TraceCheckUtils]: 70: Hoare triple {35854#true} assume 4400 == #t~mem52;havoc #t~mem52; {35854#true} is VALID [2022-04-15 11:34:19,874 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-15 11:34:19,874 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-15 11:34:19,874 INFO L290 TraceCheckUtils]: 73: Hoare triple {35854#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {35854#true} is VALID [2022-04-15 11:34:19,874 INFO L290 TraceCheckUtils]: 74: Hoare triple {35854#true} assume !(~ret~0 <= 0); {35854#true} is VALID [2022-04-15 11:34:19,874 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-15 11:34:19,874 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-15 11:34:19,875 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-15 11:34:19,875 INFO L290 TraceCheckUtils]: 78: Hoare triple {35854#true} ~skip~0 := 0; {35854#true} is VALID [2022-04-15 11:34:19,875 INFO L290 TraceCheckUtils]: 79: Hoare triple {35854#true} assume !false; {35854#true} is VALID [2022-04-15 11:34:19,875 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-15 11:34:19,875 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-15 11:34:19,875 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-15 11:34:19,875 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-15 11:34:19,875 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-15 11:34:19,875 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-15 11:34:19,875 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-15 11:34:19,875 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-15 11:34:19,875 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-15 11:34:19,876 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-15 11:34:19,876 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-15 11:34:19,876 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-15 11:34:19,876 INFO L290 TraceCheckUtils]: 92: Hoare triple {35854#true} assume 4416 == #t~mem54;havoc #t~mem54; {35854#true} is VALID [2022-04-15 11:34:19,876 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-15 11:34:19,876 INFO L290 TraceCheckUtils]: 94: Hoare triple {35854#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {35854#true} is VALID [2022-04-15 11:34:19,877 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-15 11:34:19,878 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-15 11:34:19,878 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-15 11:34:19,878 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-15 11:34:19,879 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-15 11:34:19,879 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-15 11:34:19,880 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-15 11:34:19,880 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-15 11:34:19,880 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-15 11:34:19,881 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-15 11:34:19,881 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-15 11:34:19,881 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-15 11:34:19,882 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-15 11:34:19,882 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-15 11:34:19,882 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-15 11:34:19,883 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-15 11:34:19,883 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-15 11:34:19,884 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-15 11:34:19,884 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-15 11:34:19,884 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-15 11:34:19,885 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-15 11:34:19,885 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-15 11:34:19,885 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-15 11:34:19,885 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-15 11:34:19,886 INFO L290 TraceCheckUtils]: 119: Hoare triple {35855#false} assume 4 == ~blastFlag~0; {35855#false} is VALID [2022-04-15 11:34:19,886 INFO L290 TraceCheckUtils]: 120: Hoare triple {35855#false} assume !false; {35855#false} is VALID [2022-04-15 11:34:19,886 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-15 11:34:19,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:19,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843466040] [2022-04-15 11:34:19,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843466040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:19,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:19,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:19,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:19,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1781180042] [2022-04-15 11:34:19,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1781180042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:19,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:19,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100089101] [2022-04-15 11:34:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:19,888 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-15 11:34:19,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:19,888 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-15 11:34:19,964 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-15 11:34:19,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:19,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:19,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:19,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:19,966 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-15 11:34:21,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:23,149 INFO L93 Difference]: Finished difference Result 1659 states and 2429 transitions. [2022-04-15 11:34:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:23,149 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-15 11:34:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:23,149 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-15 11:34:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:34:23,151 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-15 11:34:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:34:23,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 11:34:23,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:23,528 INFO L225 Difference]: With dead ends: 1659 [2022-04-15 11:34:23,528 INFO L226 Difference]: Without dead ends: 1035 [2022-04-15 11:34:23,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:23,530 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 104 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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-15 11:34:23,530 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-15 11:34:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2022-04-15 11:34:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 776. [2022-04-15 11:34:23,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:23,587 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-15 11:34:23,588 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-15 11:34:23,589 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-15 11:34:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:23,638 INFO L93 Difference]: Finished difference Result 1035 states and 1515 transitions. [2022-04-15 11:34:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1515 transitions. [2022-04-15 11:34:23,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:23,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:23,641 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-15 11:34:23,642 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-15 11:34:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:23,690 INFO L93 Difference]: Finished difference Result 1035 states and 1515 transitions. [2022-04-15 11:34:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1515 transitions. [2022-04-15 11:34:23,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:23,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:23,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:23,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:23,693 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-15 11:34:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1166 transitions. [2022-04-15 11:34:23,736 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1166 transitions. Word has length 121 [2022-04-15 11:34:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:23,736 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 1166 transitions. [2022-04-15 11:34:23,736 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-15 11:34:23,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 776 states and 1166 transitions. [2022-04-15 11:34:24,751 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-15 11:34:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1166 transitions. [2022-04-15 11:34:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 11:34:24,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:24,753 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-15 11:34:24,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:34:24,753 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:24,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:24,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2084056150, now seen corresponding path program 1 times [2022-04-15 11:34:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:24,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697333742] [2022-04-15 11:34:24,754 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2084056150, now seen corresponding path program 2 times [2022-04-15 11:34:24,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:24,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931062558] [2022-04-15 11:34:24,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:24,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:24,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:24,942 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-15 11:34:24,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {42806#true} assume true; {42806#true} is VALID [2022-04-15 11:34:24,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42806#true} {42806#true} #591#return; {42806#true} is VALID [2022-04-15 11:34:24,943 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-15 11:34:24,943 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-15 11:34:24,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {42806#true} assume true; {42806#true} is VALID [2022-04-15 11:34:24,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42806#true} {42806#true} #591#return; {42806#true} is VALID [2022-04-15 11:34:24,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {42806#true} call #t~ret159 := main(); {42806#true} is VALID [2022-04-15 11:34:24,944 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-15 11:34:24,944 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-15 11:34:24,944 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-15 11:34:24,944 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-15 11:34:24,944 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-15 11:34:24,944 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-15 11:34:24,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {42806#true} assume !false; {42806#true} is VALID [2022-04-15 11:34:24,944 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-15 11:34:24,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {42806#true} assume 12292 == #t~mem43;havoc #t~mem43; {42806#true} is VALID [2022-04-15 11:34:24,944 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-15 11:34:24,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {42806#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {42806#true} is VALID [2022-04-15 11:34:24,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {42806#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {42806#true} is VALID [2022-04-15 11:34:24,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {42806#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {42806#true} is VALID [2022-04-15 11:34:24,945 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-15 11:34:24,945 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-15 11:34:24,945 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-15 11:34:24,945 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-15 11:34:24,945 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-15 11:34:24,945 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-15 11:34:24,945 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-15 11:34:24,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {42806#true} ~skip~0 := 0; {42806#true} is VALID [2022-04-15 11:34:24,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {42806#true} assume !false; {42806#true} is VALID [2022-04-15 11:34:24,945 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-15 11:34:24,945 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-15 11:34:24,945 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-15 11:34:24,946 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-15 11:34:24,946 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-15 11:34:24,946 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-15 11:34:24,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {42806#true} assume 4368 == #t~mem48;havoc #t~mem48; {42806#true} is VALID [2022-04-15 11:34:24,946 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-15 11:34:24,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {42806#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42806#true} is VALID [2022-04-15 11:34:24,946 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-15 11:34:24,946 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-15 11:34:24,946 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-15 11:34:24,946 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-15 11:34:24,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {42806#true} ~skip~0 := 0; {42806#true} is VALID [2022-04-15 11:34:24,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {42806#true} assume !false; {42806#true} is VALID [2022-04-15 11:34:24,947 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-15 11:34:24,947 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-15 11:34:24,947 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-15 11:34:24,951 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-15 11:34:24,951 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-15 11:34:24,951 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-15 11:34:24,951 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-15 11:34:24,951 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-15 11:34:24,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {42806#true} assume 4384 == #t~mem50;havoc #t~mem50; {42806#true} is VALID [2022-04-15 11:34:24,951 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-15 11:34:24,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {42806#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42806#true} is VALID [2022-04-15 11:34:24,951 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-15 11:34:24,952 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-15 11:34:24,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {42806#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {42806#true} is VALID [2022-04-15 11:34:24,952 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-15 11:34:24,952 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-15 11:34:24,952 INFO L290 TraceCheckUtils]: 58: Hoare triple {42806#true} ~skip~0 := 0; {42806#true} is VALID [2022-04-15 11:34:24,952 INFO L290 TraceCheckUtils]: 59: Hoare triple {42806#true} assume !false; {42806#true} is VALID [2022-04-15 11:34:24,952 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-15 11:34:24,952 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-15 11:34:24,952 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-15 11:34:24,952 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-15 11:34:24,952 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-15 11:34:24,952 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-15 11:34:24,952 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-15 11:34:24,953 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-15 11:34:24,953 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-15 11:34:24,953 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-15 11:34:24,953 INFO L290 TraceCheckUtils]: 70: Hoare triple {42806#true} assume 4400 == #t~mem52;havoc #t~mem52; {42806#true} is VALID [2022-04-15 11:34:24,953 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-15 11:34:24,953 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-15 11:34:24,953 INFO L290 TraceCheckUtils]: 73: Hoare triple {42806#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {42806#true} is VALID [2022-04-15 11:34:24,953 INFO L290 TraceCheckUtils]: 74: Hoare triple {42806#true} assume !(~ret~0 <= 0); {42806#true} is VALID [2022-04-15 11:34:24,953 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-15 11:34:24,958 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-15 11:34:24,959 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-15 11:34:24,959 INFO L290 TraceCheckUtils]: 78: Hoare triple {42806#true} ~skip~0 := 0; {42806#true} is VALID [2022-04-15 11:34:24,959 INFO L290 TraceCheckUtils]: 79: Hoare triple {42806#true} assume !false; {42806#true} is VALID [2022-04-15 11:34:24,959 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-15 11:34:24,959 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-15 11:34:24,959 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-15 11:34:24,959 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-15 11:34:24,959 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-15 11:34:24,959 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-15 11:34:24,959 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-15 11:34:24,959 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-15 11:34:24,960 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-15 11:34:24,960 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-15 11:34:24,960 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-15 11:34:24,960 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-15 11:34:24,960 INFO L290 TraceCheckUtils]: 92: Hoare triple {42806#true} assume 4416 == #t~mem54;havoc #t~mem54; {42806#true} is VALID [2022-04-15 11:34:24,960 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-15 11:34:24,960 INFO L290 TraceCheckUtils]: 94: Hoare triple {42806#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {42806#true} is VALID [2022-04-15 11:34:24,961 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-15 11:34:24,962 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-15 11:34:24,962 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-15 11:34:24,962 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-15 11:34:24,962 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-15 11:34:24,963 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-15 11:34:24,963 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-15 11:34:24,963 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-15 11:34:24,964 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-15 11:34:24,964 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-15 11:34:24,964 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-15 11:34:24,964 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-15 11:34:24,965 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-15 11:34:24,965 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-15 11:34:24,965 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-15 11:34:24,966 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-15 11:34:24,966 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-15 11:34:24,966 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-15 11:34:24,966 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-15 11:34:24,967 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-15 11:34:24,967 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-15 11:34:24,967 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-15 11:34:24,968 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-15 11:34:24,968 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-15 11:34:24,968 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-15 11:34:24,968 INFO L290 TraceCheckUtils]: 120: Hoare triple {42807#false} assume 4 == ~blastFlag~0; {42807#false} is VALID [2022-04-15 11:34:24,968 INFO L290 TraceCheckUtils]: 121: Hoare triple {42807#false} assume !false; {42807#false} is VALID [2022-04-15 11:34:24,969 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-15 11:34:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:24,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931062558] [2022-04-15 11:34:24,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931062558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:24,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:24,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:24,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:24,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [697333742] [2022-04-15 11:34:24,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [697333742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:24,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:24,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:24,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893037508] [2022-04-15 11:34:24,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:24,970 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-15 11:34:24,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:24,971 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-15 11:34:25,043 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-15 11:34:25,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:25,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:25,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:25,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:25,044 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-15 11:34:27,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:28,200 INFO L93 Difference]: Finished difference Result 1819 states and 2709 transitions. [2022-04-15 11:34:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:28,200 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-15 11:34:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:28,201 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-15 11:34:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:34:28,203 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-15 11:34:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:34:28,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 11:34:28,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:28,579 INFO L225 Difference]: With dead ends: 1819 [2022-04-15 11:34:28,579 INFO L226 Difference]: Without dead ends: 1059 [2022-04-15 11:34:28,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:28,581 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-15 11:34:28,581 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-15 11:34:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2022-04-15 11:34:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 804. [2022-04-15 11:34:28,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:28,632 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-15 11:34:28,633 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-15 11:34:28,633 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-15 11:34:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:28,682 INFO L93 Difference]: Finished difference Result 1059 states and 1559 transitions. [2022-04-15 11:34:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1559 transitions. [2022-04-15 11:34:28,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:28,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:28,685 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-15 11:34:28,686 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-15 11:34:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:28,729 INFO L93 Difference]: Finished difference Result 1059 states and 1559 transitions. [2022-04-15 11:34:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1559 transitions. [2022-04-15 11:34:28,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:28,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:28,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:28,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:28,732 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-15 11:34:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1218 transitions. [2022-04-15 11:34:28,777 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1218 transitions. Word has length 122 [2022-04-15 11:34:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:28,778 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 1218 transitions. [2022-04-15 11:34:28,778 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-15 11:34:28,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 804 states and 1218 transitions. [2022-04-15 11:34:29,957 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-15 11:34:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1218 transitions. [2022-04-15 11:34:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-15 11:34:29,960 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:29,960 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-15 11:34:29,960 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:34:29,960 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 1 times [2022-04-15 11:34:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:29,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765233332] [2022-04-15 11:34:29,961 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 2 times [2022-04-15 11:34:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:29,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256889101] [2022-04-15 11:34:29,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 11:34:31,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 11:34:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 11:34:31,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 11:34:31,512 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 11:34:31,512 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 11:34:31,518 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 11:34:31,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:34:31,522 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 11:34:31,525 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 11:34:31,574 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 11:34:31,574 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 11:34:31,574 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-15 11:34:31,574 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 11:34:31,574 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 11:34:31,574 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-15 11:34:31,574 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 11:34:31,574 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-15 11:34:31,574 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1136-2 has no Hoare annotation [2022-04-15 11:34:31,575 WARN L170 areAnnotationChecker]: L1136 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1136 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1678-1 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 11:34:31,576 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1658 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1154 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1662 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1662 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1662-2 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1157 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1159 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1159 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1162 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1162 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1267 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1267 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1267-2 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-15 11:34:31,577 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1281 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1281 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1279-2 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1313 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1313 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1292 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1292 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1313-2 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1313-2 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1299 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1299 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1325 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1325 has no Hoare annotation [2022-04-15 11:34:31,578 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1591 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1344 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1344 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1353 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1353 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1627-1 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1344-2 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1353-2 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1357 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1357 has no Hoare annotation [2022-04-15 11:34:31,579 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1357-2 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1357-2 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1374 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1374 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1631 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1631 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1629-2 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1629-2 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1374-2 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1374-2 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1397 has no Hoare annotation [2022-04-15 11:34:31,580 WARN L170 areAnnotationChecker]: L1397 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1402 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1402 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1210 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1210 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-15 11:34:31,581 WARN L170 areAnnotationChecker]: L1423-2 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1452-2 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1463 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1463 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-15 11:34:31,582 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1483 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1483 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1483-2 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1489 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1489 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-15 11:34:31,583 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1515 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1515 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1513-1 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1535 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1535 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1535-2 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-15 11:34:31,584 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-15 11:34:31,585 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-15 11:34:31,585 WARN L170 areAnnotationChecker]: L1544-2 has no Hoare annotation [2022-04-15 11:34:31,586 WARN L170 areAnnotationChecker]: L1561 has no Hoare annotation [2022-04-15 11:34:31,586 WARN L170 areAnnotationChecker]: L1561 has no Hoare annotation [2022-04-15 11:34:31,586 WARN L170 areAnnotationChecker]: L1561-2 has no Hoare annotation [2022-04-15 11:34:31,586 WARN L170 areAnnotationChecker]: L1566 has no Hoare annotation [2022-04-15 11:34:31,586 WARN L170 areAnnotationChecker]: L1566 has no Hoare annotation [2022-04-15 11:34:31,586 WARN L170 areAnnotationChecker]: L1566-2 has no Hoare annotation [2022-04-15 11:34:31,586 WARN L170 areAnnotationChecker]: L1573 has no Hoare annotation [2022-04-15 11:34:31,586 WARN L170 areAnnotationChecker]: L1573 has no Hoare annotation [2022-04-15 11:34:31,586 WARN L170 areAnnotationChecker]: L1573-2 has no Hoare annotation [2022-04-15 11:34:31,586 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-15 11:34:31,586 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-15 11:34:31,586 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 11:34:31,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 11:34:31 BoogieIcfgContainer [2022-04-15 11:34:31,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 11:34:31,594 INFO L158 Benchmark]: Toolchain (without parser) took 197137.86ms. Allocated memory was 170.9MB in the beginning and 297.8MB in the end (delta: 126.9MB). Free memory was 117.5MB in the beginning and 84.5MB in the end (delta: 33.0MB). Peak memory consumption was 161.4MB. Max. memory is 8.0GB. [2022-04-15 11:34:31,594 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 170.9MB. Free memory was 137.0MB in the beginning and 136.9MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:34:31,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.71ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 117.3MB in the beginning and 159.9MB in the end (delta: -42.6MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-04-15 11:34:31,595 INFO L158 Benchmark]: Boogie Preprocessor took 127.43ms. Allocated memory is still 205.5MB. Free memory was 159.9MB in the beginning and 150.9MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-15 11:34:31,595 INFO L158 Benchmark]: RCFGBuilder took 2265.36ms. Allocated memory is still 205.5MB. Free memory was 150.9MB in the beginning and 115.8MB in the end (delta: 35.1MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. [2022-04-15 11:34:31,595 INFO L158 Benchmark]: TraceAbstraction took 194102.16ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 115.3MB in the beginning and 84.5MB in the end (delta: 30.8MB). Peak memory consumption was 123.0MB. Max. memory is 8.0GB. [2022-04-15 11:34:31,595 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.19ms. Allocated memory is still 170.9MB. Free memory was 137.0MB in the beginning and 136.9MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 636.71ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 117.3MB in the beginning and 159.9MB in the end (delta: -42.6MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 127.43ms. Allocated memory is still 205.5MB. Free memory was 159.9MB in the beginning and 150.9MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2265.36ms. Allocated memory is still 205.5MB. Free memory was 150.9MB in the beginning and 115.8MB in the end (delta: 35.1MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. * TraceAbstraction took 194102.16ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 115.3MB in the beginning and 84.5MB in the end (delta: 30.8MB). Peak memory consumption was 123.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: 194.0s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 52.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 1199 SdHoareTripleChecker+Valid, 35.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1199 mSDsluCounter, 6045 SdHoareTripleChecker+Invalid, 35.3s 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.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s 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.2s 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-15 11:34:31,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...